On d-distance equitable chromatic number of some graphs

DOI10.1142/S1793557122500759zbMath1487.05082OpenAlexW3174532335MaRDI QIDQ5865976

Devadas Nayak C, Nagarjun Prabhu, Pradeep G. Bhat, Sabitha D'Souza

Publication date: 10 June 2022

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557122500759

zbMATH Keywords

equitable coloringdistance coloringdistance equitable coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
• Connectivity of strong products of graphs
• The \(k\)-distance chromatic number of trees and cycles
• 2-distance colorings of some direct products of paths and cycles
• On the corona of two graphs
• Distance Coloring
• 2-Distance coloring of planar graph
• 2-Distance chromatic number of some graph products

This page was built for publication: On d-distance equitable chromatic number of some graphs