BibTeX
CSL-JSON
MLA
Harvard
A Note on Coloring Vertex-Transitive Graphs
release_cs3nkszcandx5jpkcb4r6sdhs4
by
Daniel W. Cranston, Landon Rabern
Abstract
We prove bounds on the chromatic number $\chi$ of a vertex-transitive graph in terms of its clique number $\omega$ and maximum degree $\Delta$. We conjecture that every vertex-transitive graph satisfies $\chi \le \max \{\omega, \left\lceil\frac{5\Delta + 3}{6}\right\rceil\}$, and we prove results supporting this conjecture. Finally, for vertex-transitive graphs with $\Delta \ge 13$ we prove the Borodin–Kostochka conjecture, i.e., $\chi\le\max\{\omega,\Delta-1\}$.
In application/xml+jats
format
Archived Files and Locations
application/pdf 249.7 kB
file_yvfodf3z6vhjlb6m5mwjc7rlay
|
www.people.vcu.edu (web) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
Type
Stage
Date 2015-04-14
article-journal
Stage
published
Date 2015-04-14
DOI
10.37236/4626
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links
oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar