Pages that link to "Item:Q1427178"
From MaRDI portal
The following pages link to A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. (Q1427178):
Displaying 5 items.
- A lower bound on the Hamiltonian path completion number of a line graph (Q902504) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a tree (Q1603430) (← links)
- Evolutionary operators for the Hamiltonian completion problem (Q2156924) (← links)
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251) (← links)
- Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
