Disjoint chorded cycles in graphs with high Ore-degree

DOI10.1007/978-3-030-55857-4_11MaRDI QIDQ2232037zbMATH OpenOpenAlexFDO

Authors Derrek Yager, Gexin Yu, Alexandr 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)

Recommendations

• Disjoint chorded cycles in graphs
• Disjoint cycles with chords in graphs
• Disjoint cycles and chorded cycles in a graph with given minimum degree
• Vertex-disjoint chorded cycles in a graph
• On the maximum number of disjoint chorded cycles in graphs.
• A refinement of theorems on vertex-disjoint chorded cycles
• Disjoint cycles in graphs with restricted independence number
• On a sharp degree sum condition for disjoint chorded cycles in graphs
• On the existence of disjoint cycles in a graph
• On degree sum conditions and vertex-disjoint chorded cycles

Cited in

(6)

• A refinement of theorems on vertex-disjoint chorded cycles
• Sharpening an ore-type version of the Corrádi-Hajnal theorem
• On the Corrádi-Hajnal theorem and a question of Dirac
• Disjoint cycles and chorded cycles in a graph with given minimum degree
• Results and problems on chorded cycles: a survey
• Disjoint chorded cycles in graphs

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

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