The following pages link to Ahmed Ainouche (Q186260):
Displayed 27 items.
- \(\alpha\)-degree closures for graphs (Q658065) (← links)
- (Q803155) (redirect page) (← links)
- Four sufficient conditions for hamiltonian graphs (Q803156) (← links)
- \(\beta\)-neighborhood closures for graphs (Q1025907) (← links)
- \(\beta \)-degree closures for graphs (Q1025908) (← links)
- Dirac's type sufficient conditions for hamiltonicity and pancyclicity (Q1043808) (← links)
- Semi-independence number of a graph and the existence of Hamiltonian circuits (Q1088684) (← links)
- Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs (Q1170256) (← links)
- Quasi-claw-free graphs (Q1377703) (← links)
- 0-dual closures for several classes of graphs (Q1411106) (← links)
- Global insertion and Hamiltonicity in DCT-graphs (Q1584209) (← links)
- Hamiltonism and partially square graphs (Q1808710) (← links)
- A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs (Q1896341) (← links)
- Hamilton connectedness and the partially square graphs (Q2497487) (← links)
- Relaxations of Ore's condition on cycles (Q2500979) (← links)
- (Q3070225) (← links)
- (Q3201099) (← links)
- Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees (Q3731630) (← links)
- An improvement of fraisse's sufficient condition for hamiltonian graphs (Q4016020) (← links)
- (Q4211743) (← links)
- (Q4712021) (← links)
- Insertible vertices, neighborhood intersections, and hamiltonicity (Q4852399) (← links)
- A short proof of a theorem on Hamiltonian graphs (Q4879170) (← links)
- Power contamination and domination on the grid (Q5012075) (← links)
- Variations on a sufficient condition for Hamiltonian graphs (Q5443837) (← links)
- Extension of several sufficient conditions for Hamiltonian graphs (Q5492683) (← links)
- Cycles in partially square graphs (Q5936087) (← links)