Characterization of k-subconnected graphs

DOI10.1016/J.AMC.2019.124620MaRDI QIDQ2284049zbMATH OpenOpenAlexWikidataFDO

Authors Zongrong Qin, Dingjun Lou, Huiquan Zhu, Jun Liang

Publication date 14 January 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2019.124620

zbMATH Keywords

\(K\)-subconnected graph\(M\)-alternating treecomponentscutsetdisjoint paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• The \(k\)-subconnectedness of planar graphs
• On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
• scientific article; zbMATH DE number 1960407
• On the structure of a k-connected graph
• The tree of cuts and minimal \(k\)-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
• Algorithm Theory - SWAT 2004
• An efficient algorithm for cyclic edge connectivity of regular graphs.
• Characterization of graphs with infinite cyclic edge connectivity
• Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
• Graph theory with applications
• Highly linked graphs
• Highly linked tournaments
• 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

(3)

• The \(k\)-subconnectedness of planar graphs
• scientific article; zbMATH DE number 1960407 (Why is no real title available?)
• Strong subgraph k‐connectivity

This page was built for publication: Characterization of \(k\)-subconnected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284049)