乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T04:17:44Z","timestamp":1740111464424,"version":"3.37.3"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T00:00:00Z","timestamp":1681516800000},"content-version":"vor","delay-in-days":1475,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801284"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation","doi-asserted-by":"publisher","award":["61872200"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Program of China","award":["2018YFB1003405","2016YFC0400709"]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771221","11811540390"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006606","name":"Natural Science Foundation of Tianjin","doi-asserted-by":"publisher","award":["17JCQNJC00300"],"id":[{"id":"10.13039\/501100006606","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":[[2019,4]]},"DOI":"10.1016\/j.dam.2018.11.010","type":"journal-article","created":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T19:05:56Z","timestamp":1545419156000},"page":"143-151","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["Critical (<\/mml:mo>P<\/mml:mi><\/mml:mrow>6<\/mml:mn><\/mml:mrow><\/mml:msub>,<\/mml:mo>b<\/mml:mi>a<\/mml:mi>n<\/mml:mi>n<\/mml:mi>e<\/mml:mi>r<\/mml:mi>)<\/mml:mo><\/mml:mrow><\/mml:math>-free graphs"],"prefix":"10.1016","volume":"258","author":[{"given":"Shenwei","family":"Huang","sequence":"first","affiliation":[]},{"given":"Tao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"2008","series-title":"Graph Theory","author":"Bondy","key":"10.1016\/j.dam.2018.11.010_b1"},{"key":"10.1016\/j.dam.2018.11.010_b2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.endm.2015.06.007","article-title":"4-colorability of P6-free graphs","volume":"49","author":"Brause","year":"2015","journal-title":"Electron. Notes Discrete Math."},{"key":"10.1016\/j.dam.2018.11.010_b3","doi-asserted-by":"crossref","unstructured":"D. Bruce, C.T. Ho\u00e0ng, J. Sawada, A certifying algorithm for 3-colorability of p5-free graphs, in: Proceedings of 20th International Symposium on Algorithms and Computation, in: Lecture Notes in Computer Science, vol. 5878, 2009, pp. 594\u2013604.","DOI":"10.1007\/978-3-642-10631-6_61"},{"key":"10.1016\/j.dam.2018.11.010_b4","doi-asserted-by":"crossref","unstructured":"M. Chudnovsky, J. Goedgebeur, O. Schaudt, M. Zhong, Obstructions for three-coloring graphs with one forbidden induced subgraph, in: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, 2016, pp. 1774\u20131783.","DOI":"10.1137\/1.9781611974331.ch123"},{"key":"10.1016\/j.dam.2018.11.010_b5","unstructured":"M. Chudnovsky, J. Goedgebeur, O. Schaudt, M. Zhong, Obstructions for three-coloring and list three-coloring H-free graphs, arXiv:1703.05684 [math.CO]."},{"key":"10.1016\/j.dam.2018.11.010_b6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","article-title":"The strong perfect graph theorem","volume":"164","author":"Chudnovsky","year":"2006","journal-title":"Ann. of Math."},{"key":"10.1016\/j.dam.2018.11.010_b7","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.dam.2016.05.018","article-title":"On color-critical (p5, co-P5)-free graphs","volume":"216","author":"Dhaliwal","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2018.11.010_b8","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01238034","article-title":"Note on the colouring of graphs","volume":"54","author":"Dirac","year":"1951","journal-title":"Math. Z."},{"key":"10.1016\/j.dam.2018.11.010_b9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-27.1.85","article-title":"A property of 4-chromatic graphs and some remarks on critical graphs","volume":"27","author":"Dirac","year":"1952","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.dam.2018.11.010_b10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","article-title":"Some theorems on abstract graphs","volume":"2","author":"Dirac","year":"1952","journal-title":"Proc. Lond. Math. Soc."},{"key":"10.1016\/j.dam.2018.11.010_b11","first-page":"165","article-title":"Kritische graphen I","volume":"8","author":"Gallai","year":"1963","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"10.1016\/j.dam.2018.11.010_b12","first-page":"373","article-title":"Kritische graphen II","volume":"8","author":"Gallai","year":"1963","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"10.1016\/j.dam.2018.11.010_b13","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1002\/jgt.22151","article-title":"Exhaustive generation of k-critical H-free graphs","volume":"87","author":"Goedgebeur","year":"2018","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2018.11.010_b14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.dam.2015.10.024","article-title":"Complexity of coloring graphs without paths and cycles","volume":"216","author":"Hell","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2018.11.010_b15","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.dam.2014.06.007","article-title":"Constructions of k-critical p5-free graphs","volume":"182","author":"Ho\u00e0ng","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2018.11.010_b16","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/j.ejc.2015.06.005","article-title":"Improved complexity results on k-coloring pt-free graphs","volume":"51","author":"Huang","year":"2016","journal-title":"European J. Combin."},{"year":"2017","series-title":"Certifying coloring algorithms for graphs without long induced paths","author":"Kami\u0144ski","key":"10.1016\/j.dam.2018.11.010_b17"},{"key":"10.1016\/j.dam.2018.11.010_b18","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.jctb.2014.05.002","article-title":"Ore\u2019s conjecture on color-critical graphs is almost true","volume":"109","author":"Kostochka","year":"2014","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2018.11.010_b19","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.dam.2016.03.011","article-title":"4-coloring (P6,bull)-free graphs","volume":"231","author":"Maffray","year":"2017","journal-title":"Discrete Appl. Math."},{"year":"1967","series-title":"The Four Color Problem","author":"Ore","key":"10.1016\/j.dam.2018.11.010_b20"},{"key":"10.1016\/j.dam.2018.11.010_b21","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0166-218X(03)00446-3","article-title":"3-colorability \u2208P for P6-free graphs","volume":"136","author":"Randerath","year":"2004","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X18306188?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X18306188?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:36:21Z","timestamp":1712360181000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X18306188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":21,"alternative-id":["S0166218X18306188"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2018.11.010","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2019,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Critical -free graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2018.11.010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}