Upper bounds on the odd graceful chromatic number of graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912565698756608 |
|---|---|
| author | Afifurrahman, Muhammad Hadiputra, Fawwaz Fakhrurrozi |
| author_facet | Afifurrahman, Muhammad Hadiputra, Fawwaz Fakhrurrozi |
| contents | 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$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_17799 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Upper bounds on the odd graceful chromatic number of graphs Afifurrahman, Muhammad Hadiputra, Fawwaz Fakhrurrozi Combinatorics 05C78 (primary), 05C15 (secondary) 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$. |
| title | Upper bounds on the odd graceful chromatic number of graphs |
| topic | Combinatorics 05C78 (primary), 05C15 (secondary) |
| url | https://arxiv.org/abs/2508.17799 |