Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
type: Item
instance of: scholarly article
title: Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
zbMATH Open document ID: 1251.05034
author: Katsuhiro Ota
author: Kenta Ozeki
published in: Journal of Combinatorial Theory. Series B
publication date: 2012-10-19T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 6095995
zbMATH Keywords: \(K_{3,t}\)-minor-free graphs
zbMATH Keywords: spanning trees
zbMATH Keywords: graphs on a surface
MaRDI profile type: Publication
full work available at URL: j.jctb.2012.07.002
OpenAlex ID: W1754791329
cites work: Trees in Polyhedral Graphs
cites work: 3-trees in polyhedral maps
cites work: Spanning planar subgraphs of graphs in the torus and Klein bottle
cites work: Toughness of \(K_{a,t}\)-minor-free graphs
cites work: The circumference of a graph with no \(K_{3,t}\)-minor
cites work: Long cycles in 3-connected graphs
cites work: Q4390602
cites work: Spanning trees in locally planar triangulations
cites work: Q4170745
cites work: A theorem on n-connected graphs
cites work: Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen
cites work: Subgraphs of graphs on surfaces with high representativity
cites work: Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
cites work: Simple paths on polyhedra
cites work: 3-trees with few vertices of degree 3 in circuit graphs
cites work: Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
cites work: On spanning trees and walks of low maximum degree
cites work: A theorem on paths in planar graphs
cites work: Trees in triangulations
cites work: A Theorem on Planar Graphs
cites work: Disjoint paths, planarizing cycles, and spanning walks
DOI: 10.1016/J.JCTB.2012.07.002
description: scientific article; zbMATH DE number 6095995