A Note on Coloring Vertex-Transitive Graphs release_cs3nkszcandx5jpkcb4r6sdhs4

by Daniel W. Cranston, Landon Rabern

Published in Electronic Journal of Combinatorics by The Electronic Journal of Combinatorics.

2015  

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  article-journal
Stage   published
Date   2015-04-14
Journal Metadata
Open Access Publication
In DOAJ
In ISSN ROAD
In Keepers Registry
ISSN-L:  1077-8926
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 513e1438-fa21-4754-b365-2f67d51937d6
API URL: JSON