Result 1 to 20 of 51 total
Graph edge coloring. Vizing’s theorem and Goldberg’s conjecture. (English)
Wiley Series in Discrete Mathematics and Optimization. Hoboken, NJ: John Wiley \& Sons (ISBN 978-1-118-09137-1/hbk). xiv, 321~p. \sterling~66.95; EUR~80.00 (2012).
1
Double-critical graphs and complete minors. (English)
Electron. J. Comb. 17, No. 1, Research Paper R87, 27 p. (2010).
2
A basic elementary extension of the Duchet-Meyniel theorem. (English)
Discrete Math. 310, No. 3, 480-488 (2010).
3
On six problems posed by Jarik Nešetřil. (English)
Klazar, Martin (ed.) et al., Topics in discrete mathematics. Dedicated to Jarik Nešetřil on the occasion of his 60th birthday. Berlin: Springer (ISBN 3-540-33698-2/hbk). Algorithms and Combinatorics 26, 613-627 (2006).
4
Improvements of the theorem of Duchet and Meyniel on Hadwiger’s conjecture. (English)
J. Comb. Theory, Ser. B 95, No. 1, 152-167 (2005).
5
Deeply asymmetric planar graphs. (English)
J. Comb. Theory, Ser. B 95, No. 1, 68-78 (2005).
6
Any 7-chromatic graph has $K_7$ or $K_{4,4}$ as a minor. (English)
Combinatorica 25, No. 3, 327-353 (2005).
7
Improvements of the theorem of duchet and meyniel on hadwiger’s conjecture (English)
J. Comb. Theory, Ser. B 95, No. 1, 152-167 (2005).
8
Deeply asymmetric planar graphs (English)
J. Comb. Theory, Ser. B 95, No. 1, 68-78 (2005).
9
On a special case of Hadwiger’s conjecture. (English)
Discuss. Math., Graph Theory 23, No. 2, 333-363 (2003).
10
Coloring of the incidentors and vertices of an undirected multigraph. (Russian)
Diskretn. Anal. Issled. Oper., Ser. 1 8, No.3, 3-14 (2001).
11
25 pretty graph colouring problems. (English)
Discrete Math. 229, No.1-3, 167-169 (2001).
12
Variable degeneracy: Extensions of Brooks’ and Gallai’s theorems. (English)
Discrete Math. 214, No.1-3, 101-112 (2000).
13
On the Hajós number of graphs. (English)
Discrete Math. 213, No.1-3, 153-161 (2000).
14
On interval colourings of bi-regular bipartite graphs. (English)
Ars Comb. 50, 23-32 (1998).
15
A survey of Hadwiger’s conjecture. (English)
Congr. Numerantium 115, 249-283 (1996).
16
Choosability of bipartite graphs. (English)
Ars Comb. 44, 183-192 (1996).
17
Choosability versus chromaticity—the plane unit distance graph has a $2$-chromatic subgraph of infinite list-chromatic number. (English)
Geombinatorics 5, No.2, 45-64 (1995).
18
Colouring, stable sets and perfect graphs. (English)
Graham, R. L. (ed.) et al., Handbook of combinatorics. Vol. 1-2. Amsterdam: Elsevier (North-Holland). 233-288 (1995).
19
An abstract generalization of a map reduction theorem of Birkhoff. (English)
J. Comb. Theory, Ser. B 65, No.2, 165-185 (1995).
20
Result 1 to 20 of 51 total
Start
Contact
Print
General Help
