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

DOI10.1007/S003730200008MaRDI QIDQ1348657zbMATH OpenOpenAlexFDO

Authors 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) Connectivity (05C40) Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 3885951
• On \(k\)-con-critically \(n\)-connected graphs
• Critically (k,k)-connected graphs
• Maximum number of edges in a critically k-connected graph
• On degrees of vertices in critically \(k\)-connected graphs

Cited in

(3)

• The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
• On vertices of degree \(k\) of minimal and contraction critical \(k\)-connected graphs: upper bounds
• Maximum number of edges in a critically k-connected graph

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

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