Two short proofs of the Perfect Forest Theorem
A perfect forest is a spanning forest of a connected graph $G$, all of whose components are induced subgraphs of $G$ and such that all vertices have odd degree in the forest. A perfect forest generalised a perfect matching since, in a matching, all components are trees on one edge. Scott first prove...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2017-01-01
|
| Series: | Theory and Applications of Graphs |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol4/iss1/4 |