The Grötzsch theorem for the hypergraph of maximal cliques
zbMATH Open0930.05040MaRDI QIDQ1292236FDOQ1292236
Authors: 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)
Cited In (34)
- Tight bounds on the clique chromatic number
- Clique-coloring of \(K_{3,3}\)-minor free graphs
- Box-respecting colorings of \(n\)-dimensional guillotine-partitions
- The clique-perfectness and clique-coloring of outer-planar graphs
- Clique-transversal sets and clique-coloring in planar graphs
- A linear-time algorithm for clique-coloring planar graphs
- List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly
- Polychromatic colorings of arbitrary rectangular partitions
- Polychromatic colorings of plane graphs
- Tight asymptotics of clique‐chromatic numbers of dense random graphs
- Perfect graphs of arbitrarily large clique-chromatic number
- Polychromatic 4-coloring of guillotine subdivisions
- Polychromatic colorings of rectangular partitions
- Clique-coloring claw-free graphs
- A note on polychromatic colorings of plane graphs
- Coloring face-hypergraphs of graphs on surfaces
- Facially-constrained colorings of plane graphs: a survey
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4
- Complexity of clique coloring and related problems
- Polychromatic colorings of bounded degree plane graphs
- Polychromatic 4-coloring of cubic bipartite plane graphs
- Balanced polychromatic 2-coloring of triangulations
- Title not available (Why is that?)
- Polychromatic colorings of hypergraphs with high balance
- The jump of the clique chromatic number of random graphs
- Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\)
- Structural parameterizations of clique coloring
- On the complexity of local-equitable coloring of graphs
- A linear-time algorithm for clique-coloring problem in circular-arc graphs
- Clique colourings of geometric graphs
- A generalization of Grötzsch Theorem on the local-equitable coloring
- 2-list-coloring planar graphs without monochromatic triangles
- Graphs with large clique-chromatic numbers
- Subgraph-avoiding coloring of graphs
This page was built for publication: The Grötzsch theorem for the hypergraph of maximal cliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292236)
