Work

Hardness of planarity for weak temporal sequences of 2-connected graphs

Year: 2026

Type: article

Abstract: A weak deletion sequence is a sequence ( G 1 , … , G n ) of graphs so that for each i ∈ [ 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.

Source: Theoretical Computer Science

DOI: 10.1016/j.tcs.2026.115825

Authors: Johannes Carmesin, Will J. Turner

Institution: TU Bergakademie Freiberg

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,880

Funder: Deutsche Forschungsgemeinschaft