A contribution to the chromatic theory of uniform hypergraphs
From MaRDI portal
Publication:1896647
DOI10.1007/BF03322239zbMath0831.05029MaRDI QIDQ1896647
Publication date: 18 October 1995
Published in: Results in Mathematics (Search for Journal in Brave)
Related Items
Bounds to the chromatic polynomial of a graph ⋮ An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three
Cites Work