Optimal channel assignment with list-edge coloring

DOI10.1007/s10878-018-00376-9zbMath1420.05062OpenAlexW2908554466MaRDI QIDQ2424801

Bin Liu, Panos M. Pardalos, Hui-Juan Wang

Publication date: 25 June 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-00376-9

zbMATH Keywords

planar graphchoosabilitychordalintersecting

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs

Cites Work

• Unnamed Item
• A note on the minimum number of choosability of planar graphs
• Minimum total coloring of planar graph
• Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
• List edge and list total colorings of planar graphs without 4-cycles
• Some results on \((a:b)\)-choosability
• Total colorings and list total colorings of planar graphs without intersecting 4-cycles
• The complexity of planar graph choosability
• \(T\)-colorings of graphs: recent results and open problems
• List edge and list total colourings of multigraphs
• Coloring of double disk graphs
• Enumerating the edge-colourings and total colourings of a regular graph
• Some upper bounds on the total and list chromatic numbers of multigraphs
• Tight Lower Bounds for List Edge Coloring
• Computing Minimum k-Connected m-Fold Dominating Set in General Graphs
• A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem

This page was built for publication: Optimal channel assignment with list-edge coloring