The following pages link to (Q3782804):
Displaying 5 items.
- The NPO-completeness of the longest Hamiltonian cycle problem (Q293205) (← links)
- Hamiltonian index is NP-complete (Q629366) (← links)
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs (Q685527) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Toughness, hamiltonicity and split graphs (Q1916113) (← links)