On a sharp degree sum condition for disjoint chorded cycles in graphs
From MaRDI portal
Publication:604663
Recommendations
Cites work
- scientific article; zbMATH DE number 3215865 (Why is no real title available?)
- Disjoint chorded cycles in graphs
- On the existence of disjoint cycles in a graph
- On the maximal number of independent circuits in a graph
- On the maximum number of independent cycles in a graph
- On the number of independent chorded cycles in a graph
Cited in
(20)- On the maximum number of disjoint chorded cycles in graphs.
- On degree sum conditions and vertex-disjoint chorded cycles
- Minimum degree conditions for vertex-disjoint even cycles in large graphs
- A refinement of theorems on vertex-disjoint chorded cycles
- Sharp minimum degree conditions for disjoint doubly chorded cycles
- On independent triples and vertex-disjoint chorded cycles in graphs
- Neighborhood unions and disjoint chorded cycles in graphs
- On the Corrádi-Hajnal theorem and a question of Dirac
- Neighborhood unions for the existence of disjoint chorded cycles in graphs
- The extremal function for two disjoint cycles
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- On independent doubly chorded cycles
- Decompositions of graphs into cycles with chords
- Disjoint cycles and chorded cycles in a graph with given minimum degree
- Cycles with a chord in dense graphs
- Disjoint chorded cycles in graphs with high Ore-degree
- Results and problems on chorded cycles: a survey
- Disjoint cliques in claw-free graphs
- Vertex-disjoint double chorded cycles in bipartite graphs
- On vertex-disjoint chorded cycles and degree sum conditions
This page was built for publication: On a sharp degree sum condition for disjoint chorded cycles in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604663)