Optimal channel assignment with list-edge coloring

• Bessy S, Havet F (2013) Enumerating the edge-colourings and total colourings of a regular graph. J Comb Optim 25:523–535

  Article  MathSciNet  MATH  Google Scholar 

• Borodin OV, Kostochka AV, Woodall DR (1997) List edge and list total colourings of multigraphs. J Comb Theory Ser B 71:184–204

  Article  MathSciNet  MATH  Google Scholar 

• Du HW, Jia XH, Li DY, Wu WL (2004) Coloring of double disk graphs. J Glob Optim 28:115–119

  Article  MathSciNet  MATH  Google Scholar 

• 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–25. https://doi.org/10.1109/SPDP.1996.570312

• Gutner S (1996) The complexity of planar graph choosability. Discrete Math 159(1):119–130

  Article  MathSciNet  MATH  Google Scholar 

• Gutner S, Tarsi M (2009) Some results on \((a, b)\)-choosability. Discrete Math 309(8):2260–2270

  Article  MathSciNet  MATH  Google Scholar 

• Hägkvist R, Chetwynd A (1992) Some upper bounds on the total and list chromatic numbers of multigraphs. J Graph Theory 16:503–516

  Article  MathSciNet  MATH  Google Scholar 

• Hou JF, Liu GZ, Cai JS (2006) List edge and list total colorings of planar graphs without 4-cycles. Theor Comput Sci 369:250–255

  Article  MathSciNet  MATH  Google Scholar 

• Jensen T, Toft B (1995) Graph coloring problems. Wiley-Interscience, New York

  MATH  Google Scholar 

• Kowalik L, Socala A (2018) Tight lower bounds for list edge coloring. arXiv:1804.02537v1

• Li R, Xu BG (2011) Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles. Discrete Math 311:2158–2163

  Article  MathSciNet  MATH  Google Scholar 

• 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–6043

  Article  MathSciNet  MATH  Google Scholar 

• Roberts FS (1991) T-colorings of a graphs:recent results and open problems. Discrete Math 93:229–245

  Article  MathSciNet  Google Scholar 

• 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–151

  Article  MathSciNet  MATH  Google Scholar 

• 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–933

  Article  Google Scholar 

• 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–694

• Wang HJ, Wu LD, Wu WL, Pardalos PM, Wu JL (2014) Minimum total coloring of planar graph. J Glob Optim 60:777–791

  Article  MathSciNet  MATH  Google Scholar 

• 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–1022

  Article  MathSciNet  MATH  Google Scholar 

• 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–224

  Article  MathSciNet  Google Scholar 

• 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–3499

  Article  Google Scholar 

Download references