| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649337 | Discrete Mathematics | 2009 | 10 Pages |
Abstract
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 GG with toughness t(G)>34 has a 2-walk.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jakub Teska,