Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs

DOI10.1016/j.disc.2009.05.016zbMath1283.05154OpenAlexW2135759096WikidataQ57601443 ScholiaQ57601443MaRDI QIDQ960979

Zdeněk Dvořák, Daniel Král', Jakub Teska

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.05.016

zbMATH Keywords

series-parallel graphtoughness2-walk

Mathematics Subject Classification ID

Graph minors (05C83) Density (toughness, etc.) (05C42)

Related Items (2)

Fractional, Circular, and Defective Coloring of Series-Parallel Graphs ⋮ Toughness and spanning trees in K4‐minor‐free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding Hamiltonian circuits in interval graphs
• Advances on the Hamiltonian problem -- a survey
• Toughness, hamiltonicity and split graphs
• Not every 2-tough graph is Hamiltonian
• Chordality and 2-factors in tough graphs
• Tough graphs and Hamiltonian circuits.
• Updating the hamiltonian problem—A survey
• More than one tough chordal planar graphs are Hamiltonian
• Toughness, trees, and walks
• Tough spiders

This page was built for publication: Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs