On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs

DOI10.1007/s10878-016-0047-3zbMath1369.05083OpenAlexW2468184807MaRDI QIDQ2012895

Pratima Panigrahi, Nibedita Mandal

Publication date: 3 August 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0047-3

zbMATH Keywords

subdivision graph\(L(2, 1)\)-coloringirreducible coloringno-hole coloringspan of a graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items

\(L(2,1)\)-colorings and irreducible no-hole colorings of the direct 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 Cartesian product of trees with paths

Cites Work

• Unnamed Item
• \(L(2,1)\)-labelings of subdivisions of graphs
• Relating path coverings to vertex labellings with a condition at distance two
• No-hole \(L(2,1)\)-colorings
• Distance-two labelings of graphs
• \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
• \(L(2, 1)\)-labelings of the edge-path-replacement of a graph
• \((p,1)\)-total labelling of graphs
• On the \(L(p,1)\)-labelling of graphs
• Labelling Graphs with a Condition at Distance 2
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• On irreducible no‐hole L(2, 1)‐coloring of trees