{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T09:34:45Z","timestamp":1780392885857,"version":"3.54.1"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030750770","type":"print"},{"value":"9783030750787","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75078-7_24","type":"book-chapter","created":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T09:06:00Z","timestamp":1619773560000},"page":"232-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Algorithmic Aspects of the Maximum 2-edge-colorable Subgraph Problem"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Aloisio","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vahan","family":"Mkrtchyan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,5,1]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(94)00254-G","volume":"148","author":"M Albertson","year":"1996","unstructured":"Albertson, M., Haas, R.: Parsimonious edge colouring. Discrete Math. 148, 1\u20137 (1996)","journal-title":"Discrete Math."},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0012-365X(96)00368-8","volume":"177","author":"M Albertson","year":"1997","unstructured":"Albertson, M., Haas, R.: The edge chromatic difference sequence of a cubic graph. Discrete Math. 177, 1\u20138 (1997)","journal-title":"Discrete Math."},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.3390\/a13020031","volume":"13","author":"A Aloisio","year":"2020","unstructured":"Aloisio, A., Navarra, A.: Constrained connectivity in bounded X-width multi-interface networks. Algorithms 13(2), 31 (2020)","journal-title":"Algorithms"},{"issue":"8","key":"24_CR4","doi-asserted-by":"publisher","first-page":"3209","DOI":"10.1007\/s12652-019-01486-w","volume":"11","author":"A Aloisio","year":"2019","unstructured":"Aloisio, A., Navarra, A., Mostarda, L.: Energy consumption balancing in multi-interface networks. J. Ambient. Intell. Humaniz. Comput. 11(8), 3209\u20133219 (2019). ISSN 1868-5145","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"issue":"2","key":"24_CR5","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.disopt.2010.10.002","volume":"8","author":"A Aloisio","year":"2011","unstructured":"Aloisio, A., Arbib, C., Marinelli, F.: Cutting stock with no three parts per pattern: work-in-process and pattern minimization. Discrete Optim. 8(2), 315\u2013332 (2011)","journal-title":"Discrete Optim."},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/net.20422","volume":"57","author":"A Aloisio","year":"2011","unstructured":"Aloisio, A., Arbib, C., Marinelli, F.: On LP relaxations for the pattern minimization problem. Networks 57(3), 247\u2013253 (2011)","journal-title":"Networks"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Aloisio, A., Navarra, A.: Balancing energy consumption for the establishment of multi-interface networks. In: SOFSEM 2015: Theory and Practice of Computer Science, vol. 8939, pp. 102\u2013114. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-662-46078-8_9"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Aloisio, A.: Coverage, subject to a budget on multi-interface networks with bounded carving-width. In: WAINA, Advances in Intelligent Systems and Computing, vol. 1150, pp. 937\u2013946. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-44038-1_85"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"100259","DOI":"10.1016\/j.iot.2020.100259","volume":"11","author":"A Aloisio","year":"2020","unstructured":"Aloisio, A., Navarra, A.: Budgeted constrained coverage on bounded carving-width and series-parallel multi-interface networks. Internet Things 11, 100259 (2020)","journal-title":"Internet Things"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Aloisio, A., Budgeted constrained coverage on series-parallel multi-interface networks. In: AINA, Advances in Intelligent Systems and Computing, vol. 1151. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-44041-1_41"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Aloisio, A., Navarra, A., Mostarda, L.: Distributing energy consumption in multi-interface series-parallel networks. In: WAINA 2019, Advances in Intelligent Systems and Computing, vol. 927, pp. 734\u2013744. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-15035-8_71"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.dam.2014.03.001","volume":"172","author":"D Aslanyan","year":"2014","unstructured":"Aslanyan, D., Mkrtchyan, V., Petrosyan, S., Vardanyan, G.: On disjoint matchings in cubic graphs: maximum 2-edge-colourable and maximum 3-edge-colourable subgraphs. Discrete Appl. Math. 172, 12\u201327 (2014)","journal-title":"Discrete Appl. Math."},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"1888","DOI":"10.1016\/j.dam.2013.02.036","volume":"161","author":"R Belmonte","year":"2013","unstructured":"Belmonte, R., Hof, P., Kami\u0144ski, M., Paulusma, D., Thilikos, D.M.: Characterizing graphs of small carving-width. Discrete Appl. Math. 161, 1888\u20131893 (2013)","journal-title":"Discrete Appl. Math."},{"key":"24_CR14","first-page":"1305","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. IAM J. Comput. 25, 1305\u20131317 (1996)","journal-title":"IAM J. Comput."},{"issue":"4","key":"24_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0020-0190(95)00190-5","volume":"57","author":"K Cattell","year":"1996","unstructured":"Cattell, K., Dinneen, M.J., Fellows, M.R.: A simple linear-time algorithm for finding path-decompositions of small width. Inf. Process. Lett. 57(4), 197\u2013203 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"24_CR16","first-page":"57","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. Discrete Math. 28(2), 57\u201386 (1998)","journal-title":"Discrete Math."},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, pp. 3\u2013555. Springer, Cham (2015). ISBN 978-3-319-21274-6","DOI":"10.1007\/978-3-319-21275-3_1"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Feige, U., Ofek, E., Wieder, U.: Approximating maximum edge colouring in multigraphs. Lecture Notes in Computer Science, vol. 2462, pp. 108\u2013121 (2002)","DOI":"10.1007\/3-540-45753-4_11"},{"issue":"1","key":"24_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.37236\/1002","volume":"14","author":"AD Flaxman","year":"2007","unstructured":"Flaxman, A.D., Hoory, S.: Maximum matchings in regular graphs of high girth. Electron. J. Comb. 14(1), 1\u20134 (2007)","journal-title":"Electron. J. Comb."},{"key":"24_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Heidelberg (2010)"},{"issue":"3","key":"24_CR21","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s00373-012-1145-3","volume":"29","author":"JL 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)","journal-title":"Graphs Comb."},{"issue":"6","key":"24_CR22","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s00373-007-0757-5","volume":"23","author":"MA Henning","year":"2007","unstructured":"Henning, M.A., Yeo, A.: Tight lower bounds on the size of a maximum matching in a regular graph. Graphs Comb. 23(6), 647\u2013657 (2007)","journal-title":"Graphs Comb."},{"issue":"4","key":"24_CR23","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-colouring. SIAM J. Comput. 10(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"24_CR24","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.dam.2018.10.013","volume":"257","author":"L Karapetyan","year":"2019","unstructured":"Karapetyan, L., Mkrtchyan, V.: On maximum $$k$$-edge-colourable subgraphs of bipartite graphs. Disc. Appl. Math. 257, 226\u2013232 (2019)","journal-title":"Disc. Appl. Math."},{"issue":"3","key":"24_CR25","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.1137\/120899765","volume":"28","author":"MJ Kami\u0144ski","year":"2014","unstructured":"Kami\u0144ski, M.J., Kowalik, \u0141.: Beyond the Vizing\u2019s bound for at most seven colours. SIAM J. Discrete Math. 28(3), 1334\u20131362 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"24_CR26","doi-asserted-by":"publisher","first-page":"3593","DOI":"10.1016\/j.dam.2009.04.002","volume":"157","author":"A Kosowski","year":"2009","unstructured":"Kosowski, A.: Approximating the maximum 2- and 3-edge-colourable problems. Discrete Appl. Math. 157, 3593\u20133600 (2009)","journal-title":"Discrete Appl. Math."},{"key":"24_CR27","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1016\/j.disc.2010.02.007","volume":"310","author":"V Mkrtchyan","year":"2010","unstructured":"Mkrtchyan, V., Petrosyan, S., Vardanyan, G.: On disjoint matchings in cubic graphs. Discrete Math. 310, 1588\u20131613 (2010)","journal-title":"Discrete Math."},{"issue":"21","key":"24_CR28","doi-asserted-by":"publisher","first-page":"2381","DOI":"10.1016\/j.disc.2013.06.020","volume":"313","author":"V Mkrtchyan","year":"2013","unstructured":"Mkrtchyan, V., Petrosyan, S., Vardanyan, G.: Corrigendum to \u201cOn disjoint matchings in cubic graphs\u201d. Discrete Math. 313(21), 2381 (2013)","journal-title":"Discrete Math."},{"issue":"4","key":"24_CR29","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1002\/jgt.20629","volume":"70","author":"V Mkrtchyan","year":"2012","unstructured":"Mkrtchyan, V., Steffen, E.: Maximum $$\\Delta $$-edge-colourable subgraphs of class II graphs. J. Graph Theory 70(4), 473\u2013482 (2012)","journal-title":"J. Graph Theory"},{"key":"24_CR30","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0012-365X(81)90143-6","volume":"37","author":"T Nishizeki","year":"1981","unstructured":"Nishizeki, T.: On the maximum matchings of regular multigraphs. Discrete Math. 37, 105\u2013114 (1981)","journal-title":"Discrete Math."},{"key":"24_CR31","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1002\/sapm1949281148","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: A theorem on colouring the lines of a network. J. Math. Phys. 28, 148\u2013151 (1949)","journal-title":"J. Math. Phys."},{"key":"24_CR32","doi-asserted-by":"publisher","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. Discrete Math. 188, 183\u2013203 (1998)","journal-title":"Discrete Math."},{"key":"24_CR33","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.disc.2003.05.005","volume":"280","author":"E Steffen","year":"2004","unstructured":"Steffen, E.: Measurements of edge-uncolourability. Discrete Math. 280, 191\u2013214 (2004)","journal-title":"Discrete Math."},{"key":"24_CR34","volume-title":"Graph Edge Colouring","author":"M Stiebitz","year":"2012","unstructured":"Stiebitz, M., Scheide, D., Toft, B., Favrholdt, L.M.: Graph Edge Colouring. Wiley, Hoboken (2012)"},{"key":"24_CR35","doi-asserted-by":"crossref","unstructured":"Thilikos, D., Serna, M., Bodlaender, H.: Constructive linear time algorithms for small cutwidth and carving-width. In: Proceedings of the 11th International Conference on Algorithms and Computation (ISAAC), Taipei, Taiwan, 18\u201320 December 2000, pp. 192\u2013203 (2000)","DOI":"10.1007\/3-540-40996-3_17"},{"key":"24_CR36","first-page":"25","volume":"3","author":"V Vizing","year":"1964","unstructured":"Vizing, V.: On an estimate of the chromatic class of a $$p$$-graph. Diskret Analiz 3, 25\u201330 (1964)","journal-title":"Diskret Analiz"},{"key":"24_CR37","volume-title":"Introduction to Graph Theory","author":"D West","year":"1996","unstructured":"West, D.: Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (1996)"}],"container-title":["Lecture Notes in Networks and Systems","Advanced Information Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75078-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T11:17:00Z","timestamp":1623323820000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75078-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030750770","9783030750787"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75078-7_24","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"value":"2367-3370","type":"print"},{"value":"2367-3389","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AINA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Information Networking and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aina2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/voyager.ce.fit.ac.jp\/conf\/aina\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}