Pages that link to "Item:Q2566023"

The following pages link to Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023):

Displaying 24 items.

• 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)
• Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
• A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
• Distance-hereditary comparability graphs (Q1759843) (← links)
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
• A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
• Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
• The Hamiltonian problem on distance-hereditary graphs (Q2489947) (← links)
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
• Hamiltonicity in Split Graphs - A Dichotomy (Q2971662) (← links)
• The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334) (← links)
• An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs (Q3590946) (← links)
• (Q4691817) (← links)
• (Q4863482) (← links)
• (Q4944993) (← links)
• Fast and simple algorithms for counting dominating sets in distance-hereditary graphs (Q5012812) (← links)
• Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy (Q6114853) (← links)
• 2-Trees: Structural insights and the study of Hamiltonian paths (Q6132868) (← links)
• Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs (Q6488452) (← links)
• A closer look at Hamiltonicity and domination through the lens of diameter and convexity (Q6634506) (← links)