Solutions of some \(L(2, 1)\)-coloring related open problems

DOI10.7151/dmgt.1858zbMath1338.05089OpenAlexW2317229073MaRDI QIDQ274676

Nibedita Mandal, Pratima Panigrahi

Publication date: 25 April 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1858

zbMATH Keywords

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

\(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs ⋮ Infinitely many trees with maximum number of holes zero, one, and two ⋮ Some classes of trees with maximum number of holes two ⋮ On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths

Cites Work

• Unnamed Item
• Unnamed Item
• A note on \(L (2, 1)\)-labelling of trees
• Holes in \(L(2,1)\)-coloring on certain classes of graphs
• Relating path coverings to vertex labellings with a condition at distance two
• No-hole \(L(2,1)\)-colorings
• The \(L(2,1)\)-labelling of trees
• Labelling Graphs with a Condition at Distance 2
• On irreducible no‐hole L(2, 1)‐coloring of trees

This page was built for publication: Solutions of some \(L(2, 1)\)-coloring related open problems