Author

Tomáš Masařík

University of Warsaw

h-index 13 Homepage View on Semantic Scholar

We have 1 of 62 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Jul 2026

Edge-decomposition into Two Triangular Forests is NP-complete

Let $\mathcal F$ be a graph class that is closed under topological minors and 1-sums, has decidable membership, contains a triangle, and is not the class of all graphs. Recently, Lee, Liu, and Tsai [ICALP 2026] showed that the edge-decomposition problem into $k \geq 3$ elements of $\mathcal F$ is NP-hard. In particular...

Beniamin Bibrowski, Tomáš Masařík · arXiv.org · 0 citations