An Asymptotic Approach to the Channel Assignment Problem

DOI10.1137/0606050zbMath0579.05058OpenAlexW1986211417MaRDI QIDQ3701467

Joshua H. Rabinowitz, Viera Krǔanová Proulx

Publication date: 1985

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0606050

zbMATH Keywords

asymptotically optimalchannel assignment problemT-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (16)

Asymptotic clique covering ratios of distance graphs ⋮ On Graceful Directed Graphs ⋮ Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings ⋮ The channel assignment problem for mutually adjacent sites ⋮ \(T\)-graphs and the channel assignment problem ⋮ Maximal density of sets with missing differences and various coloring parameters of distance graphs ⋮ No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups ⋮ Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ ⋮ On the density of integral sets with missing differences from sets related to arithmetic progressions ⋮ \(T\)-colorings of graphs: recent results and open problems ⋮ Fractional chromatic number of distance graphs generated by two-interval sets ⋮ Sequences of integers with three missing separations ⋮ Density of sets with missing differences and applications ⋮ Unnamed Item ⋮ Maximal density of integral sets with missing differences and the kappa values ⋮ Distance graphs and \(T\)-coloring

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Circulant graph imbeddings
• Isomorphism of circulant graphs and digraphs

This page was built for publication: An Asymptotic Approach to the Channel Assignment Problem