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

DOI10.1016/J.DISC.2009.05.016MaRDI QIDQ960979zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

2-walkseries-parallel graphtoughness

Mathematics Subject Classification ID

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

Recommendations

• Toughness, trees, and walks
• scientific article; zbMATH DE number 786140
• On 2-walks in chordal planar graphs
• Toughness of \(K_{a,t}\)-minor-free graphs
• Forbidden subgraphs and the existence of a 2-walk

Cites work

• Advances on the Hamiltonian problem -- a survey
• Chordality and 2-factors in tough graphs
• Finding Hamiltonian circuits in interval graphs
• scientific article; zbMATH DE number 68918 (Why is no real title available?)
• scientific article; zbMATH DE number 566078 (Why is no real title available?)
• scientific article; zbMATH DE number 1124477 (Why is no real title available?)
• scientific article; zbMATH DE number 1536530 (Why is no real title available?)
• More than one tough chordal planar graphs are Hamiltonian
• Not every 2-tough graph is Hamiltonian
• Tough graphs and Hamiltonian circuits.
• Tough spiders
• Toughness, hamiltonicity and split graphs
• Toughness, trees, and walks
• Updating the hamiltonian problem—A survey

Cited in

(7)

• Fractional, circular, and defective coloring of series-parallel graphs
• Toughness, trees, and walks
• Toughness of \(K_{a,t}\)-minor-free graphs
• Vertex partitions of \(K_{4,4}\)-minor free graphs
• Toughness and spanning trees in K4‐minor‐free graphs
• Signed circuit 6-covers of signed K₄-minor-free graphs
• On K₄-minor free graphs whose second largest eigenvalue does not exceed 1

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

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