scientific article; zbMATH DE number 7561516

DOI10.4230/LIPIcs.ICALP.2019.23MaRDI QIDQ5091172

Philipp Kindermann, Therese C. Biedl

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1812.04543

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

planar graphHamiltonian pathlinear time2-walkTutte path

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simpler proof for the two disjoint odd cycles theorem
• A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
• Bridges and Hamiltonian circuits in planar graphs
• 4-connected projective planar graphs are Hamiltonian
• 2-walks in circuit graphs
• Computing 2-Walks in Polynomial Time
• $1$-string $B_2$-VPG representation of planar graphs
• Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs
• Computing 2-Walks in Polynomial Time
• Dividing a Graph into Triconnected Components
• Computing Tutte Paths
• Trees in Polyhedral Graphs
• A theorem on paths in planar graphs

This page was built for publication: