\(T\)-graphs and the channel assignment problem
From MaRDI portal
Publication:1356423
DOI10.1016/0012-365X(95)00225-LzbMath0870.05023MaRDI QIDQ1356423
Publication date: 11 September 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups, Greedy \(T\)-colorings of graphs, Distance graphs and \(T\)-coloring, The complexity of the \(T\)-coloring problem for graphs with small degree, Asymptotic clique covering ratios of distance graphs, The edge span of T-coloring on graph \(C^{d}_{n}\), On \(T\)-set of \(T\)-colorings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(T\)-colorings of graphs: recent results and open problems
- \(T\)-colorings of graphs
- List \(T\)-colorings of graphs
- The channel assignment problem for mutually adjacent sites
- An Asymptotic Approach to the Channel Assignment Problem
- Further Results on T-Coloring and Frequency Assignment Problems