Disjoint cycles with chords in graphs

DOI10.1002/JGT.20349MaRDI QIDQ3605162zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

forestsdegree conditionscycles with chords

Mathematics Subject Classification ID

Paths and cycles (05C38)

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

Cites work

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

Cited in

(13)

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

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)