The k-subconnectedness of planar graphs

DOI10.3934/MATH.2021340zbMATH Open1484.05117OpenAlexW3140179431MaRDI QIDQ2133309FDOQ2133309

Authors: Zongrong Qin, Dingjun Lou 

Publication date: 29 April 2022

Published in: AIMS Mathematics (Search for Journal in Brave)

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

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

zbMATH Keywords

componentplanar graph\(k\)-connected graphindependent paths\(k\)-subconnected graph

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications
• Title not available (Why is that?)
• 2-linked graphs
• A Theorem on Planar Graphs
• Highly linked graphs
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• On several sorts of connectivity
• An efficient algorithm for cyclic edge connectivity of regular graphs.
• A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
• Algorithm Theory - SWAT 2004
• Characterization of \(k\)-subconnected graphs
• A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
• An improved algorithm for cyclic edge connectivity of regular graphs.
• A square time algorithm for cyclic edge connectivity of planar graphs.

Cited In (13)

• Edges and Kuratowski Subgraphs of Non-Planar Graphs
• On finding two-connected subgraphs in planar graphs
• Characterization of \(k\)-subconnected graphs
• 2-connected spanning subgraphs of planar 3-connected graphs
• Spanning planar subgraphs of graphs in the torus and Klein bottle
• The Planar Slope Number of Subcubic Graphs
• Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
• 2-connected spanning subgraphs of circuit graphs
• Bounds on path connectivity
• The chromatic connectivity of graphs
• On the structure of essentially-highly-connected polyhedral graphs
• The radius of \(k\)-connected planar graphs with bounded faces
• 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)