Coloring face-hypergraphs of graphs on surfaces

Journal of Combinatorial Theory. Series B

Volumn 85, Issue 2, 2002, Pages 307-337

  Kündgen, André ^a   Ramamurthi, Radhika ^b  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Faces; Graphs on surfaces; Hypergraph; Topological graph theory; Weak coloring

Indexed keywords

EID: 0036311387     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2001.2107     Document Type: Article

References (56)

1. Partial list colorings
2. Colorings and orientations of graphs
3. "The Probabilistic Method"
4. Every planar map is four-colorable
5. "Graphs and Hypergraphs"
6. "Hypergraphs"
7. Dirac's map-color theorem for choosability
8. "Graph Theory with Applications"
9. Exponential families of non-isomorphic triangulations of complete graphs
10. Coloring Steiner triple systems
11. An upper bound for the chromatic number of hypergraphs
12. Coloring block designs is NP-complete
13. "Triple Systems"
14. On chromatic number of graphs and set-systems
15. Choosability in graphs
16. Coloring graphs without short non-bounding cycles
17. "Computers and Intractability"
18. Face 2-colourable triangular embeddings of complete graphs
19. Surface embeddings of Steiner triple systems
20. "Topological Graph Theory"
21. The complexity of planar graph choosability
22. Map-colour theorem
23. Über das Problem der Nachbargebiete
24. Embedding graphs in surfaces
25. Colouring Eulerian triangulations
26. Imbeddings of hypergraphs
27. A lower bound for Heilbronn's problem
28. An analogue to the Heawood map-colouring problem
29. Colouring planar mixed hypergraphs
30. Three nonisomorphic triangulations of an orientable surface with the same complete graph
31. Graphs and set systems
32. A small non-4-choosable planar graph
33. Coloring locally bipartite graphs on surfaces
34. "Graphs on Surfaces"
35. The Grötzsch Theorem for the hypergraph of maximal cliques
36. Uniqueness and faithfulness of embedding of toroidal graphs
37. Une propriété de bicoloration des hypergraphes planaires
38. On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
39. Steiner triple systems with minimum independence number
40. "Coloring Problems on Graphs and Hypergraphs"
41. "Map Color Theorem"
42. Solution of the Heawood map-coloring problem
43. A new proof of the four-colour theorem
44. The number of cycles in 2-factors of cubic graphs
45. Five-coloring maps on surfaces
46. Every planar graph is 5-choosable
47. Embeddings and minors
48. Color-critical graphs on a fixed surface
49. Coloring the vertices of a graph in prescribed colors
50. List colourings of planar graphs
51. Hypermaps versus bipartite maps
52. "Introduction to Graph Theory"
53. How to determine the maximum genus of a graph
54. Hypergraphs