3057 2019 eng 269 275 7 257 article Elsevier BV 0 -- 2025-07-21 -- Discrete Applied Mathematics 0166-218X 10.1016/j.dam.2018.10.016 true {"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T01:54:22Z","timestamp":1748656462042,"version":"3.37.3"},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T00:00:00Z","timestamp":1680220800000},"content-version":"vor","delay-in-days":1491,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003193","name":"Ministerstvo \u0161kolstva, vedy, v\u00fdskumu a \u0161portu Slovenskej republiky","doi-asserted-by":"publisher","award":["57320575"],"id":[{"id":"10.13039\/501100003193","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001655","name":"Deutscher Akademischer Austauschdienst","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001655","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1016\/j.dam.2018.10.016","type":"journal-article","created":{"date-parts":[[2018,11,2]],"date-time":"2018-11-02T16:25:17Z","timestamp":1541175917000},"page":"269-275","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Partitions of multigraphs under minimum degree constraints"],"prefix":"10.1016","volume":"257","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4969-7115","authenticated-orcid":false,"given":"Thomas","family":"Schweser","sequence":"first","affiliation":[]},{"given":"Michael","family":"Stiebitz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2018.10.016_b1","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1002\/jgt.22124","article-title":"Decomposing weighted graphs","volume":"86","author":"Ban","year":"2017","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2018.10.016_b2","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1016\/j.dam.2006.10.005","article-title":"Efficient algorithms for decomposing graphs under degree constraints","volume":"155","author":"Bazgan","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2018.10.016_b3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0095-8956(77)90037-5","article-title":"On an upper bound of a graph\u2019s chromatic number, depending on the graph\u2019s degree and density","volume":"23","author":"Borodin","year":"1977","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2018.10.016_b4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/(SICI)1097-0118(200004)33:4<237::AID-JGT4>3.0.CO;2-A","article-title":"Decomposing graphs with girths at least five under degree constraints","volume":"33","author":"Diwan","year":"2000","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2018.10.016_b5","first-page":"201","article-title":"Classes of graphs that can be partitioned to satisfy all their vertices","volume":"29","author":"Gerber","year":"2004","journal-title":"Australas. J. Combin."},{"key":"10.1016\/j.dam.2018.10.016_b6","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1002\/(SICI)1097-0118(199801)27:1<7::AID-JGT2>3.0.CO;2-U","article-title":"On decomposition of triangle-free graphs under degree constraints","volume":"27","author":"Kaneko","year":"1998","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2018.10.016_b7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.dam.2017.04.007","article-title":"On partitions of graphs under degree constraints","volume":"226","author":"Liu","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2018.10.016_b8","first-page":"237","article-title":"On decomposition of graphs","volume":"1","author":"Lov\u00e1sz","year":"1966","journal-title":"Studia Sci. Math. Hungar."},{"year":"2017","series-title":"Decomposing C4-free graphs under degree constraints","author":"Ma","key":"10.1016\/j.dam.2018.10.016_b9"},{"key":"10.1016\/j.dam.2018.10.016_b10","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1002\/(SICI)1097-0118(199611)23:3<321::AID-JGT12>3.0.CO;2-H","article-title":"Decomposing graphs under degree constrains","volume":"23","author":"Stiebitz","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2018.10.016_b11","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/jgt.3190070204","article-title":"Graph decompositions with constraints on the connectivity and minimum degree","volume":"7","author":"Thomassen","year":"1983","journal-title":"J. Graph Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X18305493?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X18305493?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T23:35:31Z","timestamp":1712360131000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X18305493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":11,"alternative-id":["S0166218X18305493"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2018.10.016","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2019,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Partitions of multigraphs under minimum degree constraints","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2018.10.016","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V.","name":"copyright","label":"Copyright"}]}} journal-article https://www.elsevier.com/tdm/userlicense/1.0/ crossref PersonAuthorFirstName_1,PersonAuthorLastName_1,PersonAuthorIdentifierOrcid_1,PersonAuthorFirstName_2,PersonAuthorLastName_2,PublisherName,TitleMain_1,Language,TitleParent_1,PageNumber,PageFirst,PageLast,Volume,CompletedYear,IdentifierIssn,Enrichmentlocal_crossrefLicence doi-import false false 2 Thomas Schweser Michael Stiebitz