Graph structures and well-quasi-ordering
Robertson and Seymour proved that graphs are well-quasi-ordered by the minor relation. In other words, given infinitely many graphs, one graph contains another as a minor. An application of this theorem is that every property that is closed under deleting vertices, edges, and contracting edges can b...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
Georgia Institute of Technology
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/52262 |