Toughness of K_a,t-minor-free graphs

MaRDI QIDQ554002zbMATH OpenFDO

Authors Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, 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, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p148.html

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

Mathematics Subject Classification ID

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

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

Cited in

(12)

• Maximum and minimum toughness of graphs of small genus
• Labeled \(K_{2,t}\) minors in plane graphs
• The circumference of a graph with no \(K_{3,t}\)-minor. II
• Properties of minimally \(t\)-tough graphs
• Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
• A characterization of \(K_{2,4}\)-minor-free graphs
• Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
• Toughness and spanning trees in K4‐minor‐free graphs
• Spanning trees: A survey
• Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
• Uniform polynomial kernel for deletion to \(K_{2,p}\) minor-free graphs
• Toughness threshold for the existence of 2-walks in \(K_{4}\)-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)