Note on Perfect Forests in Digraphs |
| |
| Authors: | Gregory Gutin Anders Yeo |
| |
| Affiliation: | 1. DEPARTMENT OF COMPUTER SCIENCE, ROYAL HOLLOWAY, UNIVERSITY OF LONDON, EGHAM, UNITED KINGDOM;2. ENGINEERING SYSTEMS AND DESIGN, SINGAPORE UNIVERSITY OF TECHNOLOGY AND DESIGN, SINGAPORE, SINGAPORE;3. DEPARTMENT OF MATHEMATICS, UNIVERSITY OF JOHANNESBURG, AUCKLAND PARK, SOUTH AFRICA |
| |
| Abstract: | ![]()
A spanning subgraph F of a graph G is called perfect if F is a forest, the degree  of each vertex x in F is odd, and each tree of F is an induced subgraph of G. Alex Scott (Graphs Combin 17 (2001), 539–553) proved that every connected graph G contains a perfect forest if and only if G has an even number of vertices. We consider four generalizations to directed graphs of the concept of a perfect forest. While the problem of existence of the most straightforward one is NP‐hard, for the three others this problem is polynomial‐time solvable. Moreover, every digraph with only one strong component contains a directed forest of each of these three generalization types. One of our results extends Scott's theorem to digraphs in a nontrivial way. |
| |
| Keywords: | digraphs perfect forests directed forests degree parity |
|
|
of each vertex x in F is odd, and each tree of F is an induced subgraph of G. Alex Scott (Graphs Combin 17 (2001), 539–553) proved that every connected graph G contains a perfect forest if and only if G has an even number of vertices. We consider four generalizations to directed graphs of the concept of a perfect forest. While the problem of existence of the most straightforward one is NP‐hard, for the three others this problem is polynomial‐time solvable. Moreover, every digraph with only one strong component contains a directed forest of each of these three generalization types. One of our results extends Scott's theorem to digraphs in a nontrivial way.