Pages that link to "Item:Q628259"
From MaRDI portal
The following pages link to Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259):
Displaying 11 items.
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Cyclability in graph classes (Q833007) (← links)
- The Steiner cycle and path cover problem on interval graphs (Q2075469) (← links)
- The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy (Q2181262) (← links)
- Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
- Complexity of Steiner Tree in Split Graphs - Dichotomy Results (Q2795958) (← links)
- Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
- Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
- On the path partition number of 6‐regular graphs (Q6057632) (← links)
- 2-Trees: Structural insights and the study of Hamiltonian paths (Q6132868) (← links)
