References
- Celmins, U.A. and Swart, E. (1979). The constructions of snarks, Research Report CORR, No. 18, Department of Combinatorics and Optimization, University of Waterloo, Waterloo.
- Fan, G. and Raspaud, A. (1994). Fulkerson’s conjecture and circuit covers, Journal of Combinatorial Theory, Series B61(1): 133-138.
- Fouquet, J.-L. and Vanherpe, J.-M. (2008). On Fan- Raspaud conjecture, CoRR-Computing Research Repository, abs/0809.4821.
- Goldberg, M.K. (1981). Construction of class 2 graphs with maximum vertex degree 3, Journal of Combinatorial Theory,Series B 31(3): 282-291.
- Holyer, I. (1981). The NP-completeness of edge coloring, SIAM Journal on Computing 10(4): 718-720.
- Isaacs, R. (1975). Infinite families of nontrivial trivalent graphs which are not Tait colorable, American MathematicalMonthly 82(3): 221-239.
- Kochol, M. (1996). Snarks without small cycles, Journal of Combinatorial Theory, Series B 67(1): 34-47.
- Greenlaw, R. P. (1995). Cubic graphs, ACM Computing Surveys 27(4): 471-495.
- Szekeres, G. (1973). Polyhedral decompositions of cubic graphs, Bulletin of the Australian Mathematical Society 8(3): 367- 387.
- Vizing, V. (1964). On an estimate of the chromatic class of a p-graph, Diskretnyj Analiz 3: 25-30.
- Watkins, J. and Wilson, R. (1988). A survey of snarks, in Y. Alavi, G. Chartrand, O.R. Oellermann, and A.J. Schwenk (Eds.), Graph Theory, Combinatorics, and Applications, Wiley Interscience, New York, NY/Kalamazoo, MI.
- Watkins, J. (1989). Snarks, Annals of the New York Academy of Sciences 576: 606-622.