The Grötzsch theorem for the hypergraph of maximal cliques

zbMath0930.05040MaRDI QIDQ1292236

Riste Škrekovski, Bojan Mohar

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 graphmonochromaticclique hypergraphlist colorings

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (34)

Tight bounds on the clique chromatic number ⋮ Clique-coloring of \(K_{3,3}\)-minor free graphs ⋮ Polychromatic colorings of hypergraphs with high balance ⋮ Structural parameterizations of clique coloring ⋮ Clique-coloring claw-free graphs ⋮ Equitable clique-coloring in claw-free graphs with maximum degree at most 4 ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Tight asymptotics of clique‐chromatic numbers of dense random graphs ⋮ The jump of the clique chromatic number of random graphs ⋮ Polychromatic 4-coloring of cubic bipartite plane graphs ⋮ Perfect graphs of arbitrarily large clique-chromatic number ⋮ Clique-transversal sets and clique-coloring in planar graphs ⋮ Clique colourings of geometric graphs ⋮ Subgraph-avoiding coloring of graphs ⋮ Polychromatic colorings of plane graphs ⋮ Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) ⋮ A linear-time algorithm for clique-coloring problem in circular-arc graphs ⋮ 2-list-coloring planar graphs without monochromatic triangles ⋮ Box-respecting colorings of \(n\)-dimensional guillotine-partitions ⋮ Complexity of clique coloring and related problems ⋮ Unnamed Item ⋮ Graphs with large clique-chromatic numbers ⋮ Polychromatic 4-coloring of guillotine subdivisions ⋮ A linear-time algorithm for clique-coloring planar graphs ⋮ List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly ⋮ Polychromatic colorings of bounded degree plane graphs ⋮ Balanced polychromatic 2-coloring of triangulations ⋮ On the complexity of local-equitable coloring of graphs ⋮ Polychromatic colorings of rectangular partitions ⋮ Polychromatic colorings of arbitrary rectangular partitions ⋮ The clique-perfectness and clique-coloring of outer-planar graphs ⋮ Coloring face-hypergraphs of graphs on surfaces ⋮ A note on polychromatic colorings of plane graphs ⋮ A generalization of Grötzsch Theorem on the local-equitable coloring

This page was built for publication: The Grötzsch theorem for the hypergraph of maximal cliques