Partitionability to two trees is NP-complete
Domotor Palvolgyi
TL;DR
This paper proves that determining whether a simple graph's edges can be split into two trees is an NP-complete problem, highlighting its computational difficulty.
Contribution
It establishes the NP-completeness of the P2T problem, a previously unresolved question in graph theory.
Findings
P2T is NP-complete.
Partitioning edges into two trees is computationally hard.
No known polynomial-time solution exists for P2T.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Computability, Logic, AI Algorithms