An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three
From MaRDI portal
Publication:1306277
DOI10.1007/BF03322101zbMath0933.05105OpenAlexW2076811511MaRDI QIDQ1306277
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
Cites Work