Upper bounds on the odd graceful chromatic number of graphs

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

Publication Details

Journal
ArXiv.org
Published
2025-08-25
Primary Topic
Geochemistry and Geologic Mapping
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Upper bounds on the odd graceful chromatic number of graphs

ArXiv.org
Geochemistry and Geologic Mapping
article

Upper bounds on the odd graceful chromatic number of graphs

article en

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

ArXiv.org
Openalex Percentile: Top 64%
Geochemistry and Geologic Mapping
Open Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Upper bounds on the odd graceful chromatic number of graphs · ArXiv.org (2025) | TGRS Research Map | TGRS