A cyclically 6-edge-connected snark of order 118

Discrete Mathematics

Volumn 161, Issue 1-3, 1996, Pages 297-300

  Kochol, Martin ^a  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040888383     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00237-Q     Document Type: Article

References (7)

1. M.A. Fiol, A Boolean algebra approach to the construction of snarks, in: Y. Alavi, G. Chartrand, O.R. Oellermann and A.J. Schwenk, eds, Graph Theory, Combinatorics, and Applications (Wiley, New York, 1991) 493-524.
2. R. Isaacs, Infinite families of non-trivial trivalent graphs which are not Tait colorable, Amer. Math. Monthly 82 (1975) 221-239.
3. M. Kochol, Construction of cyclically 6-edge-connected snarks, Technical Report TR-II-SAS-07/93-5, Slovak Academy of Sciences, Bratislava, Slovakia, 1993.
4. M. Kochol, Snarks with large girths, Technical Report TR-II-SAS-10/93-11, Slovak Academy of Sciences, Bratislava, Slovakia, 1993.
5. M. Kochol, Snarks without small cycles, J. Combin. Theory Ser. B 67 (1996) 34-47.
6. V.G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz 3 (1964) 25-30.
7. J.J. Watkins and R.J. Wilson, A survey of snarks, in: Y. Alavi, G. Chartrand, O.R. Oellermann and A.J. Schwenk, eds, Graph Theory, Combinatorics, and Applications (Wiley, New York, 1991) 1129-1144.