scientific article; zbMATH DE number 5054150

zbMath1123.05040MaRDI QIDQ5488333

John Villalpando, Renu C. Laskar

Publication date: 14 September 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

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)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs ⋮ L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs ⋮ Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph ⋮ On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs ⋮ On irreducible no‐hole L(2, 1)‐coloring of trees ⋮ On Irreducible No-hole L(2, 1)-labelings of Hypercubes and Triangular Lattices ⋮ On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths

This page was built for publication: