Premium
Note on Perfect Forests in Digraphs
Author(s) -
Gutin Gregory,
Yeo Anders
Publication year - 2017
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22066
Subject(s) - combinatorics , mathematics , digraph , discrete mathematics , generalization , vertex (graph theory) , graph , spanning tree , vertex connectivity , mathematical analysis
A spanning subgraph F of a graph G is called perfect if F is a forest, the degreed F ( x )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.