Pages that link to "Item:Q2489947"
From MaRDI portal
The following pages link to The Hamiltonian problem on distance-hereditary graphs (Q2489947):
Displaying 16 items.
- Hamilton cycles in almost distance-hereditary graphs (Q317825) (← links)
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs (Q685527) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Cyclability in graph classes (Q833007) (← links)
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs (Q938338) (← links)
- Uniquely Hamiltonian characterizations of distance-hereditary and parity graphs (Q1010695) (← links)
- Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Parallel algorithms for Hamiltonian problems on quasi-threshold graphs (Q1878696) (← links)
- An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs (Q1881305) (← links)
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Distance problems within Helly graphs and \(k\)-Helly graphs (Q2682928) (← links)
- Fast and simple algorithms for counting dominating sets in distance-hereditary graphs (Q5012812) (← links)
