Spanning trees in 3-connected K3,t-minor-free graphs
From MaRDI portal
Publication:2851454
DOI10.1016/j.endm.2009.07.024zbMath1273.05042OpenAlexW1988810431MaRDI QIDQ2851454
Publication date: 10 October 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.024
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)
Related Items (3)
Rooted minors and locally spanning subgraphs ⋮ Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs ⋮ Spanning \(k\)-ended trees in quasi-claw-free graphs
Cites Work
- 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
- Simple paths on polyhedra
- A Theorem on Planar Graphs
- Trees in Polyhedral Graphs
- A theorem on paths in planar graphs
This page was built for publication: Spanning trees in 3-connected K3,t-minor-free graphs