No-hole \(k\)-tuple \((r+1)\)-distant colorings of odd cycles

DOI10.1016/0166-218X(95)00108-4zbMath0851.05050OpenAlexW2008350443MaRDI QIDQ1917241

David R. Guichard

Publication date: 21 November 1996

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

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00108-4

Mathematics Subject Classification ID

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

Cites Work

• List \(T\)-colorings of graphs
• No-hole \(k\)-tuple \((r+1)\)-distant colorings
• Pair Labellings with Given Distance
• The fractional chromatic number of mycielski's graphs

Related Items (2)

No-hole \(k\)-tuple \((r+1)\)-distant colorings ⋮ Interference patterns in bijective colorings of 2-regular graphs

This page was built for publication: No-hole \(k\)-tuple \((r+1)\)-distant colorings of odd cycles