Pages that link to "Item:Q1169818"
From MaRDI portal
The following pages link to The edge Hamiltonian path problem is NP-complete (Q1169818):
Displayed 15 items.
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers (Q1025522) (← links)
- Finding Hamiltonian circuits in proper interval graphs (Q1050117) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Finding Hamiltonian circuits in interval graphs (Q1066674) (← links)
- Hamiltonian circuits in interval graph generalizations (Q1092669) (← links)
- The edge Hamiltonian path problem is NP-complete for bipartite graphs (Q1210313) (← links)
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs (Q1297424) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a tree (Q1603430) (← links)
- Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
- Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs (Q3439140) (← links)