Tough spiders

DOI10.1002/JGT.20244MaRDI QIDQ5434242zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

Hamilton cyclesinterval graphsmatroidssplit graphstoughness

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 125465
• Toughness, hamiltonicity and split graphs
• Publication:3201076
• scientific article; zbMATH DE number 2038756
• Spiders everywhere

Cited in

(18)

• Long paths and toughness of \(k\)-trees and chordal planar graphs
• On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices
• Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
• Spiders everywhere
• A note on interconnecting matchings in graphs
• Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs
• scientific article; zbMATH DE number 4177086 (Why is no real title available?)
• On non-traceable, non-hypotraceable, arachnoid graphs
• scientific article; zbMATH DE number 6537750 (Why is no real title available?)
• scientific article; zbMATH DE number 125465 (Why is no real title available?)
• scientific article; zbMATH DE number 1123806 (Why is no real title available?)
• scientific article; zbMATH DE number 2038756 (Why is no real title available?)
• On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
• Chvátal's \(t_{0}\)-tough conjecture
• Toughness and Hamiltonicity of strictly chordal graphs
• Forbidden subgraphs and 2‐factors in 3/2‐tough graphs
• Spider web graphs
• Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs

This page was built for publication: Tough spiders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434242)