Validity of Borodin & Kostochka Conjecture for a Class of Graphs
Combinatorics
2017-05-10 v1
Abstract
Borodin & Kostochka conjectured that if maximum degree of a graph is greater than or equal to 9, then the chromatic number of the graph is less than or equal to maximum of {\omega} and maximum degree minus 1. Here we prove that this Conjecture is true for {P3 UNION K1}-free graphs and {K2 UNION complement of K2}-free graphs.
Keywords
Cite
@article{arxiv.1705.03195,
title = {Validity of Borodin & Kostochka Conjecture for a Class of Graphs},
author = {Medha Dhurandhar},
journal= {arXiv preprint arXiv:1705.03195},
year = {2017}
}
Comments
3 pages