n-fold L(2, 1)-labelings of Cartesian product of paths and cycles

DOI10.1007/S10878-024-01119-9MaRDI QIDQ6497036

Fei-Huang Chang, Jing-Ho Yan, Unnamed Author, Unnamed Author, David M. T. Kuo

Publication date: 6 May 2024

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
• Pair \(L(2, 1)\)-labelings of infinite graphs
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• Multiple \(L(j,1)\)-labeling of the triangular lattice
• Radio and radial radio numbers of certain sunflower extended graphs
• Radial radio number of hexagonal and its derived networks
• Radio number for the product of a path and a complete graph
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• A survey on labeling graphs with a condition at distance two
• Griggs and Yeh's Conjecture and $L(p,1)$-labelings
• Labelling Graphs with a Condition at Distance 2
• The $L(2,1)$-Labeling Problem on Graphs
• Multilevel Distance Labelings for Paths and Cycles

This page was built for publication: n-fold L(2, 1)-labelings of Cartesian product of paths and cycles