Unavoidable Cycle-Contraction Minors of Large 2-Connected Graphs
SIAM Journal on Discrete Mathematics · 30.06.2026 · 40 (2) · 612-632
DOI: 10.1137/25m1745052 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Discrete Mathematics, online erschienen am 27.04.2026. Verfasst von Wayne Ge und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 10 Literaturangaben.
Abstract (Originalsprache)
It is well known that every sufficiently large connected graph has, as an induced subgraph, [Formula: see text], [Formula: see text], or an [Formula: see text]-vertex path. A 2023 paper of Allred, Ding, and Oporowski identified a set of unavoidable induced subgraphs of sufficiently large 2-connected graphs. In this paper, we establish a dual version of this theorem by focusing on the minors obtained by contracting cycles.
Zitieren
APA
Ge, W., & Oxley, J. (2026). Unavoidable Cycle-Contraction Minors of Large 2-Connected Graphs. SIAM Journal on Discrete Mathematics, 40(2), 612-632. https://doi.org/10.1137/25m1745052
Vancouver
Ge W, Oxley J. Unavoidable Cycle-Contraction Minors of Large 2-Connected Graphs. SIAM Journal on Discrete Mathematics. 2026;40(2):612-632. doi:10.1137/25m1745052
BibTeX
@article{Ge2026,
author = {Ge, Wayne and Oxley, James},
title = {Unavoidable Cycle-Contraction Minors of Large 2-Connected Graphs},
journal = {SIAM Journal on Discrete Mathematics},
year = {2026},
volume = {40},
number = {2},
pages = {612--632},
doi = {10.1137/25m1745052}
}
EUVIMED