Tough spiders
From MaRDI portal
Publication:5434242
DOI10.1002/jgt.20244zbMath1128.05033OpenAlexW4233116492WikidataQ57601525 ScholiaQ57601525MaRDI QIDQ5434242
Tomáš Kaiser, Ladislav Stacho, Daniel Král'
Publication date: 4 January 2008
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20244
Related Items (9)
Long paths and toughness of \(k\)-trees and chordal planar graphs ⋮ Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs ⋮ Toughness and Hamiltonicity of strictly chordal graphs ⋮ Forbidden subgraphs and 2‐factors in 3/2‐tough graphs ⋮ On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices ⋮ Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs ⋮ On Toughness and Hamiltonicity of 2K2‐Free Graphs ⋮ A note on interconnecting matchings in graphs ⋮ Chvátal’s t 0-Tough Conjecture
Cites Work
This page was built for publication: Tough spiders
