Irreducible no-hole L(2, 1)-coloring of edge-multiplicity-paths-replacement graph
From MaRDI portal
Publication:1708400
Recommendations
- On irreducible no-hole \(L(2, 1)\)-coloring of Cartesian product of trees with paths
- On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
- Solutions of some \(L(2, 1)\)-coloring related open problems
- scientific article; zbMATH DE number 6712803
- L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs
Cites work
- Distance-two labelings of graphs
- Irreducibility of \(L(2,1)\)-colorings and the inh-colorability of unicyclic and hex graphs
- Labelling Graphs with a Condition at Distance 2
- No-hole \(L(2,1)\)-colorings
- On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
- On irreducible no‐hole L(2, 1)‐coloring of trees
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- On the irreducible no-hole \(L(2,1)\) coloring of bipartite graphs and Cartesian products
- \((p,1)\)-total labelling of graphs
- \(L(2, 1)\)-edge-labelings of the edge-path-replacement of a graph
- \(L(2,1)\)-labelings of subdivisions of graphs
- \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph
- \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
Cited in
(4)- \(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
- On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
- \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph
This page was built for publication: Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708400)
