scientific article; zbMATH DE number 1420921

MaRDI QIDQ4944993zbMATH OpenFDO

Authors Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler

Publication date 7 June 2000

zbMATH Keywords

Hamiltonian cycleHamiltonian pathclaw-free graphslinear time algorithmsdominating cycledominating paths

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs
• Fast exact algorithms for Hamiltonicity in claw-free graphs
• scientific article; zbMATH DE number 147654
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
• On Hamiltonicity of \{claw, net\}-free graphs
• Hamiltonian problem on claw-free and almost distance-hereditary graphs
• On \(s\)-Hamiltonian line graphs of claw-free graphs
• Extremal problems on the Hamiltonicity of claw-free graphs
• On Hamiltonian claw-free graphs
• Linear-time algorithms for eliminating claws in graphs

Cited in

(6)

• On claw-free asteroidal triple-free graphs
• Exact algorithms for finding longest cycles in claw-free graphs
• On linear and circular structure of (claw, net)-free graphs
• On Hamiltonicity of \{claw, net\}-free graphs
• Fast exact algorithms for Hamiltonicity in claw-free graphs
• Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944993)