Applications of hypergraph coloring to coloring graphs not inducing certain trees
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.
scientific article; zbMATH DE number 895999
scientific article