2-distance colorings of some direct products of paths and cycles
From MaRDI portal
Publication:2346336
Recommendations
Cites work
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
- \(L(2,1)\)-labeling of direct product of paths and cycles
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- \(L(j, k)\)-number of direct product of path and cycle
- A bound on the chromatic number of the square of a planar graph
- A note on the chromatic number of the square of the Cartesian product of two cycles
- A survey on labeling graphs with a condition at distance two
- A survey on the distance-colouring of graphs
- Coloring the square of a planar graph
- Coloring the square of the Cartesian product of two cycles
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
- scientific article; zbMATH DE number 3968609 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 3265667 (Why is no real title available?)
- scientific article; zbMATH DE number 3308991 (Why is no real title available?)
- Labelling Graphs with a Condition at Distance 2
- New \(L(j,k)\)-labelings for direct products of complete graphs
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- The $L(2,1)$-Labeling Problem on Graphs
Cited in
(5)
This page was built for publication: 2-distance colorings of some direct products of paths and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346336)