The k-subconnectedness of planar graphs

DOI10.3934/MATH.2021340MaRDI QIDQ2133309zbMATH OpenOpenAlexFDO

Authors Zongrong Qin, Dingjun Lou

Publication date 29 April 2022

Published in AIMS Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/math.2021340

zbMATH Keywords

\(k\)-connected graph\(k\)-subconnected graphcomponentindependent pathsplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Recommendations

• Characterization of \(k\)-subconnected graphs
• Series-parallel subgraphs of planar graphs
• Bounds on path connectivity
• Subgraphs with restricted degrees of their vertices in planar graphs
• Subgraphs with restricted degrees of their vertices in planar 3-connected graphs

Cites work

• 2-linked 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.
• A Theorem on 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
• scientific article; zbMATH DE number 1161250 (Why is no real title available?)
• On several sorts of connectivity
• On Sufficient Degree Conditions for a Graph to be k-linked

Cited in

(14)

• The chromatic connectivity of graphs
• Submaps of maps. II: Cyclically k-connected planar cubic maps
• Independent trees in planar graphs
• 2-connected spanning subgraphs of planar 3-connected graphs
• Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
• On finding two-connected subgraphs in planar graphs
• The radius of k-connected planar graphs with bounded faces
• Spanning planar subgraphs of graphs in the torus and Klein bottle
• On the structure of essentially-highly-connected polyhedral graphs
• Characterization of \(k\)-subconnected graphs
• Edges and Kuratowski Subgraphs of Non-Planar Graphs
• The Planar Slope Number of Subcubic Graphs
• 2-connected spanning subgraphs of circuit graphs
• Bounds on path connectivity

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)