2-connected spanning subgraphs of planar 3-connected graphs
From MaRDI portal
(Redirected from Publication:1333340)
In 1966, the author proved that every 3-connected planar graph has a spanning subgraph that is a tree of maximum valency 3; see [Can. J. Math. 18, 731-736 (1966; Zbl 0141.214)]. The present paper contains a proof that in every 3-connected planar graph there is a 2-connected spanning subgraph of maximum valency 15. An example is given of a 3-connected planar graph with no 2-connected spanning subgraph of maximum valency 5.
Recommendations
- Connected spanning subgraphs of 3-connected planar graphs
- On the two-connected planar spanning subgraph polytope
- On finding two-connected subgraphs in planar graphs
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs
- Spanning even subgraphs of 3‐edge‐connected graphs
- Two-edge connected spanning subgraphs and polyhedra
- Spanning Eulerian subgraphs of 2-edge-connected graphs
- Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
- Connected subgraphs with small degree sums in 3-connected planar graphs
- The \(k\)-subconnectedness of planar graphs
Cited in
(29)- On 2-connected spanning subgraphs with low maximum degree
- On spanning subgraphs of 4-connected planar graphs
- On finding two-connected subgraphs in planar graphs
- Subgraphs of graphs on surfaces with high representativity
- On \(3\)-connected plane graphs without triangular faces
- Long cycles in graphs on a fixed surface
- Coloring the faces of convex polyhedra so that like colors are far apart
- On spanning trees without vertices of degree 2 in plane triangulations
- Polyline drawings with topological constraints
- Spanning subgraphs with specified valencies. (Reprint)
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
- Face-width of embedded graphs
- Spanning trees in subcubic graphs.
- Unicyclic subgraphs in 2-connected graphs
- Spanning even subgraphs of 3‐edge‐connected graphs
- On the frequency of 3-connected subgraphs of planar graphs
- A Dirac theorem for trestles
- 2‐connected coverings of bounded degree in 3‐connected graphs
- Polyline Drawings with Topological Constraints
- Existence of spanning 3-trees in a 3-connected locally finite VAP-free plane graph
- Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
- scientific article; zbMATH DE number 2226729 (Why is no real title available?)
- Enumerative properties of rooted circuit maps
- Rooted minors and locally spanning subgraphs
- 2-connected spanning subgraphs of circuit graphs
- Toward Grünbaum's conjecture
- Toward Grünbaum's conjecture bounding vertices of degree 4
- Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs
This page was built for publication: 2-connected spanning subgraphs of planar 3-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333340)
