论文信息 - Total coloring of snarks is NP-complete

Total coloring of snarks is NP-complete

Snarks are bridgeless cubic graphs that do not allow 3-edgecolorings. We prove that the problem of determining if a snark is of Type 1 is NP-complete.

Diana Sasaki | Vińıcius F. dos Santos | V. F. D. Santos | D. Sasaki

[1] M. Rosenfeld,et al. On the total coloring of certain graphs , 1971 .

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

[3] Abddn SANCHEZ-ARROYO,et al. Determining the total colouring number is np-hard , 1989, Discret. Math..

[4] Alberto Cavicchioli,et al. Special Classes of Snarks , 2003 .

[5] C. N. Campos,et al. The total-chromatic number of some families of snarks , 2011, Discret. Math..

[6] Klas Markström,et al. Generation and properties of snarks , 2013, J. Comb. Theory, Ser. B.

[7] Celina M. H. de Figueiredo,et al. The hunting of a snark with total chromatic number 5 , 2014, Discret. Appl. Math..

[8] Diana Sasaki,et al. Snarks with total chromatic number 5 , 2015, Discret. Math. Theor. Comput. Sci..

[9] Celina M. H. de Figueiredo,et al. On the equitable total chromatic number of cubic graphs , 2016, Discret. Appl. Math..