Upper bounds on the odd graceful chromatic number of graphs
arXiv:2508.17799
Abstract
We obtain several new upper bounds of the odd graceful chromatic number of a graph , which must be bipartite. Some of our bounds depend only on the number of the vertices of or the chromatic number of some graphs related to the bipartition of .
23 pages, 3 figures