Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs
From MaRDI portal
Publication:2706129
DOI10.1137/S0097539799357775zbMath0973.05051MaRDI QIDQ2706129
Ekkehard Köhler, Andreas Brandstädt, Feodor F. Dragan
Publication date: 19 March 2001
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Hamiltonian cycleHamiltonian pathclaw-free graphslinear time algorithmsdominating path(claw, net)-free graphsdominating pair
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (11)
On independent vertex sets in subclasses of apple-free graphs ⋮ Unnamed Item ⋮ On linear and circular structure of (claw, net)-free graphs ⋮ On Hamiltonicity of \{claw, net\}-free graphs ⋮ Induced matchings in asteroidal triple-free graphs ⋮ Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs ⋮ On distance-3 matchings and induced matchings ⋮ Hamiltonian problem on claw-free and almost distance-hereditary graphs ⋮ Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers ⋮ Kernelization of Graph Hamiltonicity: Proper $H$-Graphs ⋮ On Distance-3 Matchings and Induced Matchings
This page was built for publication: Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs
