Decomposition into two trees with orientation constraints
classification
🧮 math.CO
keywords
constraintsorientationtreesconjecturedecidingdecompositiondisprovesedge
read the original abstract
We prove that deciding whether the edge set of a graph can be partitionned into two spanning trees with orientation constraints is NP-complete. If P $\neq$ NP then this disproves a conjecture of Recski.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.