Spanning trees in 3-connected K₃,t-minor-free graphs
From MaRDI portal
Publication:713980
Recommendations
Cites work
- 3-trees in polyhedral maps
- 3-trees with few vertices of degree 3 in circuit graphs
- A theorem on n-connected graphs
- A theorem on paths in planar graphs
- A Theorem on Planar Graphs
- Disjoint paths, planarizing cycles, and spanning walks
- Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen
- scientific article; zbMATH DE number 3604926 (Why is no real title available?)
- scientific article; zbMATH DE number 1156578 (Why is no real title available?)
- Long cycles in 3-connected graphs
- On spanning trees and walks of low maximum degree
- Simple paths on polyhedra
- Spanning planar subgraphs of graphs in the torus and Klein bottle
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- Spanning trees in locally planar triangulations
- Subgraphs of graphs on surfaces with high representativity
- The circumference of a graph with no \(K_{3,t}\)-minor
- Toughness of \(K_{a,t}\)-minor-free graphs
- Trees in Polyhedral Graphs
- Trees in triangulations
- Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen
Cited in
(15)- A note on a spanning 3-tree
- 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
- TREE-WEIGHTED NEIGHBORS AND GEOMETRIC k SMALLEST SPANNING TREES
- scientific article; zbMATH DE number 1457282 (Why is no real title available?)
- On zero-one and convergence laws for graphs embeddable on a fixed surface
- scientific article; zbMATH DE number 6770068 (Why is no real title available?)
- Existence of spanning 3-trees in a 3-connected locally finite VAP-free plane graph
- Toughness and spanning trees in K4‐minor‐free graphs
- A note on highly connected \(K_{2, \ell}\)-minor free graphs
- Spanning trees: A survey
- Toward Grünbaum's conjecture
- Toward Grünbaum's conjecture bounding vertices of degree 4
- Uniform polynomial kernel for deletion to \(K_{2,p}\) minor-free graphs
This page was built for publication: Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q713980)