arXiv subjects

Domotor Palvolgyi

Publications and source records attributed to Domotor Palvolgyi.

1 recordsLinked to original sources

arXiv2010

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.

cs.CC↗