{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T08:56:39Z","timestamp":1775465799805,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0095-8956(03)00028-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T21:16:12Z","timestamp":1051132572000},"page":"29-43","source":"Crossref","is-referenced-by-count":19,"title":["Partitions of graphs with high minimum degree or connectivity"],"prefix":"10.1016","volume":"88","author":[{"given":"Daniela","family":"K\u00fchn","sequence":"first","affiliation":[]},{"given":"Deryk","family":"Osthus","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(03)00028-5_BIB1","series-title":"The Probabilistic Method","author":"Alon","year":"2000"},{"key":"10.1016\/S0095-8956(03)00028-5_BIB2","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s004939970002","article-title":"Exact bounds for judicious partitions of graphs","volume":"19","author":"Bollob\u00e1s","year":"1999","journal-title":"Combinatorica"},{"key":"10.1016\/S0095-8956(03)00028-5_BIB3","doi-asserted-by":"crossref","unstructured":"R. Diestel, Graph Theory, Graduate Texts in Mathematics, Vol. 173, Springer, Berlin, 1997.","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"10.1016\/S0095-8956(03)00028-5_BIB4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02579344","article-title":"Partition of graphs with condition on the connectivity and minimum degree","volume":"3","author":"Hajnal","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/S0095-8956(03)00028-5_BIB5","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1002\/1097-0118(200101)36:1<52::AID-JGT5>3.0.CO;2-N","article-title":"Induced paths in 5-connected graphs","volume":"36","author":"Kriesell","year":"2001","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0095-8956(03)00028-5_BIB6","unstructured":"D. K\u00fchn, D. Osthus, Induced subdivisions in Ks,s-free graphs of large average degree, Combinatorica, to appear."},{"key":"10.1016\/S0095-8956(03)00028-5_BIB7","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1112\/plms\/s3-20.1.144","article-title":"On the existence of certain configurations within graphs and the 1-skeletons of polytopes","volume":"20","author":"Larman","year":"1970","journal-title":"Proc. London Math. Soc"},{"key":"10.1016\/S0095-8956(03)00028-5_BIB8","first-page":"111","article-title":"Graph partitions","volume":"15","author":"Porter","year":"1994","journal-title":"J. Combin. Math. Combin. Comput"},{"key":"10.1016\/S0095-8956(03)00028-5_BIB9","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 constraints","volume":"23","author":"Stiebitz","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0095-8956(03)00028-5_BIB10","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1002\/jgt.3190050403","article-title":"Non-separating cycles in k-connected graphs","volume":"5","author":"Thomassen","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0095-8956(03)00028-5_BIB11","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/jgt.3190070204","article-title":"Graph decomposition with constraints on the connectivity and minimum degree","volume":"7","author":"Thomassen","year":"1983","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0095-8956(03)00028-5_BIB12","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/jgt.3190070215","article-title":"Graph decomposition with applications to subdivisions and path systems modulo k","volume":"7","author":"Thomassen","year":"1983","journal-title":"J. Graph Theory"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000285?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000285?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T01:37:48Z","timestamp":1584495468000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895603000285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0095895603000285"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(03)00028-5","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}