Multiply chorded cycles

DOI10.1137/12089569XMaRDI QIDQ4979831zbMATH OpenOpenAlexFDO

Authors Ronald Gould, Paul Horn, Colton Magnant

Publication date 19 June 2014

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/12089569x

zbMATH Keywords

chorded cyclesminimum degree

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Disjoint chorded cycles in graphs
• Disjoint cycles and chorded cycles in a graph with given minimum degree
• Disjoint Chorded Cycles of the Same Length
• On the number of independent chorded cycles in a graph
• On the maximum number of disjoint chorded cycles in graphs.

Cited in

(9)

• On the existence of vertex-disjoint subgraphs with high degree sum
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Results and problems on chorded cycles: a survey
• On independent doubly chorded cycles
• A refinement of theorems on vertex-disjoint chorded cycles
• Requiring chords in cycles
• Vertex-disjoint subgraphs with high degree sums
• Chorded cycles
• A general theorem in spectral extremal graph theory

This page was built for publication: Multiply chorded cycles

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