Title of article
On 2-walks in chordal planar graphs
Author/Authors
Teska، نويسنده , , Jakub، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
10
From page
4017
To page
4026
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 t ( G ) > 3 4 has a 2-walk.
Keywords
Chordal planar graph , 2-walk , Toughness
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598898
Link To Document