2-Distance chromatic number of some graph products

DOI10.1142/S1793830920500214zbMath1456.05062MaRDI QIDQ5854751

Ghazale Ghazi, M. Tavakoli, Freydoon Rahbarnia

Publication date: 18 March 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

graph products2-distance coloring2-distance chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Star chromatic number of some graph products ⋮ Further results on 2-distance coloring of graphs ⋮ On d-distance equitable chromatic number of some graphs

Cites Work

• Unnamed Item
• An improved bound on 2-distance coloring plane graphs with girth 5
• Coloring the square of the Cartesian product of two cycles
• The hierarchical product of graphs
• On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
• The generalized hierarchical product 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 survey on the distance-colouring of graphs
• A bound on the chromatic number of the square of a planar graph
• A new graph product and its spectrum
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• Coloring the square of a planar graph

This page was built for publication: 2-Distance chromatic number of some graph products