On a result of Thomassen
We give a new proof of Thomassen's theorem stating that if the chromatic (coloring) number of a graph X is > κ, then X contains a κ-edge-connected subgraph with similar properties. 2010 Mathematics Subject Classification. Primary 03E05; Secondary 05C15.
Gespeichert in:
| Veröffentlicht in: | Proceedings of the American Mathematical Society 2016-08, Vol.144 (8), p.3569-3572 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | We give a new proof of Thomassen's theorem stating that if the chromatic (coloring) number of a graph X is > κ, then X contains a κ-edge-connected subgraph with similar properties.
2010 Mathematics Subject Classification. Primary 03E05; Secondary 05C15. |
|---|---|
| ISSN: | 0002-9939 1088-6826 |
| DOI: | 10.1090/proc/12990 |