Upper bounds on the odd graceful chromatic number of graphs
Muhammad Afifurrahman, Fawwaz Fakhrurrozi Hadiputra
Published: 2025/8/25
Abstract
We obtain several new upper bounds of the odd graceful chromatic number of a graph $G$, which must be bipartite. Some of our bounds depend only on the number of the vertices of $G$ or the chromatic number of some graphs related to the bipartition of $G$.