{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:01Z","timestamp":1760245021717},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s1571-0653(04)00215-x","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T09:34:04Z","timestamp":1113039244000},"page":"22-25","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum"],"prefix":"10.1016","volume":"7","author":[{"given":"Simone","family":"Dantas","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Gravier","sequence":"additional","affiliation":[]},{"given":"Frederic","family":"Maffray","sequence":"additional","affiliation":[]},{"given":"Bojan","family":"Mohar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00215-X_BIB1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0012-365X(93)90477-B","article-title":"Zs. Tuza. Graphs with no induced C4 and 2K2","volume":"115","author":"Bl\u00e9zsik","year":"1993","journal-title":"Disc. Math."},{"key":"10.1016\/S1571-0653(04)00215-X_BIB2","first-page":"125","article-title":"Choosability in graphs","volume":"26","author":"Erdos","year":"1979","journal-title":"Proc. West Coast Conference, on Combinatorics, Graph Theory and Computing, Arcata, California, Congressus Numerantium"},{"key":"10.1016\/S1571-0653(04)00215-X_BIB3","first-page":"99","article-title":"On the chromatic number of a graph and its complements. Theory of Graphs","author":"Finck","year":"1966","journal-title":"Proc. Colloquium held at Tihany, Hungary"},{"key":"10.1016\/S1571-0653(04)00215-X_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S1571-0653(04)00215-X_BIB5","series-title":"Coloration et produits de graphes. These de doctorat","author":"Gravier","year":"1996"},{"key":"10.1016\/S1571-0653(04)00215-X_BIB6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/(SICI)1097-0118(199802)27:2<87::AID-JGT4>3.0.CO;2-B","article-title":"Graphs whose choice number is equal to their chromatic number","volume":"27","author":"Gravier","year":"1998","journal-title":"Journal of Graph Theory"},{"key":"10.1016\/S1571-0653(04)00215-X_BIB7","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0166-218X(94)00022-0","article-title":"Linear Recognition of Pseudo-Split Graphs","volume":"52","author":"Maffray","year":"1994","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/S1571-0653(04)00215-X_BIB8","series-title":"3-Choosable complete bipartite graphs. RUTCOR Research Report 49-91","author":"Mahadev","year":"1991"},{"key":"10.1016\/S1571-0653(04)00215-X_BIB9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","article-title":"On complementary graphs","volume":"63","author":"Nordhaus","year":"1956","journal-title":"Ann. Math. Monthly"},{"key":"10.1016\/S1571-0653(04)00215-X_BIB10","article-title":"On chromatic-choosable graphs","author":"Ohba","year":"2000","journal-title":"Manuscript"},{"issue":"2","key":"10.1016\/S1571-0653(04)00215-X_BIB11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.7151\/dmgt.1049","article-title":"Graph colorings with local constraints - A survey","volume":"17","author":"Tuza","year":"1997","journal-title":"Discussiones Mathematical"},{"key":"10.1016\/S1571-0653(04)00215-X_BIB12","first-page":"3","article-title":"Vertex colourings with given colors","volume":"29","author":"Vizing","year":"1976","journal-title":"Methody Discret. Analiz"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106530400215X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106530400215X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T08:50:47Z","timestamp":1548579047000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106530400215X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":12,"alternative-id":["S157106530400215X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00215-x","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}