Algorithms for Finding a Maximum Non-k-Linked Graph

DOI10.1137/110846725zbMath1248.05203OpenAlexW2022621426MaRDI QIDQ2910937

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

vertex-connectivity\(k\)-linkednessmaximum induced subgraph

Mathematics Subject Classification ID

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

Related Items (1)

Characterization of \((m, n)\)-linked planar graphs

This page was built for publication: Algorithms for Finding a Maximum Non-k-Linked Graph