{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T14:48:35Z","timestamp":1768747715446,"version":"3.49.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5525,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0012-365x(97)00255-0","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"183-203","source":"Crossref","is-referenced-by-count":41,"title":["Classifications and characterizations of snarks"],"prefix":"10.1016","volume":"188","author":[{"given":"Eckhard","family":"Steffen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00255-0_BIB1","series-title":"Finite and Infinite Sets","first-page":"89","article-title":"Inductive classes of cubic graphs","author":"Batagelj","year":"1984"},{"issue":"1","key":"10.1016\/S0012-365X(97)00255-0_BIB2","first-page":"31","article-title":"Problem \u010deteriju boja","author":"Blanu\u0161a","year":"1946","journal-title":"Hrvatsko Prirodoslovno Dru\u0161tvo Glasnik Math.-Fiz. Astr. Ser. II"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB3","unstructured":"G. Brinkmann, E. Steffen, Snarks and reducibility, Ars Combin., to appear."},{"key":"10.1016\/S0012-365X(97)00255-0_BIB4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1002\/jgt.3190110104","article-title":"Decomposition of snarks","volume":"11","author":"Cameron","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB5","article-title":"The construction of snarks","author":"Celmins","year":"1979"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.2307\/3610702","article-title":"Network-Colourings","volume":"32","author":"Descartes","year":"1948","journal-title":"The Math. Gazette"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB7","series-title":"Graphs and Other Combinatorial Topics","first-page":"70","article-title":"Hypohamiltonian snarks","author":"Fiorini","year":"1983"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB8","article-title":"Edge-colourings of graphs","author":"Fiorini","year":"1977"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB9","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1038\/scientificamerican0476-126","article-title":"Mathematical games: Snarks, boojums and other conjectures related to the four-color-map theorem","volume":"234","author":"Gardner","year":"1976","journal-title":"Sci. Am."},{"key":"10.1016\/S0012-365X(97)00255-0_BIB10","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0095-8956(81)90030-7","article-title":"Construction of class 2 graphs with maximum vertex degree 3","volume":"31","author":"Goldberg","year":"1981","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511662058","article-title":"The Petersen graph","author":"Holton","year":"1993"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB12","unstructured":"A. Huck, On cycle-double-covers of some graphs, Manuscript."},{"key":"10.1016\/S0012-365X(97)00255-0_BIB13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jctb.1995.1029","article-title":"Five cycle double covers of some cubic graphs","volume":"64","author":"Huck","year":"1995","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.2307\/2319844","article-title":"Infinite families of non-trivial trivalent graphs which are not Tait colorable","volume":"82","author":"Isaacs","year":"1975","journal-title":"Am. Math. Monthly"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB15","first-page":"1","article-title":"A survey of the cycle double cover conjecture","volume":"27","author":"Jaeger","year":"1985","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(97)00255-0_BIB16","first-page":"70","article-title":"Nowhere-zero flow problems","volume":"3","author":"Jaeger","year":"1988"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB17","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0012-365X(90)90049-N","article-title":"Large Isaacs' graphs are maximally non-hamiltonian-connected","volume":"82","author":"Kalinowski","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00255-0_BIB18","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1006\/jctb.1996.0032","article-title":"Snarks without small cycles","volume":"67","author":"Kochol","year":"1996","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB19","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/(SICI)1097-0118(199607)22:3<253::AID-JGT6>3.0.CO;2-L","article-title":"Decompositions and reductions of snarks","volume":"22","author":"Nedela","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB20","series-title":"Graph Theory and related Topics","first-page":"341","article-title":"Sums of circuits","author":"Seymour","year":"1979"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB21","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1017\/S0004972700042660","article-title":"Polyhedral decompositions of cubic graphs","volume":"8","author":"Szekeres","year":"1973","journal-title":"Bull. Austral. Math. Soc."},{"key":"10.1016\/S0012-365X(97)00255-0_BIB22","series-title":"Graphs and Applications","first-page":"317","article-title":"A study of snark embeddings","author":"Tinsley","year":"1985"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB23","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/S0021-9800(69)80116-X","article-title":"A theorem on Tait colorings with an application to the generalized Petersen graphs","volume":"6","author":"Watkins","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(97)00255-0_BIB24","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1111\/j.1749-6632.1989.tb16441.x","article-title":"Snarks","volume":"576","author":"Watkins","year":"1989","journal-title":"Ann. New York Acad. Sci."},{"key":"10.1016\/S0012-365X(97)00255-0_BIB25","series-title":"Graph theory, Combinatorics and Applications","first-page":"1129","article-title":"A survey of snarks","author":"Watkins","year":"1991"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002550?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002550?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T05:20:52Z","timestamp":1556169652000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97002550"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":25,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0012365X97002550"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00255-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}