{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T09:23:23Z","timestamp":1778577803054,"version":"3.51.4"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>In this paper, we extend the Gr\u00f6tzsch 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.<\/jats:p>","DOI":"10.37236\/1458","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T21:00:35Z","timestamp":1578690035000},"source":"Crossref","is-referenced-by-count":35,"title":["The Gr\u00f6tzsch Theorem for the Hypergraph of Maximal Cliques"],"prefix":"10.37236","volume":"6","author":[{"given":"Bojan","family":"Mohar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riste","family":"Skrekovski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[1999,6,7]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v6i1r26\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v6i1r26\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T00:33:00Z","timestamp":1579307580000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v6i1r26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6,7]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[1999,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1458","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,6,7]]},"article-number":"R26"}}