|
|||||
|
|
On 2-walks in chordal planar graphs |
|
| Authors: | Jakub Teska |
| Institution: | Department of Mathematics, University of West Bohemia and Institute for Theoretical Computer Sciences, Univerzitní 8, 306 14 Plzeň, Czech Republic School of Information Technology and Mathematical Sciences, University of Ballarat, VIC 3353, Australia |
| 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 G with toughness  has a 2-walk. |
| Keywords: | 2-walk Toughness Chordal planar graph |
| 本文献已被 ScienceDirect 等数据库收录！ | |