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

DOI10.1007/S10878-016-0047-3zbMATH Open1369.05083OpenAlexW2468184807MaRDI QIDQ2012895FDOQ2012895

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

Recommendations

• Solutions of some \(L(2, 1)\)-coloring related open problems
• On irreducible no-hole \(L(2, 1)\)-coloring of Cartesian product of trees with paths
• Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph
• \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs
• L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Relating path coverings to vertex labellings with a condition at distance two
• 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 the edge-path-replacement of a graph
• On the \(L(p,1)\)-labelling of graphs
• \(L(2,1)\)-labelings of subdivisions of graphs
• Distance-two labelings of graphs
• \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs

Cited In (5)

• On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths
• L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs
• \(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
• Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph

This page was built for publication: On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012895)