The following pages link to (Q3921262):
Displaying 15 items.
- Graph invariants and large cycles: a survey (Q539347) (← links)
- Degree bounded spanning trees (Q605003) (← links)
- Extending cycles in graphs (Q750461) (← links)
- The \(k\)-dominating cycles in graphs (Q966170) (← links)
- Dirac-type generalizations concerning large cycles in graphs (Q1025445) (← links)
- On a conjecture of Bondy (Q1065023) (← links)
- On a generalization of a theorem of Nash-Williams (Q1179465) (← links)
- Bridges of longest cycles (Q1262875) (← links)
- Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture (Q1356730) (← links)
- Long cycles through a linear forest (Q1850534) (← links)
- Uniqueness and minimality of large face-width embeddings of graphs (Q1906851) (← links)
- A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture (Q2221920) (← links)
- Enumeration of BC-subtrees of trees (Q2344772) (← links)
- A degree sum condition for long cycles passing through a linear forest (Q2427497) (← links)
- Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path (Q2971135) (← links)
