3 papers
math.CO2025
Hardness of Planarity for Weak Temporal Sequences of 2-Connected Graphs
Johannes Carmesin, Will J. Turner
A weak deletion sequence is a sequence of graphs so that for each either is isomorphic to a subgraph of , or vice versa: is…
math.CO2025
A Graph Minors Approach to Temporal Sequences
Johannes Carmesin, Will J. Turner
We develop a structural approach to simultaneous embeddability in temporal sequences of graphs, inspired by graph minor theory. Our main result is a classification theorem for 2-co…
math.CO2024
Towards a Stallings-type theorem for finite groups
Johannes Carmesin, George Kontogeorgiou, Jan Kurkofka +1
A recent development in graph-minor theory is to study local separators, vertex-sets that separate graphs locally but not necessarily globally. The local separators of a graph roug…