\(T\)-graphs and the channel assignment problem

DOI10.1016/0012-365X(95)00225-LzbMath0870.05023OpenAlexW2091894611MaRDI QIDQ1356423

Daphne Der-Fen Liu

Publication date: 11 September 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00225-l

zbMATH Keywords

\(T\)-coloringschannel assignment problemspan\(T\)-graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Asymptotic clique covering ratios of distance graphs ⋮ The edge span of T-coloring on graph \(C^{d}_{n}\) ⋮ \(T\)-coloring of certain networks ⋮ No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups ⋮ The complexity of the \(T\)-coloring problem for graphs with small degree ⋮ On optimal \(M\)-sets related to Motzkin's problem ⋮ Greedy \(T\)-colorings of graphs ⋮ Distance graphs and \(T\)-coloring ⋮ On \(T\)-set of \(T\)-colorings

Cites Work

• \(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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(T\)-graphs and the channel assignment problem