Title of article
Toughness threshold for the existence of 2-walks in -minor-free graphs
Author/Authors
Dvo??k، نويسنده , , Zden?k and Kr?l’، نويسنده , , Daniel and Teska، نويسنده , , Jakub، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
10
From page
642
To page
651
Abstract
We show that every K 4 -minor-free graph with toughness greater than 4 / 7 has a 2-walk, i.e., a closed walk visiting each vertex at most twice. We show that the bound cannot be improved by constructing a 4 / 7 -tough K 4 -minor-free graph with no 2-walk.
Keywords
2-walk , Toughness , Series–parallel graph
Journal title
Discrete Mathematics
Serial Year
2010
Journal title
Discrete Mathematics
Record number
1599279
Link To Document