THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE
From MaRDI portal
Publication:5016312
DOI10.11568/kjm.2013.21.2.151MaRDI QIDQ5016312
Byeong Moon Kim, Yoomi Rho, Byung Chul Song
Publication date: 13 December 2021
Published in: Korean Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11568/kjm.2013.21.2.151
Related Items
On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths, \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs
Cites Work
- Distance two labelling and direct products of graphs
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete 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
- Labeling Products of Complete Graphs with a Condition at Distance Two
- Griggs and Yeh's Conjecture and $L(p,1)$-labelings
- Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs
- $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
- Labelling Graphs with a Condition at Distance 2
- The L(2,1)-labeling and operations of graphs
- An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs
- On the $\lambda$-Number of $Q_n $ and Related Graphs