Applications of hypergraph coloring to coloring graphs not inducing certain trees

10Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

We present a simple result on coloring hypergraphs and use it to obtain bounds on the chromatic number of graphs which do not induce certain trees.

Cite

CITATION STYLE

APA

Kierstead, H. A., & Rodl, V. (1996). Applications of hypergraph coloring to coloring graphs not inducing certain trees. Discrete Mathematics, 150(1–3), 187–193. https://doi.org/10.1016/0012-365X(95)00187-2

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