Neighborhood unions for the existence of disjoint chorded cycles in graphs

DOI10.1007/S00373-012-1200-0zbMath1272.05091OpenAlexW2039264053MaRDI QIDQ367086

Jin Yan, Yun Shu Gao, Guo Jun Li

Publication date: 26 September 2013

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

Full work available at URL: https://doi.org/10.1007/s00373-012-1200-0

zbMATH Keywords

vertex-disjoint cyclesneighborhood unions

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (3)

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

• On a sharp degree sum condition for disjoint chorded cycles in graphs
• Disjoint chorded cycles in graphs
• Neighbourhood unions and Hamiltonian properties in graphs
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Neighborhood unions for the existence of disjoint chorded cycles in graphs