Edge disjoint cycles in graphs
From MaRDI portal
Publication:3831041
Recommendations
- scientific article; zbMATH DE number 475594
- scientific article; zbMATH DE number 908792
- scientific article; zbMATH DE number 515368
- Edge-disjoint paths and cycles inn-edge-connected graphs
- Edge disjoint Hamilton cycles in graphs
- Edge-disjoint Hamilton cycles in graphs
- scientific article; zbMATH DE number 568815
- scientific article; zbMATH DE number 3926957
- Disjoint chorded cycles in graphs
- Vertex disjoint non-separating cycles in graphs
Cites work
Cited in
(16)- Edge-disjoint circuits in graphs on the torus
- Edge-disjoint odd cycles in planar graphs.
- Cycle multiplicity of some total graphs
- Two vertex-disjoint cycles in a graph
- Short disjoint cycles in graphs with degree constraints
- scientific article; zbMATH DE number 4077266 (Why is no real title available?)
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Edge disjoint Hamilton cycles in graphs
- On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
- scientific article; zbMATH DE number 6890341 (Why is no real title available?)
- Maximum cycle packing using SPR-trees
- scientific article; zbMATH DE number 7144824 (Why is no real title available?)
- Edge disjoint cycles through specified vertices
- 3-path-connectivity of Cayley graphs generated by transposition trees
- Short disjoint cycles in graphs with degree constraints
- Disjoint chorded cycles in graphs
This page was built for publication: Edge disjoint cycles in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3831041)