The \(k\)-subconnectedness of planar graphs

DOI10.3934/math.2021340zbMath1484.05117OpenAlexW3140179431MaRDI QIDQ2133309

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

zbMATH Keywords

planar graphcomponentindependent paths\(k\)-connected graph\(k\)-subconnected graph

Mathematics Subject Classification ID

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

Cites Work

• On several sorts of connectivity
• 2-linked graphs
• Characterization of \(k\)-subconnected graphs
• A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
• Highly linked graphs
• A Theorem on Planar Graphs
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
• Algorithm Theory - SWAT 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The \(k\)-subconnectedness of planar graphs