The following pages link to (Q4808624):
Displaying 6 items.
- Hamilton cycles in almost distance-hereditary graphs (Q317825) (← links)
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs (Q685527) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
- An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs (Q3590946) (← links)
- Dynamic Distance Hereditary Graphs Using Split Decomposition (Q5387744) (← links)
