A note on highly connected K_{2,\ell}-minor free graphs

MaRDI QIDQ6508347arXivFDO

Authors Nicolas Bousquet, Théo Pierron, Alexandra Wesolek

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph minors (05C83)

Abstract: We show that every $3$-connected $K_{2,ell}$-minor free graph with minimum degree at least $4$ has maximum degree at most $7ell$. As a consequence, we show that every 3-connected $K_{2,ell}$-minor free graph with minimum degree at least $5$ and no twins of degree $5$ has bounded size. Our proofs use Steiner trees and nested cuts; in particular, they do not rely on Ding's characterization of $K_{2,ell}$-minor free graphs.

This page was built for publication: A note on highly connected $K_{2,\ell}$-minor free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6508347)