Distance graphs and the \(T\)-coloring problem
From MaRDI portal
Publication:1297406
DOI10.1016/S0012-365X(98)00199-XzbMath0932.05030MaRDI QIDQ1297406
Publication date: 27 February 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)
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