2 papers
math.CO2026
Structural similarity between polyhedral embeddings and their duals and its application to self-duality of pathwidth
Hikaru Yokoi
Let be a graph embedded on a closed surface. We call a \emph{polyhedral embedding} if all facial walks are cycles, and any two of them are either disjoint or intersect in a…
cs.DM2025
Large induced subgraph with a given pathwidth in outerplanar graphs
Naoki Matsumoto, Takamasa Yashima, Hikaru Yokoi
A long-standing conjecture by Albertson and Berman in 1979 states that every planar graph of order has an induced forest with at least vertices. As…