Algorithms for finding a maximum non-k-linked graph

DOI10.1137/110846725MaRDI QIDQ2910937zbMATH OpenOpenAlexFDO

Authors Yusuke Kobayashi, Yuichi Yoshida

Publication date 12 September 2012

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/110846725

zbMATH Keywords

\(k\)-linkednessmaximum induced subgraphvertex-connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Algorithms for finding a maximum non-\(k\)-linked graph
• Highly linked graphs
• Highly connected non-2-linked digraphs
• Disjoint paths in decomposable digraphs
• scientific article; zbMATH DE number 1439448

Cited in

(3)

• Characterization of \((m, n)\)-linked planar graphs
• Algorithms for finding a maximum non-\(k\)-linked graph
• scientific article; zbMATH DE number 5521183 (Why is no real title available?)

This page was built for publication: Algorithms for finding a maximum non-\(k\)-linked graph

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