The following pages link to A simple proof of a theorem of Jung (Q918991):
Displaying 5 items.
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- Long cycles in graphs with large degree sums (Q749553) (← links)
- Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360) (← links)
- On one extension of Dirac's theorem on Hamiltonicity (Q1630770) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
