Pages that link to "Item:Q5082279"
From MaRDI portal
The following pages link to A Unified Proof of Conjectures on Cycle Lengths in Graphs (Q5082279):
Displaying 15 items.
- Cycles with consecutive odd lengths (Q896065) (← links)
- A simple proof of the multiplicativity of directed cycles of prime power length (Q1193732) (← links)
- Cycle lengths and minimum degree of graphs (Q1682209) (← links)
- On a conjecture of Bondy and Vince (Q2284740) (← links)
- A unified Erdős-Pósa theorem for constrained cycles (Q2416515) (← links)
- On arithmetic progressions of cycle lengths in graphs (Q2703026) (← links)
- Cycles and paths in graphs with large minimal degree (Q3156922) (← links)
- Cycles in a graph whose lengths differ by one or two (Q4376500) (← links)
- Cycles of many lengths in Hamiltonian graphs (Q5102252) (← links)
- A Strengthening on Odd Cycles in Graphs of Given Chromatic Number (Q5157394) (← links)
- Linear cycles of consecutive lengths (Q6051045) (← links)
- Divisible subdivisions (Q6056761) (← links)
- Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two (Q6074584) (← links)
- How to build a pillar: a proof of Thomassen's conjecture (Q6170787) (← links)
- 4-Chromatic graphs have at least four cycles of length 0 mod 3 (Q6574399) (← links)
