乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T04:17:31Z","timestamp":1740111451720,"version":"3.37.3"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,1,30]],"date-time":"2022-01-30T00:00:00Z","timestamp":1643500800000},"content-version":"vor","delay-in-days":1490,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS 08-38434"],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1016\/j.dam.2017.09.013","type":"journal-article","created":{"date-parts":[[2017,11,10]],"date-time":"2017-11-10T08:45:37Z","timestamp":1510303537000},"page":"129-141","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"special_numbering":"C","title":["Dynamic coloring parameters for graphs with given genus"],"prefix":"10.1016","volume":"235","author":[{"given":"Sarah","family":"Loeb","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Mahoney","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Reiniger","sequence":"additional","affiliation":[]},{"given":"Jennifer","family":"Wise","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"14","key":"10.1016\/j.dam.2017.09.013_b1","doi-asserted-by":"crossref","first-page":"3005","DOI":"10.1016\/j.dam.2009.05.002","article-title":"On the list dynamic coloring of graphs","volume":"157","author":"Akbari","year":"2009","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2017.09.013_b2","first-page":"180","article-title":"On the total coloring of planar graphs","volume":"394","author":"Borodin","year":"1989","journal-title":"J. Reine Angew. Math."},{"issue":"7\u20138","key":"10.1016\/j.dam.2017.09.013_b3","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1016\/j.dam.2012.01.012","article-title":"On dynamic coloring for planar graphs and graphs of higher genus","volume":"160","author":"Chen","year":"2012","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2017.09.013_b4","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/jgt.20273","article-title":"List-coloring the square of a subcubic graph","volume":"57","author":"Cranston","year":"2008","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2017.09.013_b5","series-title":"Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, Calif., 1979)","first-page":"125","article-title":"Choosability in graphs","volume":"vol. XXVI","author":"Erd\u0151s","year":"1980"},{"key":"10.1016\/j.dam.2017.09.013_b6","first-page":"332","article-title":"Map colour theorem","volume":"24","author":"Heawood","year":"1890","journal-title":"Q. J. Math."},{"issue":"1\u20133","key":"10.1016\/j.dam.2017.09.013_b7","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0012-365X(93)90166-Q","article-title":"Largest planar graphs of diameter two and fixed maximum degree","volume":"111","author":"Hell","year":"1993","journal-title":"Discrete Math."},{"issue":"23","key":"10.1016\/j.dam.2017.09.013_b8","doi-asserted-by":"crossref","first-page":"3426","DOI":"10.1016\/j.disc.2010.07.019","article-title":"Brooks\u2019 theorem via the Alon-Tarsi theorem","volume":"310","author":"Hladk\u00fd","year":"2010","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2017.09.013_b9","series-title":"Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity (Prachatice, 1990)","first-page":"113","article-title":"The weight of a graph","volume":"vol. 51","author":"Ivan\u010do","year":"1992"},{"key":"10.1016\/j.dam.2017.09.013_b10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.dam.2016.01.016","article-title":"On r-dynamic coloring of graphs","volume":"206","author":"Jahanbekam","year":"2016","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2017.09.013_b11","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.dam.2015.01.020","article-title":"On r-dynamic coloring of grids","volume":"186","author":"Kang","year":"2015","journal-title":"Discrete Appl. Math."},{"issue":"13\u201314","key":"10.1016\/j.dam.2017.09.013_b12","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.1016\/j.dam.2013.03.005","article-title":"Dynamic coloring and list dynamic coloring of planar graphs","volume":"161","author":"Kim","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2017.09.013_b13","series-title":"Combinatorial Optimization and Applications","first-page":"156","article-title":"List dynamic coloring of sparse graphs","volume":"vol. 6831","author":"Kim","year":"2011"},{"issue":"2\u20133","key":"10.1016\/j.dam.2017.09.013_b14","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/j.disc.2006.11.059","article-title":"A survey on the distance-colouring of graphs","volume":"308","author":"Kramer","year":"2008","journal-title":"Discrete Math."},{"year":"2015","author":"Mahoney","series-title":"Online Choosability of Graphs","key":"10.1016\/j.dam.2017.09.013_b15"},{"key":"10.1016\/j.dam.2017.09.013_b16","series-title":"Dynamic Coloring of Graphs","first-page":"52","author":"Montgomery","year":"2001"},{"issue":"1","key":"10.1016\/j.dam.2017.09.013_b17","doi-asserted-by":"crossref","DOI":"10.37236\/166","article-title":"Mr. paint and Mrs. correct","volume":"16","author":"Schauz","year":"2009","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2017.09.013_b18","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.disc.2013.10.001","article-title":"On r-hued coloring of K4-minor free graphs","volume":"315","author":"Song","year":"2014","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2017.09.013_b19","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":"29","key":"10.1016\/j.dam.2017.09.013_b20","article-title":"Coloring the vertices of a graph in prescribed colors","author":"Vizing","year":"1976","journal-title":"Diskret. Anal."},{"issue":"1\u20133","key":"10.1016\/j.dam.2017.09.013_b21","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."},{"unstructured":"Gerd Wegner, Graphs with given diameter and a coloring problem, Tech. report, University of Dortmund, 1977.","key":"10.1016\/j.dam.2017.09.013_b22"},{"issue":"1","key":"10.1016\/j.dam.2017.09.013_b23","doi-asserted-by":"crossref","DOI":"10.37236\/216","article-title":"On-line list colouring of graphs","volume":"16","author":"Zhu","year":"2009","journal-title":"Electron. J. Combin."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X17304365?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X17304365?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T23:29:50Z","timestamp":1712359790000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X17304365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":23,"alternative-id":["S0166218X17304365"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2017.09.013","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Dynamic coloring parameters for graphs with given genus","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2017.09.013","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}