Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs

DOI10.1016/j.jctb.2012.07.002zbMath1251.05034MaRDI QIDQ713980

Katsuhiro Ota, Kenta Ozeki

Publication date: 19 October 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2012.07.002

zbMATH Keywords

spanning trees; \(K_{3,t}\)-minor-free graphs; graphs on a surface

Mathematics Subject Classification ID

05C05: Trees

05C83: Graph minors

05C07: Vertex degrees

Related Items

Unnamed Item, Spanning trees: A survey, Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey, A Characterization of $K_{2,4}$-Minor-Free Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Toughness of \(K_{a,t}\)-minor-free graphs
• The circumference of a graph with no \(K_{3,t}\)-minor
• 3-trees with few vertices of degree 3 in circuit graphs
• Trees in triangulations
• Spanning trees in locally planar triangulations
• Subgraphs of graphs on surfaces with high representativity
• 3-trees in polyhedral maps
• Long cycles in 3-connected graphs
• Spanning planar subgraphs of graphs in the torus and Klein bottle
• Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Simple paths on polyhedra
• Spanning trees in 3-connected K3,t-minor-free graphs
• Disjoint paths, planarizing cycles, and spanning walks
• A Theorem on Planar Graphs
• Trees in Polyhedral Graphs
• A theorem on n-connected graphs
• A theorem on paths in planar graphs