No-hole \((r+1)\)-distant colorings

DOI10.1016/0012-365X(93)90125-DzbMath0796.05042MaRDI QIDQ688267

Denise Sakai, Chi Wang

Publication date: 15 September 1994

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

zbMATH Keywords

hamiltonian graphsdistance colorings

Mathematics Subject Classification ID

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

Related Items (13)

Extremal problems on consecutive \(L(2,1)\)-labelling ⋮ Relating path coverings to vertex labellings with a condition at distance two ⋮ No-hole \(k\)-tuple \((r+1)\)-distant colorings ⋮ No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups ⋮ No-hole \(L(2,1)\)-colorings ⋮ \(T\)-colorings of graphs: recent results and open problems ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ On irreducible no‐hole L(2, 1)‐coloring of trees ⋮ Disproofs of two conjectures on no hole anti-\(n\)-labeling of graphs ⋮ Anti-\(k\)-labeling of graphs ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs ⋮ Distance-two labellings of Hamming graphs ⋮ No-hole 2-distant colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Neighbourhood unions and Hamiltonian properties in graphs
• \(T\)-colorings of graphs: recent results and open problems
• List \(T\)-colorings of graphs
• No-hole 2-distant colorings
• Parallel concepts in graph theory
• On the compatibility between a graph and a simple order
• Note on Hamilton Circuits
• Pair Labellings with Given Distance
• Two-Processor Scheduling with Start-Times and Deadlines

This page was built for publication: No-hole \((r+1)\)-distant colorings