Coloring face hypergraphs on surfaces

DOI10.1016/J.EJC.2004.01.003MaRDI QIDQ703607zbMATH OpenOpenAlexWikidataFDO

Authors Zdeněk Dvořák, Riste Škrekovski, 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

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

Recommendations

• Coloring face-hypergraphs of graphs on surfaces
• Locally planar graphs are 5-choosable
• A lower bound for the number of orientable triangular embeddings of some complete graphs
• Three-coloring graphs embedded on surfaces with all faces even-sided
• Dirac's map-color theorem for choosability
• The choice number versus the chromatic number for graphs embeddable on orientable surfaces
• Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs
• Tree-width of hypergraphs and surface duality
• 3-list-coloring graphs of girth at least five on surfaces
• Improper coloring of graphs on surfaces

Cites work

• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 3475491 (Why is no real title available?)
• scientific article; zbMATH DE number 3522002 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• scientific article; zbMATH DE number 1341914 (Why is no real title available?)
• Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen
• Coloring face-hypergraphs of graphs on surfaces
• Colouring planar mixed hypergraphs
• Dirac's map-color theorem for choosability
• Gaps in the chromatic spectrum of face-constrained plane graphs
• Graphs on surfaces
• HYPERGRAPHS
• On planar mixed hypergraphs
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• The Complexity of A Planar Hypermap And That of Its Dual
• Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann

Cited in

(8)

• Difference of Facial Achromatic Numbers between Two Triangular Embeddings of a Graph
• Harmonious and achromatic colorings of fragmentable hypergraphs
• Coloring face-hypergraphs of graphs on surfaces
• Embeddings of a graph into a surface with different weak chromatic numbers
• The choice number versus the chromatic number for graphs embeddable on orientable surfaces
• Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
• Coloring vertices and faces of maps on surfaces
• Hyperbolic families and coloring graphs on surfaces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703607)