Interference patterns in bijective colorings of 2-regular graphs

DOI10.1016/S0166-218X(99)00220-6zbMath1007.05044WikidataQ114121915 ScholiaQ114121915MaRDI QIDQ1566572

Paul E. Wright, Peter C. Fishburn

Publication date: 30 July 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

regular graphsinterferencechannel assignmentbijective coloring

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Obituary: Peter C. Fishburn (1936--2021)

Cites Work

• Unnamed Item
• \(T\)-colorings of graphs: recent results and open problems
• List \(T\)-colorings of graphs
• The channel assignment problem for mutually adjacent sites
• No-hole \(k\)-tuple \((r+1)\)-distant colorings
• No-hole \(k\)-tuple \((r+1)\)-distant colorings of odd cycles
• Star chromatic number
• Pair Labelings of Graphs
• Further Results on T-Coloring and Frequency Assignment Problems
• Interference-Minimizing Colorings of Regular Graphs

This page was built for publication: Interference patterns in bijective colorings of 2-regular graphs