Result 61 to 80 of 129 total
Four gravity results. (English)
Discrete Math. 307, No. 2, 181-190 (2007).
61
On cube-free median graphs. (English)
Discrete Math. 307, No. 3-5, 345-351 (2007).
62
The circular chromatic index of graphs of high girth. (English)
J. Comb. Theory, Ser. B 97, No. 1, 1-13 (2007).
63
The circular chromatic index of graphs of high girth (English)
J. Comb. Theory, Ser. B 97, No. 1, 1-13 (2007).
64
Cyclic, diagonal and facial colorings - a missing case (English)
Eur. J. Comb. 28, No. 6, 1637-1639 (2007).
65
$T$-joins intersecting small edge-cuts in graphs (English)
Journal of Graph Theory 56, No. 1, 64-71 (2007).
66
3-facial colouring of plane graphs. (English)
Comput. Res. Repos. 2006, Article No. 0607008 (2006).
67
Construction of large graphs with no optimal surjective $L(2,1)$-labelings. (English)
SIAM J. Discrete Math. 20, No. 2, 536-543 (2006).
68
Colorings of planar graphs with no rainbow faces. (English)
Combinatorica 26, No. 2, 169-182 (2006).
69
Roots of cube polynomials of median graphs. (English)
J. Graph Theory 52, No. 1, 37-50 (2006).
70
A theorem about a contractible and light edge. (English)
SIAM J. Discrete Math. 20, No. 1, 55-61 (2006).
71
The last excluded case of Dirac’s map-color theorem for choosability. (English)
J. Graph Theory 51, No. 4, 319-354 (2006).
72
A map colour theorem for the union of graphs. (English)
J. Comb. Theory, Ser. B 96, No. 1, 20-37 (2006).
73
A map colour theorem for the union of graphs (English)
J. Comb. Theory, Ser. B 96, No. 1, 20-37 (2006).
74
Roots of cube polynomials of median graphs (English)
Journal of Graph Theory 52, No. 1, 37-50 (2006).
75
The last excluded case of Dirac’s map-color theorem for choosability (English)
Journal of Graph Theory 51, No. 4, 319-354 (2006).
76
Cycles intersecting edge-cuts of prescribed sizes. (English)
Felsner, Stefan (ed.), 2005 European conference on combinatorics, graph theory and applications (EuroComb ’05). Extended abstracts from the conference, Technische Universität Berlin, Berlin, Germany, September 5‒9, 2005. Paris: Maison de l’Informatique et des Mathématiques Discrètes (MIMD). Discrete Mathematics \& Theoretical Computer Science. Proceedings. AE, 303-308, electronic only (2005).
77
A Brooks-type theorem for the generalized list $T$-coloring. (English)
SIAM J. Discrete Math. 19, No. 3, 588-609 (2005).
78
Nordhaus-Gaddum-type theorems for decompositions into many parts. (English)
J. Graph Theory 50, No. 4, 273-292 (2005).
79
Nowhere-zero 3-flows in abelian Cayley graphs. (English)
Discrete Math. 297, No. 1-3, 119-127 (2005).
80
Result 61 to 80 of 129 total
Start
Contact
Print
General Help
