Upper bounds on the odd graceful chromatic number of graphs
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.