Upper bounds to the number of vertices in a \(k\)-critically \(n\)-connected graph

DOI10.1007/S003730200008zbMath0995.05083OpenAlexW2065827903MaRDI QIDQ1348657

Matthias Kriesell

Publication date: 14 May 2002

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730200008

zbMATH Keywords

boundshypergraphs\(k\)-critically \(n\)-connected grahps

Mathematics Subject Classification ID

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

Related Items (1)

The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)

This page was built for publication: Upper bounds to the number of vertices in a \(k\)-critically \(n\)-connected graph