Applications of hypergraph coloring to coloring graphs not inducing certain trees
type: Item
instance of: scholarly article
title: Applications of hypergraph coloring to coloring graphs not inducing certain trees
zbMATH Open document ID: 0856.05039
DOI: 10.1016/0012-365X(95)00187-2
published in: Discrete Mathematics
publication date: 1996-09-01T00:00:00Z
review text: The authors 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. Several open problems are discussed.
reviewed by: Klaus Dohmen
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 895999
zbMATH Keywords: coloring
zbMATH Keywords: hypergraphs
zbMATH Keywords: chromatic number
zbMATH Keywords: trees
zbMATH Keywords: open problems
author: H. A. Kierstead
author: Vojtěch Rödl
MaRDI profile type: Publication
cites work: Q3347930
cites work: On the structure of set-mappings
cites work: On chromatic number of graphs and set-systems
cites work: Q4063176
cites work: Q5749319
cites work: Induced subtrees in graphs of large chromatic number
cites work: Radius two trees specify χ‐bounded classes
cites work: Colorful induced subgraphs
cites work: Q3679213
cites work: Q3932997
full work available at URL: 0012-365x(95)00187-2
OpenAlex ID: W2071534536
description: scientific article; zbMATH DE number 895999