论文信息 - 3- and 4-critical Graphs of Small Even Order

3- and 4-critical Graphs of Small Even Order

We show that there is exactly one 3-critical graph of order 22 and that there are exactly nine of order 24. The graph of order 22 is shown to be the smallest 3-critical graph of even order. We also show that there are exactly two 4-critical graphs of order 18, and that these graphs are the smallest 4-critical graphs of even order. The results are obtained with the aid of a computer.

Eckhard Steffen | Gunnar Brinkmann | G. Brinkmann | E. Steffen

[1] Anthony J. W. Hilton,et al. Edge‐Colorings of Graphs: A Progress Report , 1989 .

[2] J. Gross,et al. Graph Theory and Its Applications , 1998 .

[3] G. Brinkmann. Fast generation of cubic graphs , 1996 .

[4] Mark K. Goldberg,et al. Construction of class 2 graphs with maximum vertex degree 3 , 1981, J. Comb. Theory, Ser. B.

[5] H. Yap. Some Topics in Graph Theory , 1986 .

[6] Nicholas C. Wormald,et al. Numbers of cubic graphs , 1983, J. Graph Theory.

[7] Robin J. Wilson,et al. Edge-colourings of graphs , 1977 .

[8] Brendan D. McKay,et al. Isomorph-Free Exhaustive Generation , 1998, J. Algorithms.

[9] Sheshayya A. Choudum,et al. There are no edge-chromatic 4-critical graphs of order 12 , 1995, Discret. Math..