Neighborhood unions for the existence of disjoint chorded cycles in graphs

DOI10.1007/S00373-012-1200-0zbMATH Open1272.05091OpenAlexW2039264053MaRDI QIDQ367086FDOQ367086

Authors: Jin Yan, Yunshu Gao, Guojun 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

Recommendations

• Neighborhood unions and disjoint chorded cycles in graphs
• On the maximum number of disjoint chorded cycles in graphs.
• Chorded cycles
• Vertex-disjoint chorded cycles in a graph
• Independet cycles and chorded cycles in graphs

zbMATH Keywords

vertex-disjoint cyclesneighborhood unions

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• Graph theory
• On the maximal number of independent circuits in a graph
• Title not available (Why is that?)
• On the existence of disjoint cycles in a graph
• 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 number of independent chorded cycles in a graph
• On the maximum number of disjoint chorded cycles in graphs.
• A note on neighborhood unions and independent cycles.

Cited In (9)

• Results and problems on chorded cycles: a survey
• On a neighborhood condition implying the existence of disjoint complete graphs
• Independet cycles and chorded cycles in graphs
• On independent doubly chorded cycles
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Neighborhood unions and disjoint chorded cycles in graphs
• Decompositions of graphs into cycles with chords
• Chorded cycles
• Union of neighborhoods for the length of paths and cycles in balanced bipartite graphs

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

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