On lower bounds for the chromatic number in terms of vertex degree

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In this paper we discuss the existence of lower bounds for the chromatic number of graphs in terms of the average degree or the coloring number of graphs. We obtain a lower bound for the chromatic number of K1,t-free graphs in terms of the maximum degree and show that the bound is tight. For any tree T, we obtain a lower bound for the chromatic number of any K2 ,t-free and T-free graph in terms of its average degree. This answers affirmatively a modified version of Problem 4.3 in [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley, New York, 1995]. More generally, we discuss δ-bounded families of graphs and then we obtain a necessary and sufficient condition for a family of graphs to be a δ-bounded family in terms of its induced bipartite Turn number. Our last bound is in terms of forbidden induced even cycles in graphs; it extends a result in [S.E. Markossian, G.S. Gasparian, B.A. Reed, β-perfect graphs, J. Combin. Theory Ser. B 67 (1996) 111]. © 2011 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Zaker, M. (2011). On lower bounds for the chromatic number in terms of vertex degree. Discrete Mathematics, 311(14), 1365–1370. https://doi.org/10.1016/j.disc.2011.03.025

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free