Ore-type conditions implying 2-factors consisting of short cycles
From MaRDI portal
(Redirected from Publication:1044946)
Recommendations
Cites work
- 2-factors in dense graphs
- An Ore-type analogue of the Sauer-Spencer theorem
- Edge disjoint placement of graphs
- Embedding Arbitrary Graphs of Maximum Degree Two
- Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
- Hamiltonian square-paths
- scientific article; zbMATH DE number 4101249 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- Note on Hamilton Circuits
- 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
- Ore-type graph packing problems
- Packings of graphs and applications to computational complexity
- Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
- Some Theorems on Abstract Graphs
- Subgraphs of graphs. I
Cited in
(3)
This page was built for publication: Ore-type conditions implying 2-factors consisting of short cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044946)