Vertex-disjoint chorded cycles in a graph
From MaRDI portal
Publication:614042
Recommendations
Cites work
Cited in
(25)- The extremal question for cycles with chords
- On the maximum number of disjoint chorded cycles in 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
- Disjoint cycles with chords in graphs
- Neighborhood unions for the existence of disjoint chorded cycles in graphs
- 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
- A vertex cover with chorded 4-cycles
- 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
- Chorded cycles
- Disjoint Chorded Cycles of the Same Length
- On the number of independent chorded cycles in a graph
- On 2-factors with chorded quadrilaterals in graphs.
- scientific article; zbMATH DE number 3922692 (Why is no real title available?)
- scientific article; zbMATH DE number 2197942 (Why is no real title available?)
- Vertex-disjoint double chorded cycles in bipartite graphs
- Vertex‐disjoint cycles containing prescribed vertices
This page was built for publication: Vertex-disjoint chorded cycles in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q614042)