Pages that link to "Item:Q989586"
From MaRDI portal
The following pages link to A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586):
Displaying 11 items.
- Graphs generalizing closed curves with linear construction of the Hamiltonian cycle (Q673065) (← links)
- A data structure useful for finding Hamiltonian cycles (Q909446) (← links)
- An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals (Q915465) (← links)
- Finding Hamiltonian circuits in interval graphs (Q1066674) (← links)
- Proper interval graphs and the guard problem (Q1363667) (← links)
- The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy (Q2181262) (← links)
- Sitting closer to friends than enemies, revisited (Q2345988) (← links)
- Complexity of Hamiltonian cycle reconfiguration (Q2633261) (← links)
- Complexity of Steiner Tree in Split Graphs - Dichotomy Results (Q2795958) (← links)
- Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
- 2-Trees: Structural insights and the study of Hamiltonian paths (Q6132868) (← links)
