Irreducible no-hole L(2, 1)-coloring of edge-multiplicity-paths-replacement graph
From MaRDI portal
Publication:1708400
DOI10.7151/DMGT.2030zbMATH Open1383.05110OpenAlexW2783518776MaRDI QIDQ1708400FDOQ1708400
Authors: Nibedita Mandal, Pratima Panigrahi 
Publication date: 23 March 2018
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2030
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
- L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs
subdivision graphirreducible coloringno-hole coloring\(L(2,1)\)-coloringedge-multiplicity-paths-replacement graph
Cites Work
- No-hole \(L(2,1)\)-colorings
- Labelling Graphs with a Condition at Distance 2
- On irreducible no‐hole L(2, 1)‐coloring of trees
- Irreducibility of \(L(2,1)\)-colorings and the inh-colorability of unicyclic and hex graphs
- \((p,1)\)-total labelling of graphs
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- \(L(2,1)\)-labelings of subdivisions of graphs
- Distance-two labelings of graphs
- On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
- \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
- On the irreducible no-hole \(L(2,1)\) coloring of bipartite graphs and Cartesian products
- L(2,1)-Edge-Labelings of the Edge-Path-Replacement of a Graph
- \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph
Cited In (1)
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)
