Partitionability to two trees is NP-complete

Abstract

We show that P2T - the problem of deciding whether the edge set of a simple graph can be partitioned into two trees or not - is NP-complete.