Ore-type conditions implying 2-factors consisting of short cycles

DOI10.1016/j.disc.2008.06.001zbMath1213.05213OpenAlexW1989024161MaRDI QIDQ1044946

Alexandr V. Kostochka, Gexin Yu

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.06.001

zbMATH Keywords

packingdegree conditions

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Graphs containing every 2-factor ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• Packings of graphs and applications to computational complexity
• On the maximum number of independent cycles in a graph
• On the existence of disjoint cycles in a graph
• Subgraphs of graphs. I
• Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
• 2-factors in dense graphs
• Hamiltonian square-paths
• An Ore-type analogue of the Sauer-Spencer theorem
• Note on Hamilton Circuits
• Ore-type graph packing problems
• Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
• Embedding Arbitrary Graphs of Maximum Degree Two
• On the maximal number of independent circuits in a graph
• Some Theorems on Abstract Graphs

This page was built for publication: Ore-type conditions implying 2-factors consisting of short cycles