The following pages link to (Q3703921):
Displaying 12 items.
- Stability in the Erdős-Gallai theorems on cycles and paths (Q326812) (← links)
- Weakly bipancyclic bipartite graphs (Q494430) (← links)
- Ramsey numbers of long cycles versus books or wheels (Q966139) (← links)
- Cycles through 4 vertices in 3-connected graphs (Q998493) (← links)
- Longest paths joining given vertices in a graph (Q1088682) (← links)
- Extremal 3-connected graphs (Q1106857) (← links)
- On a generalization of a theorem of Nash-Williams (Q1179465) (← links)
- On the circumferences of regular 2-connected graphs (Q1306425) (← links)
- Long cycles through a linear forest (Q1850534) (← links)
- A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture (Q2221920) (← links)
- A degree sum condition for long cycles passing through a linear forest (Q2427497) (← links)
- Claw-free graphs and 2-factors that separate independent vertices (Q2891039) (← links)