Metraipolis › archive › dc_49b310f466ef

Treedepth is NP-Hard on Planar Graphs of Maximum Degree 3 — arXiv:2610.42033

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.42033
License (as archived)
CC0-1.0
Archived
2026-11-02T08:00:46.903Z
SHA-256 of the archived text
5b6426d8e56f12ccdb42d5d2bc5305d8df015fa2396ca104692b7a46c6130188
Stable URL of this page
https://metraipolis.com/documento/dc_49b310f466ef

How to cite

Treedepth is NP-Hard on Planar Graphs of Maximum Degree 3 — arXiv:2610.42033 — arXiv (en), https://arxiv.org/abs/2610.42033 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_49b310f466ef (Metraipolis archive dc_49b310f466ef, sha256 5b6426d8e56f12ccdb42d5d2bc5305d8df015fa2396ca104692b7a46c6130188)
BibTeX
@misc{dc49b310f466ef,
  title = {Treedepth is NP-Hard on Planar Graphs of Maximum Degree 3 — arXiv:2610.42033},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.42033},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_49b310f466ef; sha256 5b6426d8e56f12ccdb42d5d2bc5305d8df015fa2396ca104692b7a46c6130188},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.42033. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Treedepth is an important parameter in algorithmic graph theory. It is known that the problem of computing the treedepth of a graph is NP-hard. It has been an open problem whether treedepth can be computed in polynomial time when the input graph is restricted to be planar, or of bounded degree. Assuming $P \neq NP$, we answer both questions in the negative: Under polynomial-time Turing reductions, it is NP-hard to compute the treedepth of planar graphs with maximum degree 3. This degree bound is best possible, since treedepth can be computed efficiently on graphs of maximum degree 2.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Discrete Mathematics (cs.DM) ; Computational Complexity (cs.CC); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.42033 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T07:42:45.765Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).