Tight Chromatic Number for a class of Graphs with two forbidden subgraphs
Combinatorics
2016-05-11 v1
Abstract
Although the chromatic number of a graph is not known in general, attempts have been made to find good bounds for the number. Here we prove that for a graph G with two forbidden subgraphs and maximum degree less than or equal to 2{\omega} - 3, {\chi} equals its maximum clique size. We also give examples to show that the condition is necessary.
Keywords
Cite
@article{arxiv.1605.02866,
title = {Tight Chromatic Number for a class of Graphs with two forbidden subgraphs},
author = {Medha Dhurandhar},
journal= {arXiv preprint arXiv:1605.02866},
year = {2016}
}
Comments
3 pages