On the number of independent chorded cycles in a graph

DOI10.1016/j.disc.2007.09.035zbMath1228.05170MaRDI QIDQ2519839

Daniel Finkel

Publication date: 27 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.09.035

zbMATH Keywords

chorded cycles; independent cycles

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

05C38: Paths and cycles

Related Items

Disjoint Chorded Cycles of the Same Length, Neighborhood unions for the existence of disjoint chorded cycles in graphs, Chorded cycles, On a sharp degree sum condition for disjoint chorded cycles in graphs, Vertex-disjoint chorded cycles in a graph, Neighborhood unions and disjoint chorded cycles in graphs, Sharp minimum degree conditions for the existence of disjoint theta graphs, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Extending vertex and edge pancyclic graphs, Results and problems on chorded cycles: a survey, Disjoint cycles and chorded cycles in a graph with given minimum degree, On independent doubly chorded cycles, A refinement of theorems on vertex-disjoint chorded cycles, Minimum degree conditions for vertex-disjoint even cycles in large graphs, On degree sum conditions and vertex-disjoint chorded cycles, Disjoint Even Cycles Packing, Unnamed Item, Disjoint cycles with chords in graphs

Cites Work

• Unnamed Item
• Vertex-disjoint quadrilaterals in graphs
• On the maximal number of independent triangles in graphs
• On the maximum number of independent cycles in a graph
• On the maximal number of independent circuits in a graph
• On the maximal number of independent circuits in a graph