Note sur la non existence d'un snark d'ordre 16
暂无分享,去创建一个
In this note we show that there is no snark (i.e. a cyclically 4-edge connected cubic graph, without square, and with chromatic index 4) with exactly 16 vertices.
[1] S. Cobeljic,et al. Computer investigation of cubic graphs , 1976 .
[2] R. Isaacs. Infinite Families of Nontrivial Trivalent Graphs Which are not Tait Colorable , 1975 .
[3] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[4] C. Berge. Graphes et hypergraphes , 1970 .
[5] Robin J. Wilson,et al. Edge-colourings of graphs , 1977 .