{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:30Z","timestamp":1740122370836,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T00:00:00Z","timestamp":1710288000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T00:00:00Z","timestamp":1710288000000},"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":["12101285","12171222","12071411"],"award-info":[{"award-number":["12101285","12171222","12071411"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s10878-024-01111-3","type":"journal-article","created":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:36:13Z","timestamp":1710362173000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On list (p,\u00a01)-total labellings of special planar graphs and 1-planar graphs"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0751-2442","authenticated-orcid":false,"given":"Lin","family":"Sun","sequence":"first","affiliation":[]},{"given":"Guanglong","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Jianliang","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,13]]},"reference":[{"key":"1111_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N Alon","year":"1992","unstructured":"Alon N, Tarsi M (1992) Colorings and orientation of graphs. Combinatorica 12:125\u2013134","journal-title":"Combinatorica"},{"key":"1111_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(97)00124-8","volume":"82","author":"N Alon","year":"1998","unstructured":"Alon N, Zaks A (1998) T-choosability in graphs. Discrete Appl Math 82:1\u201313","journal-title":"Discrete Appl Math"},{"issue":"16","key":"1111_CR3","doi-asserted-by":"publisher","first-page":"2141","DOI":"10.1016\/j.disc.2005.12.059","volume":"307","author":"F Bazzaro","year":"2007","unstructured":"Bazzaro F, Montassier M, Raspaud A (2007) (d, 1)-total labelling of planar graphs with large girth and high maximum degree. Discrete Math 307(16):2141\u20132151","journal-title":"Discrete Math"},{"key":"1111_CR4","unstructured":"Behzad M (1965) Graphs and their chromatic numbers. Ph.D. Thesis, Michigan State Uni- versity"},{"key":"1111_CR5","volume-title":"Graph Theory Appl","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph Theory Appl. North-Holland, New York"},{"key":"1111_CR6","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 (2020) L(p, q)-labeling of planar graphs with small girth. Discrete Appl Math 284:592\u2013601","journal-title":"Discrete Appl Math"},{"key":"1111_CR7","unstructured":"Fiala J, \u0160krekovski R (2002) List distance-labelings of graphs. http:\/\/kam.mff.cuni.cz\/kamserie\/serie\/clanky\/2001\/s530.ps"},{"key":"1111_CR8","unstructured":"Havet F, Yu ML (2002) $$(d, 1)$$-total labelling of graphs. INRIA, Technical Report $$\\sharp $$ 4650"},{"key":"1111_CR9","unstructured":"Havet F (2003) $$(d, 1)$$-total labelling of graphs. In: Workshop on Graphs and Algorithms, Dijon"},{"issue":"4","key":"1111_CR10","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1016\/j.disc.2007.03.034","volume":"308","author":"F Havet","year":"2008","unstructured":"Havet F, Yu ML (2008) $$(d, 1)$$-total labelling of graphs. Discrete Math 308(4):496\u2013513","journal-title":"Discrete Math"},{"key":"1111_CR11","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.jctb.2010.12.007","volume":"101","author":"D Hefetz","year":"2011","unstructured":"Hefetz D (2011) On two generalization of the Alon\u2013Tarsi polynomial method. J Combin Theory Ser B 101:403\u2013414","journal-title":"J Combin Theory Ser B"},{"key":"1111_CR12","doi-asserted-by":"publisher","first-page":"531","DOI":"10.7151\/dmgt.2208","volume":"41","author":"B Niu","year":"2021","unstructured":"Niu B, Zhang X (2021) On (p,1)-total labelling of some 1-planar graphs. Discuss Math Graph Theory 41:531\u2013558","journal-title":"Discuss Math Graph Theory"},{"key":"1111_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02996313","volume":"29","author":"G Ringel","year":"1965","unstructured":"Ringel G (1965) Ein Sechsfarbenproblem auf der Kugel. Abh Math Semin Univ Hambg 29:107\u2013117","journal-title":"Abh Math Semin Univ Hambg"},{"key":"1111_CR14","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0012-365X(74)90157-5","volume":"8","author":"DE Scheim","year":"1974","unstructured":"Scheim DE (1974) The number of edge 3-colorings of a planar cubic graph as a permanent. Discrete Math 8:377\u2013382","journal-title":"Discrete Math"},{"key":"1111_CR15","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10878-015-9958-7","volume":"33","author":"L Sun","year":"2017","unstructured":"Sun L, Wu JL (2017) On (p, 1)-total labelling of planar graphs. J Comb Optim 33:317\u2013325","journal-title":"J Comb Optim"},{"key":"1111_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0166-218X(93)90015-G","volume":"45","author":"BA Tesman","year":"1993","unstructured":"Tesman BA (1993) List $$T$$-colorings of graphs. Discrete Appl Math 45:277\u2013289","journal-title":"Discrete Appl Math"},{"key":"1111_CR17","first-page":"117","volume":"23","author":"VG Vizing","year":"1968","unstructured":"Vizing VG (1968) Some unsolved problems in graph theory. Uspekhi Mat Nauk 23:117\u2013134 ((in Russian))","journal-title":"Uspekhi Mat Nauk"},{"key":"1111_CR18","doi-asserted-by":"publisher","first-page":"6210","DOI":"10.1016\/j.disc.2007.11.044","volume":"308","author":"JL Wu","year":"2008","unstructured":"Wu JL, Wang P (2008) List-edge and list-total colorings of graphs embedded on hyperbolic surfaces. Discrete Math 308:6210\u20136215","journal-title":"Discrete Math"},{"key":"1111_CR19","doi-asserted-by":"publisher","first-page":"1625","DOI":"10.1080\/09720529.2016.1139850","volume":"20","author":"Y Yu","year":"2017","unstructured":"Yu Y, Zhang X, Wang G, Liu G, Li J (2017) (2, 1)-total labelling of planar graphs with large maximum degree. J Discrete Math Sci Cryptogr 20:1625\u20131636","journal-title":"J Discrete Math Sci Cryptogr"},{"issue":"3","key":"1111_CR20","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s00373-019-02027-0","volume":"35","author":"X Zhang","year":"2019","unstructured":"Zhang X, Niu B, Yu JG (2019) A structure of 1-planar graph and its applications to coloring problems. Graphs Combin 35(3):677\u2013688","journal-title":"Graphs Combin"},{"issue":"6","key":"1111_CR21","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.2478\/s11533-011-0092-1","volume":"9","author":"X Zhang","year":"2011","unstructured":"Zhang X, Yu Y, Liu GZ (2011) On $$(p,1)$$-total labelling of 1-planar graphs. Central Eur J Math 9(6):1424\u20131434","journal-title":"Central Eur J Math"},{"key":"1111_CR22","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.ipl.2010.11.001","volume":"111","author":"X Zhang","year":"2011","unstructured":"Zhang X, Wu JL (2011) On edge colorings of 1-planar graphs. Inform Process Lett 111:124\u2013128","journal-title":"Inform Process Lett"},{"key":"1111_CR23","doi-asserted-by":"publisher","first-page":"2211","DOI":"10.1016\/j.disc.2018.04.025","volume":"341","author":"HY Zhu","year":"2018","unstructured":"Zhu HY, Miao LY, Chen S, Lv XZ, Song WY (2018) The list L(2, 1)-labeling of planar graphs. Discrete Math 341:2211\u20132219","journal-title":"Discrete Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01111-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01111-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01111-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T19:04:59Z","timestamp":1713985499000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01111-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,13]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1111"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01111-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,3,13]]},"assertion":[{"value":"7 February 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All the data in this paper can be available.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data availability"}}],"article-number":"15"}}