Skip to content

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Removable matchings in $2$-connected graphs

A matching $M$ of a $2$-connected graph $G$ is \emph{removable} if $G-M$ is $2$-connected. We prove that, for every integer $d\ge4$, every $2$-connected graph with at least $2d$ vertices and minimum degree at least $d$ has a removable matching of size $d$. This improves the previously known lower bound $d-2$ for $d\ge5...

Jinik Hwang, Ringi Kim · 0 citations
Preprint Sep 2026

Removable matchings in $2$-connected graphs

A matching $M$ of a $2$-connected graph $G$ is removable if $G-M$ is $2$-connected, extending Halin's classical notion of a removable edge. We prove that for every integer $d\ge 5$, every $2$-connected graph $G$ with $\delta(G)\ge d$ and $|V(G)|\ge 2d$ has a removable $d$-matching. This is best possible, since the comp...

Ringi Kim · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.