Fragments in 2-critically \(n\)-connected graphs
From MaRDI portal
Publication:1325265
DOI10.1006/jctb.1993.1043zbMath0794.05062MaRDI QIDQ1325265
Publication date: 24 May 1994
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1993.1043
Related Items
On locally \(k\)-critically \(n\)-connected graphs, The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\), High connectivity keeping sets in graphs and digraphs, The symmetric (2k, k)-graphs