Optimal channel assignment with list-edge coloring
- 19 Downloads
Motivated from optimal channel assignment in optical networks, the list edge (and total) coloring are studied in this paper. In a special case of planar graphs, we determined the list edge (and total) coloring number.
KeywordsChoosability Planar graph Intersecting Chordal
Funding was provided by National Natural Science Foundation of China (Grant Nos. 11501316, 11871442).
- 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
- Kowalik L, Socala A (2018) Tight lower bounds for list edge coloring. arXiv:1804.02537v1
- 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–694Google Scholar