{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,31]],"date-time":"2024-03-31T10:11:13Z","timestamp":1711879873743},"reference-count":11,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2010,9]]},"abstract":"<jats:p>Let D = (d<jats:sub>1<\/jats:sub>, d<jats:sub>2<\/jats:sub>, \u2026, d<jats:sub>n<\/jats:sub>) be a graphic sequence with 0 \u2264 d<jats:sub>1<\/jats:sub>\u2264 d<jats:sub>2<\/jats:sub>\u2264 \u22ef \u2264 d<jats:sub>n<\/jats:sub>. Any simple graph G with D its degree sequence is called a realization of D. Let R[D] denote the set of all realizations of D. We say that D is H-free if no graph in R[D] contains H as an induced subgraph. In this paper, we prove that Hadwiger's Conjecture is true for graphs whose degree sequences are claw-free or [Formula: see text]-free.<\/jats:p>","DOI":"10.1142\/s1793830910000759","type":"journal-article","created":{"date-parts":[[2010,10,12]],"date-time":"2010-10-12T08:44:00Z","timestamp":1286873040000},"page":"413-423","source":"Crossref","is-referenced-by-count":1,"title":["PARTIAL RESULT ON HADWIGER'S CONJECTURE"],"prefix":"10.1142","volume":"02","author":[{"given":"ZI-XIA","family":"SONG","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Central Florida, Orlando, FL 32816, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","volume":"21","author":"Appel K.","journal-title":"Illinois J. Math."},{"key":"rf2","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1215\/ijm\/1256049012","volume":"21","author":"Appel K.","journal-title":"Illinois J. Math."},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2007.04.003"},{"key":"rf4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1002\/jgt.20425","volume":"63","author":"Chudnovsky M.","journal-title":"J. Graph Theory"},{"key":"rf6","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","volume":"173","author":"Diestel R.","year":"1997"},{"key":"rf7","first-page":"85","volume":"27","author":"Dirac G. A.","journal-title":"J. London Math. Soc."},{"key":"rf8","first-page":"133","volume":"88","author":"Hadwiger H.","journal-title":"Vierteljahrsschr. Naturforsch, Ges. Z\u00fcrich"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1997.1750"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202354"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100061521"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01594196"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830910000759","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,31]],"date-time":"2024-03-31T09:39:18Z","timestamp":1711877958000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830910000759"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":11,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2010,9]]}},"alternative-id":["10.1142\/S1793830910000759"],"URL":"https:\/\/doi.org\/10.1142\/s1793830910000759","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}