Coloring face hypergraphs on surfaces

DOI10.1016/J.EJC.2004.01.003zbMATH Open1067.05024OpenAlexW1990093945WikidataQ57601551 ScholiaQ57601551MaRDI QIDQ703607FDOQ703607

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

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

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)

Cites Work

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

Cited In (5)

• Harmonious and achromatic colorings of fragmentable hypergraphs
• Coloring vertices and faces of maps on surfaces
• Embeddings of a graph into a surface with different weak chromatic numbers
• Coloring face-hypergraphs of graphs on surfaces
• Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality

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)