Neighborhood unions and disjoint chorded cycles in graphs

DOI10.1016/j.disc.2011.10.012zbMath1237.05117OpenAlexW2023512741MaRDI QIDQ764874

Shengning Qiao

Publication date: 16 March 2012

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

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

zbMATH Keywords

cyclevertex-disjointchorded cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items

A refinement of theorems on vertex-disjoint chorded cycles ⋮ Decompositions of graphs into cycles with chords ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Results and problems on chorded cycles: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a sharp degree sum condition for disjoint chorded cycles in graphs
• 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
• Disjoint cycles with chords in graphs
• On the maximal number of independent circuits in a graph