Improvement on Brook theorem for 2K2-free Graphs
Combinatorics
2017-02-06 v1
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 max{maximum degree-1, maximum clique size}. This implies that Borodin & Kostochka Conjecture is true for 2K2-free graphs.
Cite
@article{arxiv.1702.00914,
title = {Improvement on Brook theorem for 2K2-free Graphs},
author = {Medha Dhurandhar},
journal= {arXiv preprint arXiv:1702.00914},
year = {2017}
}
Comments
5 pages, 8 figures