The k-subconnectedness of planar graphs
From MaRDI portal
Publication:2133309
Recommendations
Cites work
- scientific article; zbMATH DE number 1161250 (Why is no real title available?)
- 2-linked graphs
- A Theorem on Planar Graphs
- A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
- A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
- A square time algorithm for cyclic edge connectivity of planar graphs.
- Algorithm Theory - SWAT 2004
- An efficient algorithm for cyclic edge connectivity of regular graphs.
- An improved algorithm for cyclic edge connectivity of regular graphs.
- Characterization of \(k\)-subconnected graphs
- Graph theory with applications
- Highly linked graphs
- On Sufficient Degree Conditions for a Graph to be $k$-linked
- On several sorts of connectivity
Cited in
(13)- Edges and Kuratowski Subgraphs of Non-Planar Graphs
- Bounds on path connectivity
- The radius of \(k\)-connected planar graphs with bounded faces
- 2-connected spanning subgraphs of planar 3-connected graphs
- Spanning planar subgraphs of graphs in the torus and Klein bottle
- The chromatic connectivity of graphs
- On finding two-connected subgraphs in planar graphs
- On the structure of essentially-highly-connected polyhedral graphs
- Characterization of \(k\)-subconnected graphs
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
- The Planar Slope Number of Subcubic Graphs
- 2-connected spanning subgraphs of circuit graphs
- Submaps of maps. II: Cyclically \(k\)-connected planar cubic maps
This page was built for publication: The \(k\)-subconnectedness of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2133309)