Trees in greedy colorings of hypergraphs
type: Item
instance of: scholarly article
title: Trees in greedy colorings of hypergraphs
zbMATH Open document ID: 1225.05097
author: András Gyárfás
author: Jeno Lehel
published in: Discrete Mathematics
publication date: 2011-01-07T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5833555
zbMATH Keywords: greedy coloring
zbMATH Keywords: chromatic number
zbMATH Keywords: subtrees in graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2010.10.017
OpenAlex ID: W2010491244
cites work: Coloring H-free hypergraphs
cites work: Induced subtrees in graphs of large chromatic number
cites work: A note on embedding hypertrees
cites work: Q4276003
cites work: Greedy colorings of uniform hypergraphs
cites work: Q3932997
DOI: 10.1016/J.DISC.2010.10.017
description: scientific article; zbMATH DE number 5833555