{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:26:10Z","timestamp":1759335970853},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,5,7]],"date-time":"2015-05-07T00:00:00Z","timestamp":1430956800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s11786-015-0227-z","type":"journal-article","created":{"date-parts":[[2015,5,6]],"date-time":"2015-05-06T11:38:54Z","timestamp":1430912334000},"page":"209-220","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Berge\u2013Fulkerson Conjecture on Certain Snarks"],"prefix":"10.1007","volume":"9","author":[{"given":"Paul","family":"Manuel","sequence":"first","affiliation":[]},{"given":"A. S.","family":"Shanthi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,7]]},"reference":[{"key":"227_CR1","doi-asserted-by":"crossref","unstructured":"Bonisoli, A., Cariolaro, D.: Excessive factorizations of regular graphs. In: Bondy, A., et\u00a0al. (eds.) Graph Theory in Paris, pp. 73\u201384. Birkhauser, Basel (2007)","DOI":"10.1007\/978-3-7643-7400-6_7"},{"issue":"4","key":"227_CR2","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/j.jctb.2013.05.001","volume":"103","author":"G. Brinkmann","year":"2013","unstructured":"Brinkmann G., Goedgebeur J., Hagglund J., Markstrom K.: Generation and properties of snarks. J. Comb. Theory Ser. B. 103(4), 468\u2013488 (2013)","journal-title":"J. Comb. Theory Ser. B."},{"key":"227_CR3","first-page":"292","volume":"50","author":"G. Brinkmann","year":"1998","unstructured":"Brinkmann G., Steffen E.: Snarks and reducibility. Ars Combin. 50, 292\u2013296 (1998)","journal-title":"Ars Combin."},{"issue":"3","key":"227_CR4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1002\/jgt.20303","volume":"58","author":"D. Cariolaro","year":"2008","unstructured":"Cariolaro D., Fu H.L.: On minimum sets of 1-factors covering a complete multipartite graph. J. Graph Theory 58(3), 239\u2013250 (2008)","journal-title":"J. Graph Theory"},{"key":"227_CR5","doi-asserted-by":"crossref","unstructured":"Cariolaro, D., Fu, H.L.: The excessive 3-index of all graphs. Electron. J. Combin. 16(1), Research Paper 124 (2009)","DOI":"10.37236\/213"},{"issue":"2","key":"227_CR6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/(SICI)1097-0118(199806)28:2<57::AID-JGT1>3.0.CO;2-D","volume":"28","author":"A. Cavicchioli","year":"1998","unstructured":"Cavicchioli A., Meschiari M., Ruini B., Spaggiari F.: A survey on snarks and new results: products, reducibility and a computer search. J. Graph Theory 28(2), 57\u201386 (1998)","journal-title":"J. Graph Theory"},{"key":"227_CR7","first-page":"215","volume-title":"Snarks and supersnarks. In: The Theory and Applications of Graphs","author":"A.G. Chetwynd","year":"1981","unstructured":"Chetwynd A.G., Wilson R.J.: Snarks and supersnarks. In: The Theory and Applications of Graphs, pp. 215\u2013241. Wiley-Interscience, New York (1981)"},{"key":"227_CR8","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1006\/jctb.1994.1039","volume":"61","author":"G. Fan","year":"1994","unstructured":"Fan G., Raspaud A.: Fulkerson\u2019s conjecture and circuit covers. J. Combin. Theory Ser. B 61, 133\u2013138 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"227_CR9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.7151\/dmgt.1543","volume":"31","author":"J.L. Fouquet","year":"2011","unstructured":"Fouquet J.L., Vanherpe J.M.: On Fulkerson conjecture. Discuss. Math. Graph Theory 31(2), 253\u2013272 (2011)","journal-title":"Discuss. Math. Graph Theory"},{"key":"227_CR10","unstructured":"Fouquet, J.L., Vanherpe, J.M.: On the perfect matching index of bridgeless cubic graphs (2009). arXiv:0904.1296v1"},{"key":"227_CR11","unstructured":"Fiorini, S., Wilson, R.J.: Edge-colourings of graphs. Research Notes in Mathematics, vol. 16. Pitman, London (1977)"},{"key":"227_CR12","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"D.R. Fulkerson","year":"1971","unstructured":"Fulkerson D.R.: Blocking and antiblocking pairs of polyhedra. Math. Program 1, 168\u2013194 (1971)","journal-title":"Math. Program"},{"issue":"4","key":"227_CR13","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1038\/scientificamerican0476-126","volume":"234","author":"M. Gardner","year":"1976","unstructured":"Gardner M.: Mathematical Games: Snarks, Boojums and other conjectures related to the four color-map theorem. Sci. Am. 234(4), 126\u2013130 (1976)","journal-title":"Sci. Am."},{"key":"227_CR14","doi-asserted-by":"crossref","first-page":"4235","DOI":"10.1016\/j.disc.2008.12.024","volume":"309","author":"R. Hao","year":"2009","unstructured":"Hao R., Niu J., Wang X., Zhang C.Q., Zhang T.: A note on Berge\u2013Fulkerson coloring. Discrete Math. 309, 4235\u20134240 (2009)","journal-title":"Discrete Math."},{"key":"227_CR15","volume-title":"Loupekhine\u2019s Snarks: A Bifamily of Non-Tait-Colorable Graphs. Technical Report 263","author":"R. Issacs","year":"1976","unstructured":"Issacs R.: Loupekhine\u2019s Snarks: A Bifamily of Non-Tait-Colorable Graphs. Technical Report 263. Department of Mathematical Science, The Johns Hopkins University, Maryland (1976)"},{"issue":"37","key":"227_CR16","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.endm.2011.05.039","volume":"11","author":"A. Jimenez","year":"2011","unstructured":"Jimenez A., Kiwi M.: Counting perfect matchings of cubic graphs in the geometric dual. Proceedings LAGOS\u2019. Electronic Notes in Discrete Mathematics 11(37), 225\u2013230 (2011)","journal-title":"Proceedings LAGOS\u2019. Electronic Notes in Discrete Mathematics"},{"issue":"2","key":"227_CR17","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/jgt.20545","volume":"68","author":"G. Mazzuoccolo","year":"2011","unstructured":"Mazzuoccolo G.: The equivalence of two conjectures of Berge and Fulkerson. J. Graph Theory 68(2), 125\u2013128 (2011)","journal-title":"J. Graph Theory"},{"key":"227_CR18","doi-asserted-by":"crossref","unstructured":"Mazzuoccolo, G.: An upper bound for the excessive index of an r-graph. J. Graph Theory (2012). doi: 10.1002\/jgt.21682","DOI":"10.1002\/jgt.21682"},{"key":"227_CR19","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.disc.2010.09.016","volume":"311","author":"G. Mazzuoccolo","year":"2011","unstructured":"Mazzuoccolo G., Young M.: Graphs of arbitrary excessive class. Discrete Math. 311, 32\u201337 (2011)","journal-title":"Discrete Math."},{"key":"227_CR20","unstructured":"Mkrtchyan, V.V., Steffen, E.: Bricks and conjectures of Berge, Fulkerson and Seymour. In: Comput. Res. Repos. 1003(5), (2010)"},{"issue":"4","key":"227_CR21","first-page":"19","volume":"11","author":"S. Pirzada","year":"2007","unstructured":"Pirzada S., Dharwadker A.: Applications of Graph Theory. J. Korean Soc. Ind. Appl. Math. 11(4), 19\u201338 (2007)","journal-title":"J. Korean Soc. Ind. Appl. Math."},{"issue":"1","key":"227_CR22","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.endm.2011.05.009","volume":"37","author":"D. Sasaki","year":"2011","unstructured":"Sasaki D., Dantas S., de Figueiredo C.M.H.: On coloring problems of Snark families. Electron. Notes Discrete Math. 37(1), 45\u201350 (2011)","journal-title":"Electron. Notes Discrete Math."},{"key":"227_CR23","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1112\/plms\/s3-38.3.423","volume":"38","author":"P.D. Seymour","year":"1979","unstructured":"Seymour P.D.: On multi-colorings of cubic graphs, and conjectures of Fulkerson and Tutte. Proc. London Math. Soc. 38, 423\u2013460 (1979)","journal-title":"Proc. London Math. Soc."},{"key":"227_CR24","first-page":"728","volume":"10","author":"P.G. Tait","year":"1880","unstructured":"Tait P.G.: Remarks on the colouring of maps. Proc. R. Soc. Edinburgh 10, 728\u2013729 (1880)","journal-title":"Proc. R. Soc. Edinburgh"},{"key":"227_CR25","doi-asserted-by":"crossref","unstructured":"Watkins, J.J.: Snarks, Graph Theory and its Applications: East and West (Jinan, 1986), vol. 576. Ann. New york Acad. Sci. New York Acad. Sci. New York, pp. 606\u2013622 (1989)","DOI":"10.1111\/j.1749-6632.1989.tb16441.x"},{"key":"227_CR26","unstructured":"Watkins, J.J., Wilson, R.J.: A survey of snarks. In: Alavi, Y., Chartrand, G., Oellermann, O.R., Schwenk, A.J. (Eds.) Graph Theory, Combinatorics, and Applications (Kalamazoo, MI, 1988). Wiley Interscience, New York, pp. 1129\u20131144 (1991)"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-015-0227-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-015-0227-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-015-0227-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T21:45:53Z","timestamp":1598996753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-015-0227-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,7]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["227"],"URL":"https:\/\/doi.org\/10.1007\/s11786-015-0227-z","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,7]]}}}