3 papers
math.CO2025
Finding d-Cuts in Claw-free Graphs
Jungho Ahn, Tala Eagling-Vose, Felicia Lucke +2
The Matching Cut problem is to decide if the vertex set of a connected graph can be partitioned into two non-empty sets and such that the edges between and form a m…
cs.DM2025
Twin-width one
Jungho Ahn, Hugo Jacob, Noleen Köhler +3
We investigate the structure of graphs of twin-width at most , and obtain the following results: - Graphs of twin-width at most are permutation graphs. In particular they ha…
math.CO2024
Spectral integral variation of signed graphs
Jungho Ahn, Cheolwon Heo, Sunyo Moon
We characterize when the spectral variation of the signed Laplacian matrices is integral after a new edge is added to a signed graph. As an application, for every fixed signed comp…