3 papers
math.CO2026
On Edge-Disjoint Maximal Outerplanar Graphs
Yuto Okada, Yota Otachi, Lena Volk
We provide two constructions for edge-disjoint maximal outerplanar graphs on every number of vertices. The bound on the minimum number of vertices is tight. These c…
cs.DS2025
Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
Tesshu Hanaka, Yuto Okada, Yota Otachi +1
We study the parameterized complexity of the problems of finding a maximum common (induced) subgraph of two given graphs. Since these problems generalize several NP-complete proble…
math.CO2025
On the twin-width of near-regular graphs
Irene Heinrich, Ferdinand Ihringer, Simon Raßmann +1
Twin-width is a recently introduced graph parameter based on the repeated contraction of near-twins. It has shown remarkable utility in algorithmic and structural graph theory, as…