Computing 2-walks in polynomial time

DOI10.4230/LIPICS.STACS.2015.676MaRDI QIDQ2955033zbMATH OpenOpenAlexFDO

Authors Andreas Schmid, Jens M. Schmidt

Publication date 24 January 2017

Full work available at URL https://dblp.uni-trier.de/db/conf/stacs/stacs2015.html#SchmidS15

zbMATH Keywords

2-walks3-connected planar graphs3-treesalgorithmsdata structuresTutte paths

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Computing 2-walks in polynomial time
• scientific article; zbMATH DE number 786140
• 2-walks in circuit graphs
• Toughness, trees, and walks
• On 2-walks in chordal planar graphs

Cited in

(8)

• On 2-walks in chordal planar graphs
• 2-walks in circuit graphs
• The Two-Guard Polygon Walk Problem
• Computing 2-walks in polynomial time
• scientific article; zbMATH DE number 786140 (Why is no real title available?)
• Computing Tutte paths
• Finding Tutte paths in linear time
• Hamiltonian properties of polyhedra with few 3-cuts. A survey

This page was built for publication: Computing 2-walks in polynomial time

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