Decomposition into two trees with orientation constraints
Combinatorics
2013-04-15 v1
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 NP then this disproves a conjecture of Recski.
Keywords
Cite
@article{arxiv.1304.3613,
title = {Decomposition into two trees with orientation constraints},
author = {Olivier Durand de Gevigney},
journal= {arXiv preprint arXiv:1304.3613},
year = {2013}
}
Comments
5 pages, 2 figures