A polynomial algorithm for finding \(T\)-span of generalized cacti

DOI10.1016/S0166-218X(02)00575-9zbMath1023.05125MaRDI QIDQ1406033

Krzysztof Giaro, Robert Janczewski, Michał Małafiejski

Publication date: 9 September 2003

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

zbMATH Keywords

T-coloringT-spanthorny graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

\(T\)-colorings, divisibility and the circular chromatic number ⋮ Greedy \(T\)-colorings of graphs ⋮ The computational complexity of the backbone coloring problem for planar graphs with connected backbones

Cites Work

• \(T\)-colorings of graphs: recent results and open problems
• \(T\)-colorings of graphs
• Distance graphs and the \(T\)-coloring problem
• List \(T\)-colorings of graphs
• The complexity of the \(T\)-coloring problem for graphs with small degree
• A rainbow about \(T\)-colorings for complete graphs
• Further Results on T-Coloring and Frequency Assignment Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: A polynomial algorithm for finding \(T\)-span of generalized cacti