乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T17:31:23Z","timestamp":1719941483076},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,1,7]],"date-time":"2019-01-07T00:00:00Z","timestamp":1546819200000},"content-version":"vor","delay-in-days":1467,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF","award":["11171310"]},{"name":"ZJNSF","award":["Z6110786"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1016\/j.ejc.2014.08.032","type":"journal-article","created":{"date-parts":[[2014,9,29]],"date-time":"2014-09-29T17:31:00Z","timestamp":1412011860000},"page":"295-305","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Beyond Ohba\u2019s Conjecture: A bound on the choice number ofk<\/mml:mi><\/mml:math>-chromatic graphs withn<\/mml:mi><\/mml:math>vertices"],"prefix":"10.1016","volume":"43","author":[{"given":"Jonathan A.","family":"Noel","sequence":"first","affiliation":[]},{"given":"Douglas B.","family":"West","sequence":"additional","affiliation":[]},{"given":"Hehui","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2014.08.032_br000005","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1017\/S0963548300000122","article-title":"Choice numbers of graphs: a probabilistic approach","volume":"1","author":"Alon","year":"1992","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.ejc.2014.08.032_br000010","series-title":"Surveys in Combinatorics, 1993 (Keele)","first-page":"1","article-title":"Restricted colorings of graphs","volume":"vol. 187","author":"Alon","year":"1993"},{"key":"10.1016\/j.ejc.2014.08.032_br000015","series-title":"Extremal problems on variations of graph colorings","author":"Choi","year":"2014"},{"key":"10.1016\/j.ejc.2014.08.032_br000020","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1137\/12088015X","article-title":"Coloring claw-free graphs with \u0394\u22121 colors","volume":"27","author":"Cranston","year":"2013","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.ejc.2014.08.032_br000025","unstructured":"D. Cranston, L. Rabern, Graphs with \u03c7=\u0394 have big cliques (2013) submitted for publication, available as http:\/\/arxiv.org\/pdf\/1305.3526.pdf."},{"key":"10.1016\/j.ejc.2014.08.032_br000030","doi-asserted-by":"crossref","unstructured":"H. Enomoto, K. Ohba, K. Ota, J. Sakamoto, Choice number of some complete multi-partite graphs, Proc. Algebraic and Topological Methods in Graph Theory, Lake Bled, 1999, Discrete Math. 244 (2002), 55\u201366.","DOI":"10.1016\/S0012-365X(01)00059-0"},{"key":"10.1016\/j.ejc.2014.08.032_br000035","unstructured":"P. Erd\u0151s, A.L. Rubin, H. Taylor, Choosability in graphs, Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Humboldt State Univ., Arcata, Calif., 1979, Congr. Numer. 26 (1980), 125\u2013157."},{"key":"10.1016\/j.ejc.2014.08.032_br000040","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/jgt.20137","article-title":"On the asymptotic value of the choice number of complete multi-partite graphs","volume":"52","author":"Gazit","year":"2006","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2014.08.032_br000045","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1090\/S0002-9904-1948-09098-X","article-title":"Distinct representatives of subsets","volume":"54","author":"Hall","year":"1948","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/j.ejc.2014.08.032_br000050","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0012-365X(99)00157-0","article-title":"On the choosability of complete multipartite graphs with part size three","volume":"211","author":"Kierstead","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2014.08.032_br000055","unstructured":"H.A. Kierstead, A. Salmon, R. Wang, On the choice number of complete multipartite graphs with part size four (2014) submitted for publication, available as arXiv:1407.3817."},{"key":"10.1016\/j.ejc.2014.08.032_br000060","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1016\/j.disc.2011.02.026","article-title":"Ohba\u2019s Conjecture for graphs with independence number five","volume":"311","author":"Kostochka","year":"2011","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2014.08.032_br000065","series-title":"Contemporary Trends in Discrete Mathematics (\u0160ti\u0159\u00ed~Castle, 1997)","first-page":"183","article-title":"New trends in the theory of graph colorings: choosability and list coloring","volume":"vol. 49","author":"Kratochv\u00edl","year":"1999"},{"key":"10.1016\/j.ejc.2014.08.032_br000070","series-title":"Choosibility of graphs with bounded order: Ohba\u2019s Conjecture and beyond","author":"Noel","year":"2013"},{"key":"10.1016\/j.ejc.2014.08.032_br000075","article-title":"A proof of a conjecture of Ohba","author":"Noel","year":"2014","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2014.08.032_br000080","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1002\/jgt.10033","article-title":"On chromatic-choosable graphs","volume":"40","author":"Ohba","year":"2002","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2014.08.032_br000085","first-page":"133","article-title":"Choice number of complete multipartite graphs with part size at most three","volume":"72","author":"Ohba","year":"2004","journal-title":"Ars Combin."},{"key":"10.1016\/j.ejc.2014.08.032_br000090","unstructured":"L. Rabern, Coloring graphs with dense neighborhoods (2012) submitted for publication, available as http:\/\/arxiv.org\/pdf\/1209.3646.pdf."},{"key":"10.1016\/j.ejc.2014.08.032_br000095","series-title":"List colouring of graphs with at most (2\u2212o(1))\u03c7 vertices","first-page":"587","volume":"vol. III","author":"Reed","year":"2002"},{"key":"10.1016\/j.ejc.2014.08.032_br000100","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00493-005-0010-x","article-title":"List colouring when the chromatic number is close to the order of the graph","volume":"25","author":"Reed","year":"2005","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2014.08.032_br000105","doi-asserted-by":"crossref","first-page":"938","DOI":"10.1016\/j.aml.2009.01.001","article-title":"Ohba\u2019s Conjecture is true for graphs with independence number at most three","volume":"22","author":"Shen","year":"2009","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/j.ejc.2014.08.032_br000110","doi-asserted-by":"crossref","first-page":"161","DOI":"10.7151\/dmgt.1049","article-title":"Graph colorings with local constraints\u2014a survey","volume":"17","author":"Tuza","year":"1997","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.ejc.2014.08.032_br000115","first-page":"3","article-title":"Coloring the vertices of a graph in prescribed colors","volume":"29","author":"Vizing","year":"1976","journal-title":"Metody Diskret. Analiz. v Teorii Kodov i Shem"},{"key":"10.1016\/j.ejc.2014.08.032_br000120","series-title":"Surveys in combinatorics, 2001 (Sussex)","first-page":"269","article-title":"List colourings of graphs","volume":"vol. 288","author":"Woodall","year":"2001"},{"key":"10.1016\/j.ejc.2014.08.032_br000125","series-title":"Extension of the game coloring number and some results on the choosability of complete multipartite graphs","author":"Yang","year":"2003"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669814001449?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669814001449?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T11:46:08Z","timestamp":1565869568000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669814001449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":25,"alternative-id":["S0195669814001449"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2014.08.032","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2015,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Beyond Ohba\u2019s Conjecture: A bound on the choice number of -chromatic graphs with vertices","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2014.08.032","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}