From the 1 of 1 linked paper with an AI index.
1 paper
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.