Induced subtrees in graphs of large chromatic number

Research output: Contribution to journalArticle

39 Citations (Scopus)


Our paper proves special cases of the following conjecture: for any fixed tree T there exists a natural number f = f (T) to that every triangle-free graph of chromaticnumber f(T) contains T as an induced subgraph. The main result concerns the case when T has radius two.

Original languageEnglish
Pages (from-to)235-244
Number of pages10
JournalDiscrete Mathematics
Issue number3
Publication statusPublished - 1980

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Induced subtrees in graphs of large chromatic number'. Together they form a unique fingerprint.

  • Cite this