{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:37:46Z","timestamp":1777520266864,"version":"3.51.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030489656","type":"print"},{"value":"9783030489663","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-48966-3_27","type":"book-chapter","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T13:04:23Z","timestamp":1590671063000},"page":"355-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Between Proper and Strong Edge-Colorings of Subcubic Graphs"],"prefix":"10.1007","author":[{"given":"Herv\u00e9","family":"Hocquard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitri","family":"Lajou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Borut","family":"Lu\u017ear","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(94)00254-G","volume":"148","author":"MO Albertson","year":"1996","unstructured":"Albertson, M.O., Haas, R.: Parsimonious edge coloring. Discret. Math. 148, 1\u20137 (1996)","journal-title":"Discret. Math."},{"issue":"1\u20132","key":"27_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N Alon","year":"1999","unstructured":"Alon, N.: Combinatorial Nullstellensatz. Comb. Probab. Comput. 8(1\u20132), 7\u201329 (1999)","journal-title":"Comb. Probab. Comput."},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0012-365X(92)90678-9","volume":"108","author":"LD Andersen","year":"1992","unstructured":"Andersen, L.D.: The strong chromatic index of a cubic graph is at most 10. Discret. Math. 108, 231\u2013252 (1992)","journal-title":"Discret. Math."},{"key":"27_CR4","unstructured":"Bonamy, M., Perrett, T., Postle, L.: Colouring graphs with sparse neighbourhoods: bounds and applications. ArXiv Preprint, https:\/\/arxiv.org\/abs\/1810.06704 (2018)"},{"key":"27_CR5","first-page":"205","volume":"29B","author":"RJ Faudree","year":"1990","unstructured":"Faudree, R.J., Gy\u00e1rf\u00e1s, A., Schelp, R.H., Tuza, Z.: The strong chromatic index of graphs. Ars Comb. 29B, 205\u2013211 (1990)","journal-title":"Ars Comb."},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s00373-012-1145-3","volume":"29","author":"J-L Fouquet","year":"2013","unstructured":"Fouquet, J.-L., Vanherpe, J.-M.: On parsimonious edge-colouring of graphs with maximum degree three. Graphs Comb. 29(3), 475\u2013487 (2013). https:\/\/doi.org\/10.1007\/s00373-012-1145-3","journal-title":"Graphs Comb."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.dam.2018.12.035","volume":"259","author":"N Gastineau","year":"2019","unstructured":"Gastineau, N., Togni, O.: On S-packing edge-colorings of cubic graphs. Discret. Appl. Math. 259, 63\u201375 (2019)","journal-title":"Discret. Appl. Math."},{"key":"27_CR8","first-page":"33","volume":"86","author":"W Goddard","year":"2008","unstructured":"Goddard, W., Hedetniemi, S.M., Hedetniemi, S.T., Harris, J.M., Rall, D.F.: Broadcast chromatic numbers of graphs. Ars Comb. 86, 33\u201349 (2008)","journal-title":"Ars Comb."},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"795","DOI":"10.7151\/dmgt.1642","volume":"32","author":"W Goddard","year":"2012","unstructured":"Goddard, W., Xu, H.: The $$S$$-packing chromatic number of a graph. Discuss. Math. Graph Theory 32, 795\u2013806 (2012)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"1","key":"27_CR10","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. London Math. Soc. 10(1), 26\u201330 (1935)","journal-title":"J. London Math. Soc."},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/jgt.3190170204","volume":"17","author":"P Hor\u00e1k","year":"1993","unstructured":"Hor\u00e1k, P., Qing, H., Trotter, W.T.: Induced matchings in cubic graphs. J. Graph Theory 17(2), 151\u2013160 (1993)","journal-title":"J. Graph Theory"},{"issue":"1","key":"27_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1006\/jctb.1996.0032","volume":"67","author":"M Kochol","year":"1996","unstructured":"Kochol, M.: Snarks without small cycles. J. Comb. Theory Ser. B 67(1), 34\u201347 (1996)","journal-title":"J. Comb. Theory Ser. B"},{"key":"27_CR13","doi-asserted-by":"publisher","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 und mengenlehre. Math. Ann. 77, 453\u2013465 (1916). https:\/\/doi.org\/10.1007\/BF01456961","journal-title":"Math. Ann."},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.ejc.2015.07.002","volume":"51","author":"AV Kostochka","year":"2016","unstructured":"Kostochka, A.V., Li, X., Ruksasakchai, W., Santana, M., Wang, T., Yu, G.: Strong chromatic index of subcubic planar multigraphs. Eur. J. Comb. 51, 380\u2013397 (2016)","journal-title":"Eur. J. Comb."},{"key":"27_CR15","unstructured":"Lu\u017ear, B., Ma\u010dajov\u00e1, E., \u0160koviera, M., Sot\u00e1k, R.: On the conjecture about strong edge-coloring of subcubic graphs (2020, Manuscript)"},{"issue":"1\u20133","key":"27_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.disc.2005.02.003","volume":"292","author":"M Maydanskiy","year":"2005","unstructured":"Maydanskiy, M.: The incidence coloring conjecture for graphs of maximum degree 3. Discret. Math. 292(1\u20133), 131\u2013141 (2005)","journal-title":"Discret. Math."},{"key":"27_CR17","unstructured":"Payan, C.: Sur quelques probl\u00e8mes de couverture et de couplage en combinatoire. PhD thesis, Institut National Polytechnique de Grenoble - INPG, Universit\u00e9 Joseph-Fourier - Grenoble I (1977). (in French)"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/S0095-8956(81)80013-5","volume":"31","author":"PD Seymour","year":"1981","unstructured":"Seymour, P.D.: On Tutte\u2019s extension of the four-color problem. J. Comb. Theory Ser. B 31, 82\u201394 (1981)","journal-title":"J. Comb. Theory Ser. B"},{"key":"27_CR19","unstructured":"Sot\u00e1k, R.: Private communication"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(93)90590-P","volume":"120","author":"A Steger","year":"1993","unstructured":"Steger, A., Yu, M.-L.: On induced matchings. Discret. Math. 120, 291\u2013295 (1993)","journal-title":"Discret. Math."},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Tait, P.G.: On the colouring of maps. In: Proceedings of the Royal Society of Edinburgh Section A, vol. 10, no. 729, pp. 501\u2013503 (1880)","DOI":"10.1017\/S0370164600044229"},{"key":"27_CR22","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a $$p$$-graph. Metody Diskret. Analiz 3, 25\u201330 (1964)","journal-title":"Metody Diskret. Analiz"},{"key":"27_CR23","doi-asserted-by":"publisher","first-page":"6254","DOI":"10.1016\/j.disc.2007.11.051","volume":"308","author":"J Wu","year":"2008","unstructured":"Wu, J., Lin, W.: The strong chromatic index of a class of graphs. Discret. Math. 308, 6254\u20136261 (2008)","journal-title":"Discret. Math."},{"key":"27_CR24","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/S0893-9659(02)80015-5","volume":"15","author":"Z Zhang","year":"2002","unstructured":"Zhang, Z., Liu, L., Wang, J.: Adjacent strong edge coloring of graphs. App. Math. Lett. 15, 623\u2013626 (2002)","journal-title":"App. Math. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48966-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:17:12Z","timestamp":1710256632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48966-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030489656","9783030489663"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48966-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bordeaux","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2020.labri.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5,9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference had to be postponed due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}