Geodesic
The Grötzsch theorem for the hypergraph of maximal cliques
The electronic journal of combinatorics, Tome 6 (1999)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
In this paper, we extend the Grötzsch Theorem by proving that the clique hypergraph ${\cal H}(G)$ of every planar graph is 3-colorable. We also extend this result to list colorings by proving that ${\cal H}(G)$ is 4-choosable for every planar or projective planar graph $G$. Finally, 4-choosability of ${\cal H}(G)$ is established for the class of locally planar graphs on arbitrary surfaces.
DOI : 10.37236/1458
Classification : 05C15, 05C65, 05C69
Mots-clés : clique hypergraph, monochromatic, planar graph, list colorings 
Bojan Mohar; Riste Skrekovski. The Grötzsch theorem for the hypergraph of maximal cliques. The electronic journal of combinatorics, Tome 6 (1999). doi: 10.37236/1458
@article{10_37236_1458,
     author = {Bojan Mohar and Riste Skrekovski},
     title = {The {Gr\"otzsch} theorem for the hypergraph of maximal cliques},
     journal = {The electronic journal of combinatorics},
     year = {1999},
     volume = {6},
     doi = {10.37236/1458},
     zbl = {0930.05040},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1458/}
}
TY  - JOUR
AU  - Bojan Mohar
AU  - Riste Skrekovski
TI  - The Grötzsch theorem for the hypergraph of maximal cliques
JO  - The electronic journal of combinatorics
PY  - 1999
VL  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1458/
DO  - 10.37236/1458
ID  - 10_37236_1458
ER  - 
%0 Journal Article
%A Bojan Mohar
%A Riste Skrekovski
%T The Grötzsch theorem for the hypergraph of maximal cliques
%J The electronic journal of combinatorics
%D 1999
%V 6
%U http://geodesic.mathdoc.fr/articles/10.37236/1458/
%R 10.37236/1458
%F 10_37236_1458

Cité par Sources :