The Grötzsch theorem for the hypergraph of maximal cliques

zbMath0930.05040MaRDI QIDQ1292236

Bojan Mohar, Riste Škrekovski

Publication date: 20 June 1999

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/120090

zbMATH Keywords

planar graph; monochromatic; clique hypergraph; list colorings

Mathematics Subject Classification ID

05C65: Hypergraphs

05C15: Coloring of graphs and hypergraphs

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)