[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.]Search in Google Scholar
[Fan, G. and Raspaud, A. (1994). Fulkerson’s conjecture and circuit covers, Journal of Combinatorial Theory, Series B61(1): 133-138.10.1006/jctb.1994.1039]Search in Google Scholar
[Fouquet, J.-L. and Vanherpe, J.-M. (2008). On Fan- Raspaud conjecture, CoRR-Computing Research Repository, abs/0809.4821.]Search in Google Scholar
[Goldberg, M.K. (1981). Construction of class 2 graphs with maximum vertex degree 3, Journal of Combinatorial Theory,Series B 31(3): 282-291.10.1016/0095-8956(81)90030-7]Search in Google Scholar
[Holyer, I. (1981). The NP-completeness of edge coloring, SIAM Journal on Computing 10(4): 718-720.10.1137/0210055]Search in Google Scholar
[Isaacs, R. (1975). Infinite families of nontrivial trivalent graphs which are not Tait colorable, American MathematicalMonthly 82(3): 221-239.10.1080/00029890.1975.11993805]Search in Google Scholar
[Kochol, M. (1996). Snarks without small cycles, Journal of Combinatorial Theory, Series B 67(1): 34-47.10.1006/jctb.1996.0032]Search in Google Scholar
[Greenlaw, R. P. (1995). Cubic graphs, ACM Computing Surveys 27(4): 471-495.10.1145/234782.234783]Search in Google Scholar
[Szekeres, G. (1973). Polyhedral decompositions of cubic graphs, Bulletin of the Australian Mathematical Society 8(3): 367- 387.10.1017/S0004972700042660]Search in Google Scholar
[Vizing, V. (1964). On an estimate of the chromatic class of a p-graph, Diskretnyj Analiz 3: 25-30.]Search in Google Scholar
[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.]Search in Google Scholar
[Watkins, J. (1989). Snarks, Annals of the New York Academy of Sciences 576: 606-622.10.1111/j.1749-6632.1989.tb16441.x]Search in Google Scholar