Applications of hypergraph coloring to coloring graphs not inducing certain trees

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

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 languageEnglish (US)
Pages (from-to)187-193
Number of pages7
JournalDiscrete Mathematics
Volume150
Issue number1-3
DOIs
StatePublished - Apr 6 1996

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Applications of hypergraph coloring to coloring graphs not inducing certain trees'. Together they form a unique fingerprint.

Cite this