乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:05:43Z","timestamp":1720051543104},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1016\/j.dam.2021.09.021","type":"journal-article","created":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T10:52:02Z","timestamp":1634899922000},"page":"120-132","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Flexibility of planar graphs\u2014Sharpening the tools to get lists of size four"],"prefix":"10.1016","volume":"306","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-1102-7922","authenticated-orcid":false,"given":"Ilkyoo","family":"Choi","sequence":"first","affiliation":[]},{"given":"Felix Christian","family":"Clemen","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Ferrara","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Horn","sequence":"additional","affiliation":[]},{"given":"Fuhong","family":"Ma","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-8524-4036","authenticated-orcid":false,"given":"Tom\u00e1\u0161","family":"Masa\u0159\u00edk","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2021.09.021_b1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1006\/jctb.1998.1827","article-title":"You can\u2019t paint yourself into a corner","volume":"73","author":"Albertson","year":"1998","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2021.09.021_b2","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1016\/j.ejc.2003.06.005","article-title":"Extending precolorings of subgraphs of locally planar graphs","volume":"25","author":"Albertson","year":"2004","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2021.09.021_b3","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1137\/S0895480103425942","article-title":"Precoloring extensions of Brooks\u2019 theorem","volume":"18","author":"Albertson","year":"2004","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2021.09.021_b4","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1016\/j.jctb.2005.09.010","article-title":"Extending precolorings to circular colorings","volume":"96","author":"Albertson","year":"2006","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2021.09.021_b5","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1016\/j.disc.2011.03.007","article-title":"List precoloring extension in planar graphs","volume":"311","author":"Axenovich","year":"2011","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2021.09.021_b6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0012-365X(92)90646-W","article-title":"Precoloring extension. I. Interval graphs","volume":"100","author":"B\u00edr\u00f3","year":"1992","journal-title":"Discrete Math"},{"key":"10.1016\/j.dam.2021.09.021_b7","series-title":"31st International Symposium on Algorithms and Computation","first-page":"31:1","article-title":"Flexible list colorings in graphs with special degeneracy conditions","volume":"vol. 181","author":"Bradshaw","year":"2020"},{"key":"10.1016\/j.dam.2021.09.021_b8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.disc.2011.02.008","article-title":"Extending precolourings of circular cliques","volume":"312","author":"Brewster","year":"2012","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2021.09.021_b9","first-page":"3","article-title":"Issues in multiagent resource allocation","volume":"30","author":"Chevaleyre","year":"2006","journal-title":"Informatica (Slovenia)"},{"key":"10.1016\/j.dam.2021.09.021_b10","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/j.jctb.2016.07.006","article-title":"Steinberg\u2019s conjecture is false","volume":"122","author":"Cohen-Addad","year":"2017","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"10.1016\/j.dam.2021.09.021_b11","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1016\/j.disc.2016.11.022","article-title":"An introduction to the discharging method via graph coloring","volume":"340","author":"Cranston","year":"2017","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.dam.2021.09.021_b12","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1002\/jgt.22567","article-title":"Flexibility of planar graphs of girth at least six","volume":"95","author":"Dvo\u0159\u00e1k","year":"2020","journal-title":"J. Graph Theory"},{"issue":"4","key":"10.1016\/j.dam.2021.09.021_b13","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1002\/jgt.22634","article-title":"Flexibility of triangle-free planar graphs","volume":"96","author":"Dvo\u0159\u00e1k","year":"2021","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.dam.2021.09.021_b14","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/jgt.22447","article-title":"List coloring with requests","volume":"92","author":"Dvo\u0159\u00e1k","year":"2019","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.dam.2021.09.021_b15","first-page":"1","article-title":"Do triangle-free planar graphs have exponentially many 3-colorings? Electron","volume":"23","author":"Dvo\u0159\u00e1k","year":"2017","journal-title":"J. Combin."},{"key":"10.1016\/j.dam.2021.09.021_b16","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.ejc.2018.03.008","article-title":"Extending precolorings to distinguish group actions","volume":"72","author":"Ferrara","year":"2018","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2021.09.021_b17","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1111\/j.0824-7935.2004.00238.x","article-title":"Multi-agent constraint systems with preferences: Efficiency, solution quality, and privacy loss","volume":"20","author":"Franzin","year":"2004","journal-title":"Comput. Intell."},{"issue":"2\u20133","key":"10.1016\/j.dam.2021.09.021_b18","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.disc.2004.10.015","article-title":"Smaller planar triangle-free graphs that are not 3-list-colorable","volume":"290","author":"Glebov","year":"2005","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2021.09.021_b19","first-page":"1","article-title":"Precoloring extension. II. Graphs classes related to bipartite graphs","volume":"62","author":"Hujter","year":"1993","journal-title":"Acta. Math. Univ. Comenian. (N.S.)"},{"key":"10.1016\/j.dam.2021.09.021_b20","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1017\/S0963548300001826","article-title":"Precoloring extension. III. Classes of perfect graphs","volume":"5","author":"Hujter","year":"1996","journal-title":"Combin. Probab. Comput."},{"issue":"5","key":"10.1016\/j.dam.2021.09.021_b21","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/543552.512535","article-title":"Preference-directed graph coloring","volume":"37","author":"Koseki","year":"2002","journal-title":"ACM SIGPLAN Not."},{"issue":"1","key":"10.1016\/j.dam.2021.09.021_b22","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1006\/jctb.1998.1893","article-title":"The 4-choosability of plane graphs without 4-cycles","volume":"76","author":"Lam","year":"1999","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2021.09.021_b23","series-title":"On weak flexibility in planar graphs","author":"Lidick\u00fd","year":"2020"},{"issue":"3","key":"10.1016\/j.dam.2021.09.021_b24","first-page":"935","article-title":"Flexibility of planar graphs without 4-cycles","volume":"88","author":"Masa\u0159\u00edk","year":"2019","journal-title":"Acta Math. Univ. Comenian. (N.S.)"},{"key":"10.1016\/j.dam.2021.09.021_b25","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1002\/jgt.20358","article-title":"Precoloring extension for K4-minor-free graphs","volume":"60","author":"Pruchnewski","year":"2009","journal-title":"J. Graph Theory"},{"issue":"08","key":"10.1016\/j.dam.2021.09.021_b26","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0167-5060(08)70391-1","article-title":"The state of the three color problem. In Quo Vadis, graph theory?","volume":"55","author":"Steinberg","year":"1993","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2021.09.021_b27","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1006\/jctb.1994.1062","article-title":"Every planar graph is 5-choosable","volume":"62","author":"Thomassen","year":"1994","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/j.dam.2021.09.021_b28","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1006\/jctb.1995.1027","article-title":"3-list-coloring planar graphs of girth 5","volume":"64","author":"Thomassen","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2021.09.021_b29","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"},{"issue":"1\u20133","key":"10.1016\/j.dam.2021.09.021_b30","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(93)90579-I","article-title":"List colourings of planar graphs","volume":"120","author":"Voigt","year":"1993","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"10.1016\/j.dam.2021.09.021_b31","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0012-365X(94)00180-9","article-title":"A not 3-choosable planar graph without 3-cycles","volume":"146","author":"Voigt","year":"1995","journal-title":"Discrete Math."},{"issue":"7\u20138","key":"10.1016\/j.dam.2021.09.021_b32","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1016\/j.disc.2005.11.041","article-title":"A non-3-choosable planar graph without cycles of length 4 and 5","volume":"307","author":"Voigt","year":"2007","journal-title":"Discrete Math."},{"issue":"5","key":"10.1016\/j.dam.2021.09.021_b33","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/S0893-9659(02)80007-6","article-title":"Choosability and edge choosability of planar graphs without five cycles","volume":"15","author":"Wang","year":"2002","journal-title":"Appl. Math. Lett."},{"issue":"4","key":"10.1016\/j.dam.2021.09.021_b34","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1137\/S0895480100376253","article-title":"Choosability and edge choosability of planar graphs without intersecting triangles","volume":"15","author":"Wang","year":"2002","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2021.09.021_b35","series-title":"Flexibility of Planar Graphs Without C4 and C5","author":"Yang","year":"2020"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X21003991?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X21003991?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T15:26:36Z","timestamp":1635953196000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X21003991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":35,"alternative-id":["S0166218X21003991"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2021.09.021","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2022,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Flexibility of planar graphs\u2014Sharpening the tools to get lists of size four","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2021.09.021","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}