Treedepth is NP-Hard on Planar Graphs of Maximum Degree 3

arXiv:2610.42033 · cs.DM, cs.CC, math.CO · Submitted 2026-10-30 · Read on arXiv

cs.DM, cs.CC, math.CO

Submitted: 2026-10-30

Updated: 2026-10-30

Terminology

Sources

Related papers