Coloring face-hypergraphs of graphs on surfaces
type: Item
instance of: scholarly article
title: Coloring face-hypergraphs of graphs on surfaces
zbMATH Open document ID: 1029.05057
author: André Kündgen
author: Radhika Ramamurthi
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 1843836
zbMATH Keywords: topological graph theory
zbMATH Keywords: choosability
MaRDI profile type: Publication
full work available at URL: jctb.2001.2107
OpenAlex ID: W2069662110
cites work: Partial list colorings
cites work: Colorings and orientations of graphs
cites work: Q4004078
cites work: Every planar map is four colorable. I: Discharging
cites work: Q3941433
cites work: Q3993087
cites work: Dirac's map-color theorem for choosability
cites work: Q3097395
cites work: Exponential families of non-isomorphic triangulations of complete graphs
cites work: Coloring Steiner Triple Systems
cites work: Q4058692
cites work: Coloring Block Designs is NP-Complete
cites work: Q3745851
cites work: On chromatic number of graphs and set-systems
cites work: Q3922703
cites work: Coloring graphs without short non-bounding cycles
cites work: Q4198056
cites work: Face 2-colourable triangular embeddings of complete graphs
cites work: Surface embeddings of Steiner triple systems
cites work: Q3757929
cites work: The complexity of planar graph choosability
cites work: Embedding graphs in surfaces
cites work: Colouring Eulerian triangulations
cites work: Q3890714
cites work: A Lower Bound for Heilbronn'S Problem
cites work: An Analogue to the Heawood Map-Colouring Problem
cites work: Colouring planar mixed hypergraphs
cites work: Three nonisomorphic triangulations of an orientable surface with the same complete graph
cites work: Q5563939
cites work: Q4882549
cites work: Coloring locally bipartite graphs on surfaces.
cites work: Graphs on surfaces
cites work: The Grötzsch theorem for the hypergraph of maximal cliques
cites work: Uniqueness and faithfulness of embedding of toroidal graphs
cites work: Q4099658
cites work: On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
cites work: Q3027024
cites work: Q4773723
cites work: SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
cites work: Q4340879
cites work: The number of cycles in 2-factors of cubic graphs
cites work: Five-coloring maps on surfaces
cites work: Every planar graph is 5-choosable
cites work: Q4871753
cites work: Color-critical graphs on a fixed surface
cites work: Q3115277
cites work: List colourings of planar graphs
cites work: Hypermaps versus bipartite maps
cites work: Q4869540
cites work: How to determine the maximum genus of a graph
cites work: HYPERGRAPHS
DOI: 10.1006/JCTB.2001.2107
description: scientific article; zbMATH DE number 1843836