{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T07:28:47Z","timestamp":1769930927361,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,3,24]],"date-time":"2012-03-24T00:00:00Z","timestamp":1332547200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s00373-012-1145-3","type":"journal-article","created":{"date-parts":[[2012,3,23]],"date-time":"2012-03-23T18:51:24Z","timestamp":1332528684000},"page":"475-487","source":"Crossref","is-referenced-by-count":10,"title":["On Parsimonious Edge-Colouring of Graphs with Maximum Degree Three"],"prefix":"10.1007","volume":"29","author":[{"given":"J.-L.","family":"Fouquet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.-M.","family":"Vanherpe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,3,24]]},"reference":[{"key":"1145_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(94)00254-G","volume":"148","author":"M.O. Albertson","year":"1996","unstructured":"Albertson M.O., Haas R.: Parsimonious edge colouring. Discret. Math. 148, 1\u20137 (1996)","journal-title":"Discret. Math."},{"key":"1145_CR2","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1002\/jgt.3190100407","volume":"10","author":"J.A. Bondy","year":"1986","unstructured":"Bondy J.A., Locke S.: Largest bipartite subgraphs in triangle free graphs with maximum degree three. J. Graph Theory 10, 477\u2013504 (1986)","journal-title":"J. Graph Theory"},{"key":"1145_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0167-5060(08)70028-1","volume":"9","author":"J.-L. Fouquet","year":"1980","unstructured":"Fouquet J.-L.: Graphes cubiques d\u2019indice chromatique quatre. Ann. Discret. Math. 9, 23\u201328 (1980)","journal-title":"Ann. Discret. Math."},{"key":"1145_CR4","unstructured":"Fouquet, J.-L.: Contribution \u00e0 \u00e0 l\u2019 \u00e9tude des graphes cubiques et probl\u00e8mes hamiltoniens dans les graphes orient\u00e9s. Ph.D. thesis, Universit\u00e9 Paris SUD (1981)"},{"key":"1145_CR5","unstructured":"Fouquet, J.-L., Vanherpe, J.-M.: A new bound for parsimonious edge-colouring of graphs with maximum degree three (2011). http:\/\/hal.archives-ouvertes.fr\/hal-00516702\/PDF\/Parcimonious_15_17_Version_27_Feb_2011--.pdf"},{"key":"1145_CR6","unstructured":"Fouquet, J.-L., Vanherpe, J.-M.: Tools for parsimonious edge-colouring of graphs with maximum degree three (2012). http:\/\/hal.archives-ouvertes.fr\/hal-00502201\/PDF\/ToolsForParcimoniousColouring_Revision4_HAL.pdf"},{"key":"1145_CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.2307\/2319844","volume":"82","author":"R. Isaacs","year":"1975","unstructured":"Isaacs R.: Infinite families of non-trivial trivalent graphs which are not Tait colorable. Am. Math. Mon. 82, 221\u2013239 (1975)","journal-title":"Am. Math. Mon."},{"key":"1145_CR8","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D. K\u00f6nig","year":"1916","unstructured":"K\u00f6nig D.: \u00dcber Graphen und ihre Anwendung auf Determinantentheorie un Mengenlehre. Math. Ann. 77, 453\u2013465 (1916)","journal-title":"Math. Ann."},{"key":"1145_CR9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/jgt.3190060206","volume":"6","author":"S.C. Locke","year":"1982","unstructured":"Locke S.C.: Maximum k-colourable subgraphs. J. Graph Theory 6, 123\u2013132 (1982)","journal-title":"J. Graph Theory"},{"key":"1145_CR10","unstructured":"Payan, C.: Sur quelques probl\u00e8mes de couverture et de couplage en combinatoire. Th\u00e8se d\u2019\u00e9tat (1977)"},{"issue":"12","key":"1145_CR11","doi-asserted-by":"crossref","first-page":"4166","DOI":"10.1016\/j.disc.2008.11.017","volume":"309","author":"R. Rizzi","year":"2009","unstructured":"Rizzi R.: Approximating the maximum 3-edge-colorable subgraph problem. Discret. Math. 309(12), 4166\u20134170 (2009)","journal-title":"Discret. Math."},{"key":"1145_CR12","first-page":"103","volume":"10","author":"W. Staton","year":"1980","unstructured":"Staton W.: Edge deletions and the chromatic number. Ars Combin. 10, 103\u2013106 (1980)","journal-title":"Ars Combin."},{"key":"1145_CR13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0012-365X(97)00255-0","volume":"188","author":"E. Steffen","year":"1998","unstructured":"Steffen E.: Classifications and characterizations of snarks. Discret. Math. 188, 183\u2013203 (1998)","journal-title":"Discret. Math."},{"key":"1145_CR14","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.disc.2003.05.005","volume":"280","author":"E. Steffen","year":"2004","unstructured":"Steffen E.: Measurements of edge-uncolorability. Discret. Math. 280, 191\u2013214 (2004)","journal-title":"Discret. Math."},{"key":"1145_CR15","first-page":"25","volume":"3","author":"V.G. Vizing","year":"1964","unstructured":"Vizing V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz. 3, 25\u201330 (1964)","journal-title":"Diskret. Analiz."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1145-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1145-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1145-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:33Z","timestamp":1559055573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1145-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,24]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["1145"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1145-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,24]]}}}