Hardness of Planarity for Weak Temporal Sequences of 2-Connected Graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912753092919296 |
|---|---|
| author | Carmesin, Johannes Turner, Will J. |
| author_facet | Carmesin, Johannes Turner, Will J. |
| contents | A weak deletion sequence is a sequence $(G_1,\ldots,G_n)$ of graphs so that for each $i\in[n-1]$ either $G_i$ is isomorphic to a subgraph of $G_{i+1}$, or vice versa: $G_{i+1}$ is isomorphic to a subgraph of $G_i$. We prove that determining the simultaneous planar embeddability of weak deletion sequences of $2$-connected graphs is NP-hard. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_06403 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Hardness of Planarity for Weak Temporal Sequences of 2-Connected Graphs Carmesin, Johannes Turner, Will J. Combinatorics 05C10 (Primary), 05C83, 68R10 A weak deletion sequence is a sequence $(G_1,\ldots,G_n)$ of graphs so that for each $i\in[n-1]$ either $G_i$ is isomorphic to a subgraph of $G_{i+1}$, or vice versa: $G_{i+1}$ is isomorphic to a subgraph of $G_i$. We prove that determining the simultaneous planar embeddability of weak deletion sequences of $2$-connected graphs is NP-hard. |
| title | Hardness of Planarity for Weak Temporal Sequences of 2-Connected Graphs |
| topic | Combinatorics 05C10 (Primary), 05C83, 68R10 |
| url | https://arxiv.org/abs/2512.06403 |