\(T\)-colorings and \(T\)-edge spans of graphs

DOI10.1007/s003730050063zbMath0936.05042OpenAlexW2159813314MaRDI QIDQ1808715

Shin-Jie Hu, Su-Tzu Juan, Gerard Jennhwa Chang

Publication date: 18 May 2000

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730050063

zbMATH Keywords

\(T\)-colouringtransmitters\(T\)-edge span

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

An \(O(n\log n)\) algorithm for finding edge span of cacti ⋮ 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 ⋮ Colorings at minimum cost ⋮ Between Colorings and Layouts - Minimum Morphism Cost Problems

This page was built for publication: \(T\)-colorings and \(T\)-edge spans of graphs