Counting closed trails

DOI10.1016/J.IPL.2012.09.006MaRDI QIDQ1941684zbMATH OpenOpenAlexFDO

Authors Andreas Björklund, Petteri Kaski

Publication date 21 March 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2012.09.006

zbMATH Keywords

Hamiltonian pathgraph algorithmsclaw-free graphclosed trail

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Connectivity (05C40)

Recommendations

• Exact algorithms for finding longest cycles in claw-free graphs
• Counting independent sets in claw-free graphs
• Fast exact algorithms for Hamiltonicity in claw-free graphs
• On stability of the spanning trial under the closure
• scientific article; zbMATH DE number 749257

Cited in

(1)

• Exact algorithms for finding longest cycles in claw-free graphs

This page was built for publication: Counting closed trails

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