Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
From MaRDI portal
Publication:4978446
DOI10.1002/jgt.22106zbMath1368.05079arXiv1602.02461OpenAlexW2963218121MaRDI QIDQ4978446
Andrew McConvey, Henry A. Kierstead, Alexandr V. Kostochka
Publication date: 10 August 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.02461
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)
Related Items (2)
Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ A Sharp Dirac–Erdős Type Bound for Large Graphs
Cites Work
- On directed versions of the Corrádi-Hajnal corollary
- A refinement of a result of Corrádi and Hajnal
- On the maximum number of independent cycles in a graph
- On the existence of disjoint cycles in a graph
- Sharpening an ore-type version of the Corrádi-Hajnal theorem
- Minimum degree conditions for vertex-disjoint even cycles in large graphs
- An Ore-type theorem on equitable coloring
- An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs
- On Directed Versions of the Hajnal–Szemerédi Theorem
- Some Results Concerning the Structure of Graphs
- On the maximal number of independent circuits in a graph
- On the maximal number of independent circuits in a graph
- Independent directed triangles in a directed graph
This page was built for publication: Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
