2000 character limit reached
Partitionability to two trees is NP-complete
Published 20 Feb 2010 in cs.CC and cs.DM | (1002.3937v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.