A coloring problem related to the Erdős, Faber, Lovasz conjecture
From MaRDI portal
Publication:1117945
DOI10.1016/0095-8956(90)90087-GzbMath0668.05029WikidataQ56390945 ScholiaQ56390945MaRDI QIDQ1117945
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
05C15: Coloring of graphs and hypergraphs
Related Items