L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs

DOI10.1080/09728600.2022.2084355zbMath1493.05108OpenAlexW4282934766MaRDI QIDQ5097782

Nibedita Mandal, Pratima Panigrahi

Publication date: 1 September 2022

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09728600.2022.2084355

zbMATH Keywords

irreducible coloringno-hole coloringspan of a graphlexicographic product of graphs\(L(2,1)\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Holes in \(L(2,1)\)-coloring on certain classes of graphs
• \(L(2,1)\)-labelings on the composition of \(n\) graphs
• Relating path coverings to vertex labellings with a condition at distance two
• No-hole \(L(2,1)\)-colorings
• On \(L(d,1)\)-labelings of graphs
• On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
• \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs
• On the \(L(p,1)\)-labelling of graphs
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• The L(2,1)-labeling and operations of graphs
• The $L(2,1)$-Labeling Problem on Graphs
• On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths
• On irreducible no‐hole L(2, 1)‐coloring of trees
• Hamiltonicity and circular distance two labellings

This page was built for publication: L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs