Result 1 to 20 of 129 total
Linear time construction of a compressed Gray code. (English)
Eur. J. Comb. 34, No. 1, 69-81 (2013).
1
The Wiener index in iterated line graphs. (English)
Discrete Appl. Math. 160, No. 15, 2234-2245 (2012).
2
Some results on Vizing’s conjecture and related problems. (English)
Discrete Appl. Math. 160, No. 16-17, 2484-2490 (2012).
3
Parity vertex colorings of binomial trees. (English)
Discuss. Math., Graph Theory 32, No. 1, 177-180 (2012).
4
Queue layouts of hypercubes. (English)
SIAM J. Discrete Math. 26, No. 1, 77-88 (2012).
5
Some remarks on inverse Wiener index problem. (English)
Discrete Appl. Math. 160, No. 12, 1851-1858 (2012).
6
A note on Zagreb indices inequality for trees and unicyclic graphs. (English)
Ars Math. Contemp. 5, No. 1, 73-76 (2012).
7
Bipartizing fullerenes. (English)
Eur. J. Comb. 33, No. 6, 1286-1293 (2012).
8
Acyclic edge coloring of planar graphs with $\varDelta$ colors. (English)
Discrete Appl. Math. 160, No. 9, 1356-1368 (2012).
9
Brooks’ theorem for generalized dart graphs. (English)
Inf. Process. Lett. 112, No. 5, 200-204 (2012).
10
On a conjecture about Wiener index in iterated line graphs of trees. (English)
Discrete Math. 312, No. 6, 1094-1105 (2012).
11
Hyperbolic analogues of fullerenes on orientable surfaces. (English)
Discrete Math. 312, No. 4, 729-736 (2012).
12
Contour map patterns. (English)
J. Math. Arts 5, No. 3, 129-140 (2011).
13
Graphs with two crossings are 5-choosable. (English)
SIAM J. Discrete Math. 25, No. 4, 1746-1753 (2011).
14
On the 2-resonance of fullerenes. (English)
SIAM J. Discrete Math. 25, No. 4, 1737-1745 (2011).
15
Graphs with odd cycle lengths 5 and 7 are 3-colorable. (English)
SIAM J. Discrete Math. 25, No. 3, 1069-1088 (2011).
16
Dichotomy for coloring of dart graphs. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 82-89 (2011).
17
On the Zagreb index inequality of graphs with prescribed vertex degrees. (English)
Discrete Appl. Math. 159, No. 8, 852-858 (2011).
18
Randić index and the diameter of a graph. (English)
Eur. J. Comb. 32, No. 3, 434-442 (2011).
19
Randić index and the diameter of a graph (English)
Eur. J. Comb. 32, No. 3, 434-442 (2011).
20
Result 1 to 20 of 129 total
Start
Contact
Print
General Help
