The following pages link to (Q4873795):
Displayed 16 items.
- Long cycles in graphs with large degree sums (Q749553) (← links)
- A simple proof of a theorem of Jung (Q918991) (← links)
- Bipartite toughness and \(k\)-factors in bipartite graphs (Q1008540) (← links)
- Bounds on the size of graphs of given order and \(l\)-connectivity (Q1292831) (← links)
- Long cycles, degree sums and neighborhood unions (Q1309446) (← links)
- 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
- Long cycles in graphs with prescribed toughness and minimum degree (Q1894753) (← links)
- Toughness, hamiltonicity and split graphs (Q1916113) (← links)
- A note on dominating cycles in 2-connected graphs (Q1923475) (← links)
- Chordality and 2-factors in tough graphs (Q1962052) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- On the Toughness of Cycle Permutation Graphs (Q2760959) (← links)
- Updating the hamiltonian problem—A survey (Q3978362) (← links)
- Toughness, minimum degree, and the existence of 2‐factors (Q4290577) (← links)
- Toughness, minimum degree, and the existence of 2‐factors (Q4309982) (← links)
- (Q5708558) (← links)