Improvement on Brook theorem for 2K2-free Graphs
Abstract
Here we prove that for a 2K2-free graph G with maximum degree greater than or equal to 5, the chromatic number is less than or equal to maxmaximum degree-1, maximum clique size. This implies that Borodin & Kostochka Conjecture is true for 2K2-free graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.