Graphs containing every 2-factor
From MaRDI portal
Publication:1926028
DOI10.1007/s00373-011-1066-6zbMath1256.05118OpenAlexW2006747488MaRDI QIDQ1926028
Gexin Yu, Alexandr V. Kostochka
Publication date: 27 December 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-011-1066-6
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Cycles of Given Size in a Dense Graph ⋮ Degree sum conditions on two disjoint cycles in graphs ⋮ An Ore-type theorem on Hamiltonian square cycles ⋮ Fan-type condition on disjoint cycles in a graph ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ An Ore-type condition for the existence of two disjoint cycles ⋮ Embedding Graphs Having Ore-Degree at Most Five
Cites Work
- Edge disjoint placement of graphs
- Ore-type versions of Brooks' theorem
- Ore-type conditions implying 2-factors consisting of short cycles
- 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
- Embedding Arbitrary Graphs of Maximum Degree Two
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
