Irreducibility of L(2,1)-colorings and the inh-colorability of unicyclic and hex graphs
From MaRDI portal
Publication:5488333
zbMATH Open1123.05040MaRDI QIDQ5488333FDOQ5488333
Authors: John Villalpando, Renu C. Laskar 
Publication date: 14 September 2006
Recommendations
- Solutions of some \(L(2, 1)\)-coloring related open problems
- On irreducible no-hole \(L(2, 1)\)-coloring of Cartesian product of trees with paths
- \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs
- scientific article; zbMATH DE number 6712803
- On the graphs whose \(L(2,1)\)-span is the same as their inh \(L(2,1)\)-span
Cited In (10)
- On irreducible no-hole \(L(2, 1)\)-labelings of hypercubes and triangular lattices
- On irreducible no‐hole L(2, 1)‐coloring of trees
- Solutions of some \(L(2, 1)\)-coloring related open problems
- L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs
- The cardinality of the image of \(L(2,1)\)-colorings and irreducible \(L (2, 1)\)-colorings
- \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs
- On irreducible no-hole \(L(2, 1)\)-coloring of Cartesian product of trees with paths
- \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian 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
This page was built for publication: Irreducibility of \(L(2,1)\)-colorings and the inh-colorability of unicyclic and hex graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488333)
