Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs

DOI10.1016/S1571-0653(04)00393-2zbMath1171.05434OpenAlexW2017304346MaRDI QIDQ3438981

Bruce A. Reed, Colin J. H. McDiarmid

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00393-2

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On the span in channel assignment problems: Bounds, computing and counting

Cites Work

• Easy problems for tree-decomposable graphs
• A linear time algorithm for finding tree-decompositions of small treewidth
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs