Color-critical graphs on surfaces
A graph is (t+1)-critical if it is not t-colorable, but every proper subgraph is. In this thesis, we study the structure of critical graphs on higher surfaces. One major result in this area is Carsten Thomassen's proof that there are finitely many 6-critical graphs on a fixed surface. This p...
| Main Author: | |
|---|---|
| Published: |
Georgia Institute of Technology
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/37197 |