Radius two trees specify χ‐bounded classes

Henry Kierstead, S. G. Penrice

Research output: Contribution to journalArticle

39 Scopus citations

Abstract

A class of graphs χ is said to be χ‐bounded, with χ‐binding function f, if for all G ϵ Γ, χ (G) ≦ f (ω(G)), where χ(G) is the chromatic number of G and ω(G) is the clique number of G. It has been conjectured that for every tree T, the class of graphs that do not induce T is χ‐bounded. We show that this is true in the case where T is a tree of radius two.

Original languageEnglish (US)
Pages (from-to)119-129
Number of pages11
JournalJournal of Graph Theory
Volume18
Issue number2
DOIs
StatePublished - 1994

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'Radius two trees specify χ‐bounded classes'. Together they form a unique fingerprint.

  • Cite this