Coloring face-hypergraphs of graphs on surfaces

DOI10.1006/jctb.2001.2107zbMath1029.05057OpenAlexW2069662110MaRDI QIDQ1850616

Radhika Ramamurthi, André Kündgen

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2107

zbMATH Keywords

choosabilitytopological graph theory

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

Embeddings of a graph into a surface with different weak chromatic numbers ⋮ Spanning quadrangulations of triangulated surfaces ⋮ Transversals and colorings of simplicial spheres ⋮ List 4-colouring of planar graphs ⋮ Unique-maximum coloring of plane graphs ⋮ Maximum face-constrained coloring of plane graphs ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs ⋮ On maximum face-constrained coloring of plane graphs with no short face cycles. ⋮ On the 4-color theorem for signed graphs ⋮ Non-rainbow colorings of 3-, 4- and 5-connected plane graphs ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs ⋮ 2-list-coloring planar graphs without monochromatic triangles ⋮ Coloring face hypergraphs on surfaces ⋮ \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum ⋮ A refinement of choosability of graphs ⋮ The existence of uniform hypergraphs for which the interpolation property of complete coloring fails ⋮ Unnamed Item ⋮ Chromatic numbers of simplicial manifolds

Cites Work

• List colourings of planar graphs
• On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
• The number of cycles in 2-factors of cubic graphs
• Embedding graphs in surfaces
• The complexity of planar graph choosability
• Colorings and orientations of graphs
• Hypermaps versus bipartite maps
• Every planar map is four colorable. I: Discharging
• How to determine the maximum genus of a graph
• Face 2-colourable triangular embeddings of complete graphs
• The Grötzsch theorem for the hypergraph of maximal cliques
• Five-coloring maps on surfaces
• Coloring graphs without short non-bounding cycles
• Every planar graph is 5-choosable
• Three nonisomorphic triangulations of an orientable surface with the same complete graph
• Color-critical graphs on a fixed surface
• Exponential families of non-isomorphic triangulations of complete graphs
• Colouring planar mixed hypergraphs
• Uniqueness and faithfulness of embedding of toroidal graphs
• Colouring Eulerian triangulations
• Coloring locally bipartite graphs on surfaces.
• Partial list colorings
• A Lower Bound for Heilbronn'S Problem
• Coloring Block Designs is NP-Complete
• Coloring Steiner Triple Systems
• HYPERGRAPHS
• Surface embeddings of Steiner triple systems
• Dirac's map-color theorem for choosability
• On chromatic number of graphs and set-systems
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• An Analogue to the Heawood Map-Colouring Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 of graphs on surfaces