Upper bounds on the odd graceful chromatic number of graphs

Muhammad Afifurrahman, Fawwaz Fakhrurrozi Hadiputra

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$…