Coloring face hypergraphs on surfaces

DOI10.1016/j.ejc.2004.01.003zbMath1067.05024OpenAlexW1990093945WikidataQ57601551 ScholiaQ57601551MaRDI QIDQ703607

Riste Škrekovski, Zdeněk Dvořák, Daniel Král'

Publication date: 11 January 2005

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2004.01.003

zbMATH Keywords

embedding

Mathematics Subject Classification ID

Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Embeddings of a graph into a surface with different weak chromatic numbers ⋮ Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs

Cites Work

• Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann
• Colouring planar mixed hypergraphs
• Coloring face-hypergraphs of graphs on surfaces
• The Complexity of A Planar Hypermap And That of Its Dual
• HYPERGRAPHS
• Dirac's map-color theorem for choosability
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Gaps in the chromatic spectrum of face-constrained plane graphs
• On planar mixed hypergraphs
• Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coloring face hypergraphs on surfaces