A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture
From MaRDI portal
Publication:2221920
DOI10.1016/j.jctb.2020.08.003zbMath1457.05057arXiv2002.04198OpenAlexW3104754894MaRDI QIDQ2221920
Publication date: 3 February 2021
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.04198
Related Items (1)
Cites Work
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Stability results on the circumference of a graph
- On a conjecture of Bondy
- Relative lengths of paths and cycles in k-connected graphs
- Subgraph coverings and edge switchings
- On a conjecture of Woodall
- Large cycles in graphs
- Heavy cycles passing through some specified vertices in weighted graphs
- On maximal paths and circuits of graphs
- The longest cycle of a graph with a large minimal degree
- A degree condition for the circumference of a graph
- On graphs with randomly deleted edges
- [https://portal.mardi4nfdi.de/wiki/Publication:4506067 On the Loebl-Koml�s-S�s conjecture]
- Some Theorems on Abstract Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture