Abstract
A spanning subgraph F of a graph G is called perfect if F is a forest, the degree inline image of each vertex x in F is odd, and each tree of F is an induced subgraph of G. We provide a short linear-algebraic proof of the following theorem of A. D. Scott (Graphs Combin 17 (2001), 539–553): A connected graph G contains a perfect forest if and only if G has an even number of vertices.
| Original language | English |
|---|---|
| Pages (from-to) | 233-235 |
| Number of pages | 3 |
| Journal | Journal of Graph Theory |
| Volume | 82 |
| Issue number | 3 |
| Early online date | 30 Jul 2015 |
| DOIs | |
| Publication status | Published - Jul 2016 |