arXiv Analytics

Sign in

arXiv:1404.1698 [math.CO]AbstractReferencesReviewsResources

The Sum and Product of Chromatic Numbers of Graphs and their Line Graphs

Sunny Joseph Kalayathankal, Susanth C

Published 2014-04-07, updated 2014-09-20Version 2

A Nordhaus-Gaddum-type result is a (tight) lower or upper bound on the sum or product of a parameter of a graph and its complement. In this paper some variations are considered. First, recall their theorem, which gives bounds on the sum and the product of the chromatic number of a graph with that of its complement. In this paper, we provide a new characterization of the other class of graphs.

Comments: 8 Pages
Categories: math.CO
Subjects: 05C15
Related articles: Most relevant | Search more
arXiv:1212.3983 [math.CO] (Published 2012-12-17)
An Upper bound on the chromatic number of circle graphs without $K_4$
arXiv:math/0606632 [math.CO] (Published 2006-06-25)
New upper bounds on the chromatic number of a graph
arXiv:math/0310339 [math.CO] (Published 2003-10-21)
Box complexes, neighborhood complexes, and the chromatic number

Links

Toolbox