Upper bounds on the odd graceful chromatic number of graphs
Combinatorics
2025-09-03 v2
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 .
Cite
@article{arxiv.2508.17799,
title = {Upper bounds on the odd graceful chromatic number of graphs},
author = {Muhammad Afifurrahman and Fawwaz Fakhrurrozi Hadiputra},
journal= {arXiv preprint arXiv:2508.17799},
year = {2025}
}
Comments
23 pages, 3 figures