论文信息 - Non-Bicritical Critical Snarks

Non-Bicritical Critical Snarks

Abstract. Snarks are cubic graphs with chromatic index χ′=4. A snark G is called critical if χ′ (G−{v,w})=3 for any two adjacent vertices v and w, and it is called bicritical if χ′ (G−{v,w})=3 for any two vertices v and w. We construct infinite families of critical snarks which are not bicritical. This solves a problem stated by Nedela and Škoviera.

Eckhard Steffen | E. Steffen

[1] Martin Skoviera,et al. Decompositions and reductions of snarks , 1996, J. Graph Theory.

[2] Eckhard Steffen,et al. Snarks and Reducibility , 1998, Ars Comb..

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

[4] R. Isaacs. Infinite Families of Nontrivial Trivalent Graphs Which are not Tait Colorable , 1975 .

[5] Eckhard Steffen,et al. Classifications and characterizations of snarks , 1998, Discret. Math..

[6] Peter J. Cameron,et al. Decomposition of snarks , 1987, J. Graph Theory.

[7] Paul I. Feder. Annals of Discrete Mathematics, Vol. 6: Combinatorial Mathematics, Optimal Designs and Their Applications , 1981 .

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