Partitionability to two trees is NP-complete

Domotor Palvolgyi

Partitionability to two trees is NP-complete

Computational Complexity 2010-02-23 v1 Discrete Mathematics

Authors: Domotor Palvolgyi

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.

Keywords

graph theory computational complexity planar graph drawing

Cite

@article{arxiv.1002.3937,
  title  = {Partitionability to two trees is NP-complete},
  author = {Domotor Palvolgyi},
  journal= {arXiv preprint arXiv:1002.3937},
  year   = {2010}
}

Related papers

View all related →

Combinatorics · Mathematics

Decomposition into two trees with orientation constraints

Olivier Durand de Gevigney

2013-04-15

Combinatorics · Mathematics

Some NP-complete edge packing and partitioning problems in planar graphs

Jed Yang

2014-09-09

Data Structures and Algorithms · Computer Science

Complexity dichotomy on partial grid recognition

Vinícius G. P. de Sá, Guilherme D. da Fonseca, Raphael Machado, Celina M. H. de Figueiredo

2012-04-13

Discrete Mathematics · Computer Science

NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph

Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller

2014-04-10

Data Structures and Algorithms · Computer Science

Finding Spanning Trees with Perfect Matchings

Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi +1

2024-07-12

Combinatorics · Mathematics

On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs

Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz

2017-08-23

Computational Complexity · Computer Science

Complexity of fall coloring for restricted graph classes

Juho Lauri, Christodoulos Mitillos

2019-05-14

Computational Complexity · Computer Science

The Computational Complexity of Disconnected Cut and 2K2-Partition

Barnaby Martin, Daniel Paulusma

2014-10-30

Data Structures and Algorithms · Computer Science

Decomposing Cubic Graphs into Connected Subgraphs of Size Three

Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi +1

2022-08-29

Condensed Matter · Physics

Polynomial Observables in the Graph Partitioning Problem

M. A. Marchisio

2009-11-07

Combinatorics · Mathematics

On Edge-Partitioning of Complete Geometric Graphs into Plane Trees

Hazim Michman Trao, Gek L. Chia, Niran Abbas Ali, Adem Kilicman

2019-06-14

Computational Complexity · Computer Science

The Complexity of Tree Partitioning

Zhao An, Qilong Feng, Iyad Kanj, Ge Xia

2017-04-21

Combinatorics · Mathematics

Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard

Alastair Farrugia

2007-05-23

Combinatorics · Mathematics

Partitions of complete twisted graphs into plane spanning trees

Ana Paulina Figueroa, Eduardo Rivera-Campo

2025-10-31

Discrete Mathematics · Computer Science

Set graphs. II. Complexity of set graph recognition and similar problems

Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu

2015-03-20

Combinatorics · Mathematics

On the complexity of deciding whether the regular number is at most two

Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi

2014-06-09

Computational Complexity · Computer Science

Complexity of Finding and Enumerating Interconnection Trees

Noé Demange, Yann Strozecki

2026-05-19

Combinatorics · Mathematics

The complexity of the Perfect Matching-Cut problem

Valentin Bouquet, Christophe Picouleau

2021-11-01

Discrete Mathematics · Computer Science

Edge deletion to tree-like graph classes

Ivo Koch, Nina Pardal, Vinicius Fernandes dos Santos

2023-07-14

Discrete Mathematics · Computer Science

Partitioning Perfect Graphs into Stars

René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen +3

2017-05-25

Databases · Computer Science

Mining for trees in a graph is NP-complete

Jan Van den Bussche

2007-10-01

Combinatorics · Mathematics

Four NP-complete problems about generalizations of perfect graphs

Vaidy Sivaraman

2017-05-18

Combinatorics · Mathematics

Partitioning perfect graphs into comparability graphs

András Gyárfás, Márton Marits, Géza Tóth

2026-03-10

Computational Complexity · Computer Science

Yin-Yang Puzzles are NP-complete

Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno

2021-06-30

Data Structures and Algorithms · Computer Science

The Satisfactory Partition Problem

Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi

2020-07-29