Disjoint cycles with chords in graphs

DOI10.1002/JGT.20349zbMATH Open1183.05041OpenAlexW4245296112MaRDI QIDQ3605162FDOQ3605162

Authors: Ch. Sobhan Babu, Ajit A. Diwan 

Publication date: 20 February 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20349

Recommendations

• Vertex-disjoint chorded cycles in a graph
• \(k\) disjoint cycles containing specified independent vertices
• Degree sum conditions on two disjoint cycles in graphs
• On the maximum number of disjoint chorded cycles in graphs.
• Disjoint chorded cycles in graphs

zbMATH Keywords

forestsdegree conditionscycles with chords

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• On the existence of disjoint cycles in a graph
• Disjoint chorded cycles in graphs
• On the number of independent chorded cycles in a graph
• Subtrees and subforests of graphs
• Degree conditions for forests in graphs
• A minimum degree result for disjoint cycles and forests in graphs

Cited In (13)

• Results and problems on chorded cycles: a survey
• Disjoint Chorded Cycles of the Same Length
• A note on disjoint cycles
• Chords and disjoint paths in matroids
• Disjoint essential cycles
• Spanning cyclic subdivisions of vertex-disjoint cycles and chorded cycles in graphs
• Graphs in which every \(c\) edges that form a tree are chords of a common cycle
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Disjoint chorded cycles in graphs with high Ore-degree
• Neighborhood unions and disjoint chorded cycles in graphs
• Decompositions of graphs into cycles with chords
• Disjoint chorded cycles in graphs
• ON DISJOINT CYCLES

This page was built for publication: Disjoint cycles with chords in graphs

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