Computing 2-Walks in Polynomial Time

DOI10.1145/3183368zbMath1458.05126OpenAlexW2801537393MaRDI QIDQ4554349

Jens M. Schmidt, Andreas Schmid

Publication date: 13 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/4950/

zbMATH Keywords

3-connected planar graphs2-walksTutte paths3-trees

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (2)

Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Unnamed Item

This page was built for publication: Computing 2-Walks in Polynomial Time