Full Color Theorems for L(2,1)-Colorings

DOI10.1137/S0895480100378562zbMath1116.05027OpenAlexW1995854302MaRDI QIDQ3440265

Fred S. Roberts, Peter C. Fishburn

Publication date: 22 May 2007

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

Full work available at URL: https://doi.org/10.1137/s0895480100378562

zbMATH Keywords

channel assignment problemsdistance-two coloringsno-hole colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15)

Related Items (15)

Extremal problems on consecutive \(L(2,1)\)-labelling ⋮ An extremal problem on non-full colorable graphs ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Radio graceful Hamming graphs ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs ⋮ On the universality and extremality of graphs with a distance constrained colouring ⋮ No-hole \(L(2,1)\)-colorings ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ On theL(2, 1)-labelling of block graphs ⋮ On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs ⋮ A note on \(L (2, 1)\)-labelling of trees ⋮ On island sequences of labelings with a condition at distance two ⋮ A note on collections of graphs with non-surjective lambda labelings ⋮ A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number ⋮ On irreducible no‐hole L(2, 1)‐coloring of trees

This page was built for publication: Full Color Theorems for L(2,1)-Colorings