Pages that link to "Item:Q2558871"
From MaRDI portal
The following pages link to Tough graphs and Hamiltonian circuits. (Q2558871):
Displaying 6 items.
- On approximating the longest path in a graph (Q679451) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Recognizing tough graphs is NP-hard (Q918697) (← links)
- On a class of posets and the corresponding comparability graphs (Q1247984) (← links)
- On Toughness and Hamiltonicity of 2<i>K</i><sub>2</sub>‐Free Graphs (Q5417820) (← links)
- Edmonds polytopes and weakly hamiltonian graphs (Q5685112) (← links)
