2-distance chromatic number of some graph products
From MaRDI portal
Publication:5854751
DOI10.1142/S1793830920500214zbMATH Open1456.05062MaRDI QIDQ5854751FDOQ5854751
Ghazale Ghazi, M. Tavakoli, F. Rahbarnia
Publication date: 18 March 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Recommendations
Cites Work
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- The hierarchical product of graphs
- The generalized hierarchical product of graphs
- A new graph product and its spectrum
- A survey on the distance-colouring of graphs
- 2-distance coloring of planar graphs with girth 5
- An optimal square coloring of planar graphs
- Coloring squares of planar graphs with girth six
- A bound on the chromatic number of the square of a planar graph
- An improved bound on 2-distance coloring plane graphs with girth 5
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- Coloring the square of a planar graph
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- Coloring the square of the Cartesian product of two cycles
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: 2-distance chromatic number of some graph products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5854751)