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.
Original language | English (US) |
---|---|
Pages (from-to) | 187-193 |
Number of pages | 7 |
Journal | Discrete Mathematics |
Volume | 150 |
Issue number | 1-3 |
DOIs | |
State | Published - Apr 6 1996 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics