Applications of hypergraph coloring to coloring graphs not inducing certain trees (Q1916109)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Applications of hypergraph coloring to coloring graphs not inducing certain trees |
scientific article; zbMATH DE number 895999
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Applications of hypergraph coloring to coloring graphs not inducing certain trees |
scientific article; zbMATH DE number 895999 |
Statements
Applications of hypergraph coloring to coloring graphs not inducing certain trees (English)
0 references
1 September 1996
0 references
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.
0 references
coloring
0 references
hypergraphs
0 references
chromatic number
0 references
trees
0 references
open problems
0 references
