Toughness of K_a,t-minor-free graphs

zbMATH Open1222.05239MaRDI QIDQ554002FDOQ554002

Ken-ichi Kawarabayashi, Yoshimi Egawa, Guantao Chen, Bojan Mohar, Katsuhiro Ota

Publication date: 29 July 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/229231

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Toughness and spanning trees in K4‐minor‐free graphs
• The circumference of a graph with no \(K_{3,t}\)-minor
• On a connection between the existence of k-trees and the toughness of a graph
• Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs
• Maximum and minimum toughness of graphs of small genus

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)

Cited In (8)

• Labeled \(K_{2,t}\) minors in plane graphs
• Spanning trees: A survey
• Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
• Toughness and spanning trees in K4‐minor‐free graphs
• A characterization of \(K_{2,4}\)-minor-free graphs
• Properties of minimally \(t\)-tough graphs
• Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
• Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs

This page was built for publication: Toughness of \(K_{a,t}\)-minor-free graphs

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