Pages that link to "Item:Q749553"
From MaRDI portal
The following pages link to Long cycles in graphs with large degree sums (Q749553):
Displaying 34 items.
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779) (← links)
- Graph invariants and large cycles: a survey (Q539347) (← links)
- Long cycles in graphs with large degree sums (Q749553) (← links)
- \(k\)-factors and Hamilton cycles in graphs (Q884893) (← links)
- Recognizing tough graphs is NP-hard (Q918697) (← links)
- A simple proof of a theorem of Jung (Q918991) (← links)
- A generalization of a result of Häggkvist and Nicoghossian (Q1096650) (← links)
- Hamiltonian properties of graphs with large neighborhood unions (Q1182981) (← links)
- Long cycles, degree sums and neighborhood unions (Q1309446) (← links)
- All nonhamiltonian tough graphs satisfying a 3-degree sum and Fan-type conditions (Q1309456) (← links)
- On the length of longest dominating cycles in graphs (Q1309474) (← links)
- A generalization of a result of Bauer and Schmeichel (Q1313355) (← links)
- On the complexity of recognizing tough graphs (Q1313820) (← links)
- A generalization of Ore's Theorem involving neighborhood unions (Q1313847) (← links)
- Long cycles in graphs containing a 2-factor with many odd components (Q1343811) (← links)
- 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
- Cycles through subsets with large degree sums (Q1363686) (← links)
- Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360) (← links)
- Degree sums, \(k\)-factors and Hamilton cycles in graphs (Q1805370) (← links)
- Long cycles in graphs with prescribed toughness and minimum degree (Q1894753) (← links)
- A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs (Q1896341) (← links)
- Cycles through prescribed vertices with large degree sum (Q1901041) (← links)
- Circumferences in 1-tough graphs (Q1903725) (← links)
- A note on dominating cycles in 2-connected graphs (Q1923475) (← links)
- On Hamiltonian cycles in balanced \(k\)-partite graphs (Q1981710) (← links)
- An Ore-type condition for Hamiltonicity in tough graphs (Q2073293) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Hamiltonian cycles in 1-tough graphs (Q2563428) (← links)
- Toughness, Hamiltonicity and spectral radius in graphs (Q2701002) (← links)
- Relative length of longest paths and cycles in 3-connected graphs (Q2746207) (← links)
- Binding Number, Minimum Degree, and Cycle Structure in Graphs (Q2911065) (← links)
- Hamiltonicity in Partly claw-free graphs (Q3621979) (← links)
- Hamiltonian cycles in <i>n</i>‐extendable graphs (Q4539871) (← links)
- (Q5708558) (← links)
