On the Structure of Counterexamples to the Coloring Conjecture of Hajós
Hajós conjectured that, for any positive integer k, every graph containing no K_(k+1)-subdivision is k-colorable. This is true when k is at most three, and false when k exceeds six. Hajós' conjecture remains open for k=4,5. We will first present some known results on Hajós' conjecture....
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en_US |
| Published: |
Georgia Institute of Technology
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/4994 |