Optimal channel assignment with list-edge coloring

DOI10.1007/S10878-018-00376-9MaRDI QIDQ2424801zbMATH OpenOpenAlexFDO

Authors Panos M. Pardalos, Bin Liu, Huijuan 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

choosabilitychordalintersectingplanar graph

Mathematics Subject Classification ID

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

Recommendations

• Channel assignment and weighted coloring
• Channel assignment with \(r\)-dynamic coloring
• scientific article; zbMATH DE number 1163304
• Optimal channel assignment and \(L(p,1)\)-labeling
• Channel assignment problem and relaxed 2-distant coloring of graphs
• scientific article; zbMATH DE number 3853101
• L(p,q)-label coloring problem with application to channel allocation
• An approximation algorithm for channel assignment with certain constraints
• An exact algorithm for the channel assignment problem
• scientific article; zbMATH DE number 1522941

Cites work

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

Cited in

(4)

• The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs
• Vectorial solutions to list multicoloring problems on graphs
• scientific article; zbMATH DE number 1163304 (Why is no real title available?)
• Weak-strict degeneracy on line graphs of planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2424801)