On a sharp degree sum condition for disjoint chorded cycles in graphs

DOI10.1007/s00373-010-0901-5zbMath1231.05143OpenAlexW2157049835MaRDI QIDQ604663

Shuya Chiba, Shinya Fujita, Yun Shu Gao, Guo Jun Li

Publication date: 12 November 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0901-5

zbMATH Keywords

vertex-disjointchorded cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items

A refinement of theorems on vertex-disjoint chorded cycles, Unnamed Item, On the Corrádi-Hajnal theorem and a question of Dirac, On degree sum conditions and vertex-disjoint chorded cycles, Neighborhood unions for the existence of disjoint chorded cycles in graphs, Disjoint cycles and chorded cycles in a graph with given minimum degree, 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, The extremal function for two disjoint cycles, Vertex-disjoint double chorded cycles in bipartite graphs, Neighborhood unions and disjoint chorded cycles in graphs, Results and problems on chorded cycles: a survey, On independent doubly chorded cycles

Cites Work

• Unnamed Item
• Disjoint chorded cycles in graphs
• On the maximum number of independent cycles in a graph
• On the existence of disjoint cycles in a graph
• On the number of independent chorded cycles in a graph
• On the maximal number of independent circuits in a graph