Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs
type: Item
instance of: scholarly article
title: Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs
zbMATH Open document ID: 1283.05154
author: Zdeněk Dvořák
author: Daniel Král'
author: Jakub Teska
published in: Discrete Mathematics
publication date: 2010-03-29T00:00:00Z
Mathematics Subject Classification ID: 05C42
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 5687600
zbMATH Keywords: toughness
zbMATH Keywords: 2-walk
zbMATH Keywords: series-parallel graph
Wikidata QID: Q57601443
MaRDI profile type: Publication
full work available at URL: j.disc.2009.05.016
OpenAlex ID: W2135759096
cites work: Not every 2-tough graph is Hamiltonian
cites work: Chordality and 2-factors in tough graphs
cites work: Q4291429
cites work: More than one tough chordal planar graphs are Hamiltonian
cites work: Q4378526
cites work: Tough graphs and Hamiltonian circuits.
cites work: Toughness, trees, and walks
cites work: Updating the hamiltonian problem—A survey
cites work: Advances on the Hamiltonian problem -- a survey
cites work: Q4014627
cites work: Tough spiders
cites work: Finding Hamiltonian circuits in interval graphs
cites work: Toughness, hamiltonicity and split graphs
cites work: Q4518404
DOI: 10.1016/J.DISC.2009.05.016
DBLP publication ID: journals/dm/DvorakKT10
description: scientific article; zbMATH DE number 5687600