乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T11:08:31Z","timestamp":1724929711558},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T00:00:00Z","timestamp":1676073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T00:00:00Z","timestamp":1676073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071077","11771443","12071265"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00373-023-02615-1","type":"journal-article","created":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T09:05:36Z","timestamp":1676106336000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Coloring Squares of Planar Graphs with Maximum Degree at Most Five"],"prefix":"10.1007","volume":"39","author":[{"given":"Jianfeng","family":"Hou","sequence":"first","affiliation":[]},{"given":"Yindong","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Lianying","family":"Miao","sequence":"additional","affiliation":[]},{"given":"Qian","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,11]]},"reference":[{"key":"2615_CR1","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1137\/S0895480100367950","volume":"16","author":"G Agnarsson","year":"2003","unstructured":"Agnarsson, G., Halldrsson, M.M.: Coloring powers of planar graphs. SIAM J. Discrete Math. 16, 651\u2013662 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"2615_CR2","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.jctb.2018.06.005","volume":"134","author":"M Bonamy","year":"2019","unstructured":"Bonamy, M., Cranston, D.W., Postle, L.: Planar graphs of girth at least five are square $$(\\Delta (G)+2)$$-choosable. J. Combin. Theory Ser. B 134, 218\u2013238 (2019)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2615_CR3","unstructured":"Borodin, O.V., Broersma, H.J., Glebov, A., van den Heuvel, J.: Stars and bunches in planar graphs. Part I: triangulations, CDAM Research Report Series 2002\u201304, (2002)"},{"key":"2615_CR4","unstructured":"Borodin, O.V., Broersma, H.J., Glebov, A., van den Heuvel, J.: Stars and bunches in planar graphs. Part II: general planar graphs and colourings, CDAM Research Report Series 2002\u201305, (2002)"},{"key":"2615_CR5","doi-asserted-by":"publisher","first-page":"6496","DOI":"10.1016\/j.disc.2009.06.029","volume":"309","author":"OV Borodin","year":"2009","unstructured":"Borodin, O.V., Ivanova, A.O.: 2-distance $$(\\Delta (G)+2)$$-coloring of planar graphs with girth six and $$\\Delta (G)\\ge 18$$. Discrete Math. 309, 6496\u20136502 (2009)","journal-title":"Discrete Math."},{"key":"2615_CR6","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.disc.2011.09.018","volume":"312","author":"OV Borodin","year":"2012","unstructured":"Borodin, O.V., Ivanova, A.O.: List 2-facial 5-colorability of plane graphs with girth at least 12. Discrete Math. 312, 306\u2013314 (2012)","journal-title":"Discrete Math."},{"key":"2615_CR7","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/s10878-011-9409-z","volume":"24","author":"Y Bu","year":"2012","unstructured":"Bu, Y., Zhu, X.: An optimal square coloring of planar graphs. J. Comb. Optim. 24, 580\u2013592 (2012)","journal-title":"J. Comb. Optim."},{"key":"2615_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10878-018-0285-7","volume":"36","author":"Y Bu","year":"2018","unstructured":"Bu, Y., Zhu, J.: Minimum 2-distance coloring of planar graphs and channel assignment. J. Comb. Optim. 36, 55\u201364 (2018)","journal-title":"J. Comb. Optim."},{"key":"2615_CR9","doi-asserted-by":"publisher","first-page":"1650013","DOI":"10.1142\/S1793830916500130","volume":"8","author":"Y Bu","year":"2016","unstructured":"Bu, Y., Lv, X., Yan, X.: The list 2-distance coloring of a graph with $$\\Delta (G)=5$$. Discrete Math. Algor. Appl. 8, 1650013 (2016)","journal-title":"Discrete Math. Algor. Appl."},{"key":"2615_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112766","volume":"345","author":"M Chen","year":"2022","unstructured":"Chen, M., Miao, L., Zhou, S.: 2-distance coloring of planar graphs with maximum degree 5. Discrete Math. 345, 112766 (2022)","journal-title":"Discrete Math."},{"key":"2615_CR11","first-page":"86","volume":"59","author":"DW Cranston","year":"2014","unstructured":"Cranston, D.W., Erman, R., \u0160krekovski, R.: Choosability of the square of a planar graph with maximum degree four. Aust. J. Comb. 59, 86\u201397 (2014)","journal-title":"Aust. J. Comb."},{"key":"2615_CR12","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1137\/17M1157313","volume":"33","author":"W Dong","year":"2019","unstructured":"Dong, W.: B, Xu, 2-distance coloring of planar graphs without 4-cycles and 5-cycles. SIAM J. Discrete Math. 33, 1297\u20131312 (2019)","journal-title":"SIAM J. Discrete Math."},{"key":"2615_CR13","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.dam.2020.04.021","volume":"284","author":"W Dong","year":"2020","unstructured":"Dong, W.: $$L(p, q)$$-labeling of planar graphs with small girth. Discrete Appl. Math. 284, 592\u2013601 (2020)","journal-title":"Discrete Appl. Math."},{"key":"2615_CR14","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1137\/S0036144504444711","volume":"47","author":"A Gebremedhin","year":"2005","unstructured":"Gebremedhin, A., Manne, F., Pothen, A.: What color is your Jacobian? Graph coloring for computing derivatives. SIAM Rev. 47, 629\u2013705 (2005)","journal-title":"SIAM Rev."},{"key":"2615_CR15","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labeling graphs with a condition at distance 2. SIAM J. Discrete Math. 5, 586\u2013595 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"2615_CR16","unstructured":"Hou, J., Jin, Y., Li, H., Miao, L., Zhao, Q.: On $$L(p, q)$$-labelling of planar graphs without cycles of length four. Submitted"},{"key":"2615_CR17","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.disc.2020.112137","volume":"343","author":"J Hou","year":"2020","unstructured":"Hou, J., Zhu, H.: Choosability with union separation of triangle-free planar graphs. Discrete Math. 343, 112\u2013137 (2020)","journal-title":"Discrete Math."},{"key":"2615_CR18","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1007\/s40840-020-01040-4","volume":"44","author":"J Hou","year":"2021","unstructured":"Hou, J., Zhu, H.: Coloring graphs without bichromatic cycles or paths. Bull. Malays. Math. Sci. Soc. 44, 1905\u20131917 (2021)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"2615_CR19","first-page":"46","volume":"268","author":"F Kramer","year":"1969","unstructured":"Kramer, F., Kramer, H.: Un probl\u00e8me de coloration des sommets d\u2019un graphe. C. R. Math. Acad. Sci. Paris. 268, 46\u201348 (1969)","journal-title":"C. R. Math. Acad. Sci. Paris."},{"key":"2615_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-022-2200-8","volume":"17","author":"J Li","year":"2023","unstructured":"Li, J., Li, W., Yang, Y., Yang, X.: On the parameterized complexity of minimum\/maximum degree vertex deletion on several special graphs. Front. Comput. Sci. 17, 174405 (2023)","journal-title":"Front. Comput. Sci."},{"key":"2615_CR21","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0012-365X(03)00059-1","volume":"269","author":"K Lih","year":"2003","unstructured":"Lih, K., Wang, W., Zhu, X.: Coloring the square of a $$K_4$$-minor free graph. Discrete Math. 269, 303\u2013309 (2003)","journal-title":"Discrete Math."},{"key":"2615_CR22","first-page":"71","volume":"92","author":"E Lloyd","year":"1992","unstructured":"Lloyd, E., Ramanathan, S.: On the complexity of distance-2 coloring. Proc. ICCI 92, 71\u201374 (1992)","journal-title":"Proc. ICCI"},{"key":"2615_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.jctb.2004.12.005","volume":"94","author":"M Molloy","year":"2005","unstructured":"Molloy, M., Salavatipour, M.R.: A bound on the chromatic number of the square of a planar graph. J. Combin. Theory Ser. B 94, 189\u2013213 (2005)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2615_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-020-9205-y","volume":"15","author":"Y Peng","year":"2021","unstructured":"Peng, Y., Lin, X., Choi, B., He, B.: VColor*: a practical approach for coloring large graphs. Front. Comput. Sci. 15, 154610 (2021)","journal-title":"Front. Comput. Sci."},{"key":"2615_CR25","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.jctb.2017.08.010","volume":"128","author":"C Thomassen","year":"2018","unstructured":"Thomassen, C.: The square of a planar cubic graph is 7-colorable. J. Combin. Theory Ser. B 128, 192\u2013218 (2018)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2615_CR26","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1002\/jgt.10077","volume":"42","author":"J van den Heuvel","year":"2003","unstructured":"van den Heuvel, J., McGuinness, S.: Colouring the square of a planar graph. J. Graph Theory 42, 110\u2013124 (2003)","journal-title":"J. Graph Theory"},{"key":"2615_CR27","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/S0895480101390448","volume":"17","author":"W Wang","year":"2003","unstructured":"Wang, W., Lih, K.: Labeling planar graphs with conditions on girth and distance two. SIAM J. Discrete Math. 17, 264\u2013275 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"2615_CR28","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s00373-020-02254-w","volume":"37","author":"J Wang","year":"2021","unstructured":"Wang, J., Miao, L., Song, W., Liu, Y.: Acyclic coloring of graphs with maximum degree 7. Graphs Combin. 37, 455\u2013469 (2021)","journal-title":"Graphs Combin."},{"key":"2615_CR29","unstructured":"Wegner, G.: Graphs with Given Diameter and a Coloring Problem. Technical Report, University of Dortmund, Germany (1977)"},{"key":"2615_CR30","unstructured":"Wong, S.A.: Colouring Graphs with Respect to Distance. M.Sc. Thesis, Department of Combinatorics and Optimization, University of Waterloo (1996)"},{"key":"2615_CR31","doi-asserted-by":"publisher","first-page":"2211","DOI":"10.1016\/j.disc.2018.04.025","volume":"341","author":"H Zhu","year":"2018","unstructured":"Zhu, H., Miao, L., Chen, S., Lv, X., Song, W.: The list $$L$$-(2, 1)-labeling of planar graphs. Discrete Math. 341, 2211\u20132219 (2018)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02615-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02615-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02615-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T17:04:12Z","timestamp":1681319052000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02615-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,11]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["2615"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02615-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,11]]},"assertion":[{"value":"7 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted. The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"20"}}