On 2-walks in chordal planar graphs

A 2-walk is a closed spanning trail which uses every vertex at most twice. A graph is said to be chordal if each cycle different from a 3-cycle has a chord. We prove that every chordal planar graph G with toughness t ( G ) > 3 4 has a 2-walk.