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

DOI10.1080/09728600.2022.2084355MaRDI QIDQ5097782zbMATH OpenOpenAlexFDO

Authors Nibedita Mandal, Pratima Panigrahi

Publication date 1 September 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

\(L(2,1)\)-coloringirreducible coloringlexicographic product of graphsno-hole coloringspan of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• \(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
• On the irreducible no-hole L(2,1) coloring of bipartite graphs and Cartesian products
• On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths
• Nonrepetitive colorings of lexicographic product of graphs
• On the irreducible no-hole L(h,k) coloring of graphs
• Total colorings of certain classes of lexicographic product graphs
• On indicated coloring of lexicographic product of graphs
• No-hole \(L(2,1)\)-colorings
• scientific article; zbMATH DE number 5574977

Cites work

• \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs
• \(L(2,1)\)-labelings on the composition of \(n\) graphs
• Distance two labeling of the composition of graphs
• Graph labeling and radio channel assignment
• Hamiltonicity and circular distance two labellings
• Handbook of product graphs
• Holes in L(2,1)-coloring on certain classes of graphs
• scientific article; zbMATH DE number 1185300 (Why is no real title available?)
• Irreducibility of L(2,1)-colorings and the inh-colorability of unicyclic and hex graphs
• Labelling Graphs with a Condition at Distance 2
• No-hole \(L(2,1)\)-colorings
• On \(L(d,1)\)-labelings of 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 subdivision of graphs
• On irreducible no‐hole L(2, 1)‐coloring of trees
• On the \(L(p,1)\)-labelling of graphs
• On the irreducible no-hole L(2,1) coloring of bipartite graphs and Cartesian products
• Relating path coverings to vertex labellings with a condition at distance two
• The $L(2,1)$-Labeling Problem on Graphs
• The L(2,1)-labeling and operations of graphs

Cited in

(6)

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

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

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