works on
computational complexity 1edge decomposition 1graph decomposition 1np-completeness 1triangular forests 1

From the 1 of 1 linked paper with an AI index.

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2026

Edge-decomposition into Two Triangular Forests is NP-complete

Beniamin Bibrowski, Tomáš Masařík

The paper proves that deciding whether a given graph can be edge‑decomposed into two triangular forests is NP‑complete.