Pages that link to "Item:Q1096650"
From MaRDI portal
The following pages link to A generalization of a result of Häggkvist and Nicoghossian (Q1096650):
Displayed 10 items.
- Computation of the 0-dual closure for hamiltonian graphs (Q686512) (← links)
- Edge bounds in nonhamiltonian \(k\)-connected graphs (Q879332) (← links)
- A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs (Q1306429) (← links)
- On the length of longest dominating cycles in graphs (Q1309474) (← links)
- A generalization of a result of Bauer and Schmeichel (Q1313355) (← links)
- Cycles through subsets with large degree sums (Q1363686) (← links)
- A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs (Q1896341) (← links)
- Degree sum and connectivity conditions for dominating cycles (Q2477385) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- A Remark on Hamiltonian Cycles (Q4024478) (← links)