The complexity of the \(T\)-coloring problem for graphs with small degree

DOI10.1016/S0166-218X(02)00576-0zbMath1023.05126MaRDI QIDQ1406032

Robert Janczewski, Krzysztof Giaro, Michał Małafiejski

Publication date: 9 September 2003

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

zbMATH Keywords

T-span

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)

A polynomial algorithm for finding \(T\)-span of generalized cacti ⋮ \(T\)-colorings, divisibility and the circular chromatic number ⋮ Greedy \(T\)-colorings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of H-coloring
• \(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 channel assignment problem for mutually adjacent sites
• \(T\)-graphs and the channel assignment problem
• A rainbow about \(T\)-colorings for complete graphs
• Homomorphisms of graphs into odd cycles
• The NP-Completeness of Edge-Coloring
• Further Results on T-Coloring and Frequency Assignment Problems
• Divisibility and \(T\)-span of graphs

This page was built for publication: The complexity of the \(T\)-coloring problem for graphs with small degree