Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph

DOI10.7151/DMGT.2030zbMath1383.05110OpenAlexW2783518776MaRDI QIDQ1708400

Pratima Panigrahi, Nibedita Mandal

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

zbMATH Keywords

subdivision graphirreducible coloringno-hole coloring\(L(2,1)\)-coloringedge-multiplicity-paths-replacement graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• \(L(2,1)\)-labelings of subdivisions of graphs
• No-hole \(L(2,1)\)-colorings
• 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
• \((p,1)\)-total labelling of graphs
• Labelling Graphs with a Condition at Distance 2
• L(2,1)-Edge-Labelings of the Edge-Path-Replacement of a Graph
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• On irreducible no‐hole L(2, 1)‐coloring of trees
• \(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