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

DOI10.1016/0166-218X(94)00030-HzbMATH Open0851.05049MaRDI QIDQ1917240

Denise Sakai Troxell

Publication date: 21 November 1996

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

zbMATH Keywords

graph coloring\(T\)-coloringchannel assignment probleminterference graphschool timetable

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• No-hole \((r+1)\)-distant colorings
• 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
• Pair Labellings with Given Distance

Related Items (8)

Extremal problems on consecutive \(L(2,1)\)-labelling ⋮ Unnamed Item ⋮ No-hole \(k\)-tuple \((r+1)\)-distant colorings of odd cycles ⋮ No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs ⋮ Distance-two labellings of Hamming graphs ⋮ Interference patterns in bijective colorings of 2-regular graphs

Recommendations

• No-hole \((r+1)\)-distant colorings 👍 👎
• Distance graphs and \(T\)-coloring 👍 👎
• No-hole 2-distant colorings 👍 👎
• No-hole \(L(2,1)\)-colorings 👍 👎
• No-hole \(k\)-tuple \((r+1)\)-distant colorings of odd cycles 👍 👎
• Minimum Span of No-Hole (r+1)-Distant Colorings 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎

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