Radius three trees in graphs with large chromatic number

A class $\Gamma$ of graphs is $\chi$-bounded if there exists a function $f$ such that $\chi \left(G\right) \leq f \left(\omega \left(G\right) \right)$ for all graphs $G \in \Gamma$, where $\chi$ denotes chromatic number and $\omega$ denotes clique number. Gyarfas and Sumner independently conjectured...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on discrete mathematics 2004-01, Vol.17 (4), p.571-581
Hauptverfasser:	KIERSTEAD, H. A, YINGXIAN ZHU
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied mathematics Combinatorics Combinatorics. Ordered structures Exact sciences and technology Graph theory Graphs Mathematics Neighborhoods Sciences and techniques of general use
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!