On the complexity of finding a spanning even tree in a graph

Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita +4

A tree is said to be even if for every pair of distinct leaves, the length of the unique path between them is even. In this paper we discuss the problem of determining whether an i…