Ore's conjecture on color-critical graphs is almost true
Under an Elsevier user license
open archive
Keywords
Graph coloring
k-critical graphs
Sparse graphs
Cited by (0)
- 1
Research of this author is supported in part by NSF grants DMS-0965587 and DMS-1266016 and by grants 12-01-00448 and 12-01-00631 of the Russian Foundation for Basic Research.
- 2
Research of this author is partially supported by the Arnold O. Beckman Research Award of the University of Illinois at Urbana–Champaign and from National Science Foundation grant DMS 08-38434 “EMSW21-MCTP: Research Experience for Graduate Students.”
Published by Elsevier Inc.