Holes in \(L(2,1)\)-coloring on certain classes of graphs

zbMath1210.05033MaRDI QIDQ624160

Gilbert Eyabi, Renu C. Laskar

Publication date: 8 February 2011

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

holes\(L(2,1)\)-coloringschannel assignment problemsfull-colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (5)

Solutions of some \(L(2, 1)\)-coloring related open problems ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs ⋮ L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs ⋮ Infinitely many trees with maximum number of holes zero, one, and two ⋮ Some classes of trees with maximum number of holes two

This page was built for publication: Holes in \(L(2,1)\)-coloring on certain classes of graphs