An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three

DOI10.1007/BF03322101zbMath0933.05105OpenAlexW2076811511MaRDI QIDQ1306277

Klaus Dohmen

Publication date: 4 October 1999

Published in: Results in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03322101

zbMATH Keywords

cyclescolouringuniform hypergraphchromatic numberboundchromatic polynomial

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• A contribution to the chromatic theory of uniform hypergraphs

This page was built for publication: An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three