{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:41Z","timestamp":1740122381683,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,7]],"date-time":"2019-01-07T00:00:00Z","timestamp":1546819200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501316","11871442"],"award-info":[{"award-number":["11501316","11871442"]}],"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":[[2019,7]]},"DOI":"10.1007\/s10878-018-00376-9","type":"journal-article","created":{"date-parts":[[2019,1,8]],"date-time":"2019-01-08T13:14:28Z","timestamp":1546953268000},"page":"197-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal channel assignment with list-edge coloring"],"prefix":"10.1007","volume":"38","author":[{"given":"Huijuan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,7]]},"reference":[{"key":"376_CR1","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s10878-011-9448-5","volume":"25","author":"S Bessy","year":"2013","unstructured":"Bessy S, Havet F (2013) Enumerating the edge-colourings and total colourings of a regular graph. J Comb Optim 25:523\u2013535","journal-title":"J Comb Optim"},{"key":"376_CR2","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/jctb.1997.1780","volume":"71","author":"OV Borodin","year":"1997","unstructured":"Borodin OV, Kostochka AV, Woodall DR (1997) List edge and list total colourings of multigraphs. J Comb Theory Ser B 71:184\u2013204","journal-title":"J Comb Theory Ser B"},{"key":"376_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1023\/B:JOGO.0000006750.85332.0f","volume":"28","author":"HW Du","year":"2004","unstructured":"Du HW, Jia XH, Li DY, Wu WL (2004) Coloring of double disk graphs. J Glob Optim 28:115\u2013119","journal-title":"J Glob Optim"},{"key":"376_CR4","doi-asserted-by":"publisher","unstructured":"Garg N, Papatriantafilou M, Tsigas P (1996) Distributed list coloring: how to dynamically allocate frequencies to mobile base stations. In: Eighth IEEE symposium on parallel and distributed processing, pp 18\u201325. \n                    https:\/\/doi.org\/10.1109\/SPDP.1996.570312","DOI":"10.1109\/SPDP.1996.570312"},{"issue":"1","key":"376_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0012-365X(95)00104-5","volume":"159","author":"S Gutner","year":"1996","unstructured":"Gutner S (1996) The complexity of planar graph choosability. Discrete Math 159(1):119\u2013130","journal-title":"Discrete Math"},{"issue":"8","key":"376_CR6","doi-asserted-by":"publisher","first-page":"2260","DOI":"10.1016\/j.disc.2008.04.061","volume":"309","author":"S Gutner","year":"2009","unstructured":"Gutner S, Tarsi M (2009) Some results on \n                    \n                      \n                    \n                    $$(a, b)$$\n                    \n                      \n                        \n                          (\n                          a\n                          ,\n                          b\n                          )\n                        \n                      \n                    \n                  -choosability. Discrete Math 309(8):2260\u20132270","journal-title":"Discrete Math"},{"key":"376_CR7","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1002\/jgt.3190160510","volume":"16","author":"R H\u00e4gkvist","year":"1992","unstructured":"H\u00e4gkvist R, Chetwynd A (1992) Some upper bounds on the total and list chromatic numbers of multigraphs. J Graph Theory 16:503\u2013516","journal-title":"J Graph Theory"},{"key":"376_CR8","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.tcs.2006.08.043","volume":"369","author":"JF Hou","year":"2006","unstructured":"Hou JF, Liu GZ, Cai JS (2006) List edge and list total colorings of planar graphs without 4-cycles. Theor Comput Sci 369:250\u2013255","journal-title":"Theor Comput Sci"},{"key":"376_CR9","volume-title":"Graph coloring problems","author":"T Jensen","year":"1995","unstructured":"Jensen T, Toft B (1995) Graph coloring problems. Wiley-Interscience, New York"},{"key":"376_CR10","unstructured":"Kowalik L, Socala A (2018) Tight lower bounds for list edge coloring. \n                    arXiv:1804.02537v1"},{"key":"376_CR11","doi-asserted-by":"publisher","first-page":"2158","DOI":"10.1016\/j.disc.2011.06.031","volume":"311","author":"R Li","year":"2011","unstructured":"Li R, Xu BG (2011) Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles. Discrete Math 311:2158\u20132163","journal-title":"Discrete Math"},{"key":"376_CR12","doi-asserted-by":"publisher","first-page":"6035","DOI":"10.1016\/j.disc.2009.05.006","volume":"309","author":"B Liu","year":"2009","unstructured":"Liu B, Hou JF, Wu JL, Liu GZ (2009) Total colorings and list total colorings of planar graphs without intersecting 4-cycles. Discrete Math 309:6035\u20136043","journal-title":"Discrete Math"},{"key":"376_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","volume":"93","author":"FS Roberts","year":"1991","unstructured":"Roberts FS (1991) T-colorings of a graphs:recent results and open problems. Discrete Math 93:229\u2013245","journal-title":"Discrete Math"},{"issue":"1","key":"376_CR14","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/s10878-014-9720-6","volume":"31","author":"YS Shi","year":"2016","unstructured":"Shi YS, Zhang YP, Zhang Z, Wu WL (2016) A greedy algorithm for the minimum 2-connected m-fold dominating set problem. J Comb Optim 31(1):136\u2013151","journal-title":"J Comb Optim"},{"issue":"2","key":"376_CR15","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/TNET.2016.2607723","volume":"25","author":"YS Shi","year":"2017","unstructured":"Shi YS, Zhang Z, Mo YC, Du DZ (2017) Approximation algorithm for minimum weight fault-tolerant virtual backbone in unit disk graphs. IEEE\/ACM Trans Netw 25(2):925\u2013933","journal-title":"IEEE\/ACM Trans Netw"},{"key":"376_CR16","doi-asserted-by":"crossref","unstructured":"Wang W, Liu X (2005) List coloring based channel allocation for open-spectrum wireless networks. IN: IEEE 62nd vehicular technology conference (VTC 2005-Fall), vol 1, pp 690\u2013694","DOI":"10.1109\/VETECF.2005.1558001"},{"key":"376_CR17","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/s10898-013-0138-y","volume":"60","author":"HJ Wang","year":"2014","unstructured":"Wang HJ, Wu LD, Wu WL, Pardalos PM, Wu JL (2014) Minimum total coloring of planar graph. J Glob Optim 60:777\u2013791","journal-title":"J Glob Optim"},{"key":"376_CR18","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1007\/s10878-014-9805-2","volume":"31","author":"HJ Wang","year":"2016","unstructured":"Wang HJ, Wu LD, Zhang X, Wu WL, Liu B (2016) A note on the minimum number of choosability of planar graphs. J Comb Optim 31:1013\u20131022","journal-title":"J Comb Optim"},{"issue":"2","key":"376_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1287\/ijoc.2017.0776","volume":"30","author":"Z Zhang","year":"2018","unstructured":"Zhang Z, Zhou J, Tang SJ, Huang XH, Du DZ (2018) Computing minimum k-connected m-fold dominating set in general graphs. INFORMS J Comput 30(2):217\u2013224","journal-title":"INFORMS J Comput"},{"issue":"6","key":"376_CR20","doi-asserted-by":"publisher","first-page":"3487","DOI":"10.1109\/TNET.2017.2740328","volume":"25","author":"J Zhou","year":"2017","unstructured":"Zhou J, Zhang Z, Tang SJ, Huang XH, Mo YC, Du DZ (2017) Fault-tolerant virtual backbone in heterogeneous wireless sensor network. IEEE\/ACM Trans Netw 25(6):3487\u20133499","journal-title":"IEEE\/ACM Trans Netw"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-00376-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-00376-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-00376-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T19:14:18Z","timestamp":1578338058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-00376-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,7]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["376"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-00376-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,1,7]]},"assertion":[{"value":"7 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}