No-hole 2-distant colorings

DOI10.1016/0895-7177(93)90265-ZzbMath0786.05036OpenAlexW2030545207MaRDI QIDQ1310246

Fred S. Roberts

Publication date: 2 January 1994

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(93)90265-z

zbMATH Keywords

coloringchannel assignment problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Extremal problems on consecutive \(L(2,1)\)-labelling ⋮ 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 ⋮ No-hole \((r+1)\)-distant colorings ⋮ On irreducible no‐hole L(2, 1)‐coloring of trees ⋮ Disproofs of two conjectures on no hole anti-\(n\)-labeling of graphs ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs ⋮ Distance-two labellings of Hamming graphs

Cites Work

• No-hole \((r+1)\)-distant colorings
• \(T\)-colorings of graphs: recent results and open problems
• List \(T\)-colorings of graphs
• Parallel concepts in graph theory
• On the compatibility between a graph and a simple order
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: No-hole 2-distant colorings