Disjoint even cycles packing
From MaRDI portal
Recommendations
Cites work
- K4−‐factor in a graph
- Approximation algorithms and hardness results for cycle packing problems
- Disjoint chorded cycles in graphs
- scientific article; zbMATH DE number 863479 (Why is no real title available?)
- scientific article; zbMATH DE number 3215864 (Why is no real title available?)
- On the maximal number of independent circuits in a graph
- On the number of independent chorded cycles in a graph
- On the presence of disjoint subgraphs of a specified type
- Vertex-disjoint copies of K4-
Cited in
(9)- Sharpening an ore-type version of the Corrádi-Hajnal theorem
- Minimum degree conditions for vertex-disjoint even cycles in large graphs
- An extension of the Corrádi-Hajnal theorem
- Scattered packings of cycles
- Even cycles in graphs
- scientific article; zbMATH DE number 841612 (Why is no real title available?)
- Independence number and disjoint theta graphs
- The extremal function for two disjoint cycles
- Sharp minimum degree conditions for the existence of disjoint theta graphs
This page was built for publication: Disjoint even cycles packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851449)