Toughness threshold for the existence of 2-walks in K4-minor free graphs

Abstract

We establish the optimal bound for toughness that guarantees the existence of a 2-walk in a graph that does not contain K4 as a minor.

Keywords

• toughness
• 2-walk
• series-parallel graphs