On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths
From MaRDI portal
Publication:4956226
DOI10.1016/j.akcej.2019.12.023zbMath1468.05080OpenAlexW3048075583MaRDI QIDQ4956226
Pratima Panigrahi, Nibedita Mandal
Publication date: 1 September 2021
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2019.12.023
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Solutions of some \(L(2, 1)\)-coloring related open problems
- The minimum span of \(L(2,1)\)-labelings of generalized flowers
- Relating path coverings to vertex labellings with a condition at distance two
- No-hole \(L(2,1)\)-colorings
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
- \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
- On Irreducible No-hole L(2, 1)-labelings of Hypercubes and Triangular Lattices
- Labelling Graphs with a Condition at Distance 2
- Graph labeling and radio channel assignment
- The L(2,1)-labeling and operations of graphs
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE
- On irreducible no‐hole L(2, 1)‐coloring of trees
This page was built for publication: On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths
