Distance graphs and the \(T\)-coloring problem

DOI10.1016/S0012-365X(98)00199-XzbMath0932.05030OpenAlexW2003884459MaRDI QIDQ1297406

Albert Gräf

Publication date: 27 February 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00199-x

zbMATH Keywords

distance graphs\(T\)-colouring problem

Mathematics Subject Classification ID

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

Related Items

The complexity of the \(T\)-coloring problem for graphs with small degree ⋮ A polynomial algorithm for finding \(T\)-span of generalized cacti

Cites Work

• Colouring the real line
• \(T\)-colorings of graphs: recent results and open problems
• \(T\)-colorings of graphs
• Sequences of integers with missing differences
• A rainbow about \(T\)-colorings for complete graphs
• Two-Processor Scheduling with Start-Times and Deadlines
• B2-Folgen und verwandte Zahlenfolgen.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item