Fragments in 2-critically \(n\)-connected graphs

DOI10.1006/jctb.1993.1043zbMath0794.05062OpenAlexW1988228776MaRDI QIDQ1325265

Jianji Su

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

zbMATH Keywords

fragments\(n\)-connected graphMader conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (4)

The symmetric (2k, k)-graphs ⋮ 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

This page was built for publication: Fragments in 2-critically \(n\)-connected graphs