An Ore-type analogue of the Sauer-Spencer theorem
From MaRDI portal
Publication:2385133
DOI10.1007/s00373-007-0732-1zbMath1125.05081OpenAlexW2079690680MaRDI QIDQ2385133
Gexin Yu, Alexandr V. Kostochka
Publication date: 11 October 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0732-1
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (4)
Graphs containing every 2-factor ⋮ Efficient Graph Packing via Game Colouring ⋮ Ore-type conditions implying 2-factors consisting of short cycles ⋮ Embedding Graphs Having Ore-Degree at Most Five
Cites Work
- Unnamed Item
- Edge disjoint placement of graphs
- On a graph packing conjecture by Bollobás, Eldridge and Catlin
- 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
- Note on Hamilton Circuits
- Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
- Some Theorems on Abstract Graphs
This page was built for publication: An Ore-type analogue of the Sauer-Spencer theorem
