On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
type: Item
instance of: scholarly article
title: On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
zbMATH Open document ID: 1369.05083
author: Nibedita Mandal
author: Pratima Panigrahi
published in: Journal of Combinatorial Optimization
publication date: 2017-08-03T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6756031
zbMATH Keywords: \(L(2, 1)\)-coloring
zbMATH Keywords: no-hole coloring
zbMATH Keywords: irreducible coloring
zbMATH Keywords: span of a graph
zbMATH Keywords: subdivision graph
MaRDI profile type: Publication
full work available at URL: s10878-016-0047-3
OpenAlex ID: W2468184807
cites work: \(L(2,1)\)-labelings of subdivisions of graphs
cites work: Distance-two labelings of graphs
cites work: No-hole \(L(2,1)\)-colorings
cites work: Relating path coverings to vertex labellings with a condition at distance two
cites work: On the \(L(p,1)\)-labelling of graphs
cites work: Labelling Graphs with a Condition at Distance 2
cites work: \((p,1)\)-total labelling of graphs
cites work: \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
cites work: Q5488333
cites work: On irreducible no‐hole L(2, 1)‐coloring of trees
cites work: \(L(2, 1)\)-labelings of the edge-path-replacement of a graph
cites work: On the $\lambda$-Number of $Q_n $ and Related Graphs
DOI: 10.1007/S10878-016-0047-3
description: scientific article; zbMATH DE number 6756031