Disjoint chorded cycles in graphs with high Ore-degree

DOI10.1007/978-3-030-55857-4_11zbMath1473.05149OpenAlexW3106829687MaRDI QIDQ2232037

Derrek Yager, Gexin Yu, Alexandr V. Kostochka

Publication date: 4 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-55857-4_11

zbMATH Keywords

cyclesOre-degreechorded cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Extremal combinatorics (05D99)

Related Items (2)

Sharpening an ore-type version of the Corrádi-Hajnal theorem ⋮ Results and problems on chorded cycles: a survey

This page was built for publication: Disjoint chorded cycles in graphs with high Ore-degree