The channel assignment problem for mutually adjacent sites

DOI10.1016/0097-3165(94)90096-5zbMath0816.05027OpenAlexW2020496790MaRDI QIDQ1336445

Jerrold R. Griggs, Daphne Der-Fen Liu

Publication date: 13 July 1995

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(94)90096-5

zbMATH Keywords

difference sequence\(T\)-coloringchannel assignment problemperiodic sequencemutually adjacent sitesoptimal span

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (15)

Asymptotic clique covering ratios of distance graphs ⋮ The edge span of T-coloring on graph \(C^{d}_{n}\) ⋮ \(T\)-coloring of certain networks ⋮ \(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 ⋮ On the density of integral sets with missing differences from sets related to arithmetic progressions ⋮ Maximal density and the kappa values for the families \(\{a,a+1,2a+1,n\}\) and \(\{a,a+1,2a+1,3a+1,n\}\) ⋮ The complexity of the \(T\)-coloring problem for graphs with small degree ⋮ Fractional chromatic number of distance graphs generated by two-interval sets ⋮ Channel assignment and weighted coloring ⋮ Sequences of integers with three missing separations ⋮ Density of sets with missing differences and applications ⋮ Interference patterns in bijective colorings of 2-regular graphs ⋮ Distance graphs and \(T\)-coloring

Cites Work

• Unnamed Item
• Unnamed Item
• \(T\)-colorings of graphs
• List \(T\)-colorings of graphs
• Sequences of integers with missing differences
• An Asymptotic Approach to the Channel Assignment Problem
• On Infinite-Difference Sets
• Further Results on T-Coloring and Frequency Assignment Problems
• Sets of integers with missing differences

This page was built for publication: The channel assignment problem for mutually adjacent sites