The edge span of T-coloring on graph C^d_n

DOI10.1016/J.AML.2005.08.016MaRDI QIDQ2371031zbMATH OpenOpenAlexFDO

Authors Yongqiang Zhao, Wenjie He, Rongrong Cao

Publication date 29 June 2007

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aml.2005.08.016

zbMATH Keywords

edge spanspanT-chromatic numberT-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Review text

T-colorings of graphs arose in connection with the channel assignment problem in communications. The authors find the exact value of the minimum edge span over all T-colorings of the \(d\)th power of the \(n\)-cycle for some parameters.

Recommendations

• \(T\)-colorings and \(T\)-edge spans of graphs
• scientific article; zbMATH DE number 1439401
• \(T\)-colorings of graphs: recent results and open problems
• Further Results on T-Coloring and Frequency Assignment Problems
• \(T\)-coloring of certain networks

Cites work

• \(T\)-colorings and \(T\)-edge spans of graphs
• \(T\)-colorings of graphs
• \(T\)-colorings of graphs: recent results and open problems
• \(T\)-graphs and the channel assignment problem
• scientific article; zbMATH DE number 3853101 (Why is no real title available?)
• List T-colorings of graphs
• The channel assignment problem for mutually adjacent sites

Cited in

(6)

• \(T\)-colorings and \(T\)-edge spans of graphs
• \(T\)-colorings, divisibility and the circular chromatic number
• \(T\)-coloring of certain networks
• scientific article; zbMATH DE number 3873373 (Why is no real title available?)
• Finite-dimensional T-colorings of graphs
• \(T\)-coloring on folded hypercubes

This page was built for publication: The edge span of T-coloring on graph \(C^{d}_{n}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371031)