Disjoint chorded cycles in graphs

DOI10.1016/j.disc.2007.10.040zbMath1229.05163OpenAlexW2001686801MaRDI QIDQ998485

Daniel Finkel, András Gyárfás, Arie Bialostocki

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.040

zbMATH Keywords

cyclescycles with chords

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (18)

Sharp minimum degree conditions for the existence of disjoint theta graphs ⋮ A refinement of theorems on vertex-disjoint chorded cycles ⋮ On the Corrádi-Hajnal theorem and a question of Dirac ⋮ Neighborhood unions for the existence of disjoint chorded cycles in graphs ⋮ Disjoint cycles and chorded cycles in a graph with given minimum degree ⋮ On a sharp degree sum condition for disjoint chorded cycles in graphs ⋮ The edge condition for independent cycles with chords in bipartite graphs ⋮ Decompositions of graphs into cycles with chords ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Disjoint cliques in claw-free graphs ⋮ Minimum degree conditions for vertex-disjoint even cycles in large graphs ⋮ Chorded cycles ⋮ Disjoint cycles with chords in graphs ⋮ The extremal function for two disjoint cycles ⋮ Neighborhood unions and disjoint chorded cycles in graphs ⋮ Disjoint Even Cycles Packing ⋮ Results and problems on chorded cycles: a survey ⋮ On independent doubly chorded cycles

Cites Work

• On independent cycles and edges in graphs
• On the maximal number of independent circuits in a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Disjoint chorded cycles in graphs