Graphs on Higher Surfaces

Tommy R. Jensen, Bjarne Toft · 1994

This chapter contains sections titled: Heawood's Empire Problem Grünbaum's 3-Edge-Color Conjecture Albertson's Four-Color Problem Improper Colorings Number of 6-Critical Graphs on a Surface Toroidal Polyhedra Polynomial Coloring of Embedded Graphs Sparse Embedded Graphs Ringel's 1-Chromatic Number Borodin's Conjecture on Diagonal Coloring Acyclic Colorings Cochromatic Numbers Graphs on Pseudo-Surfaces

Read the paper · More papers on PaperTik