Maximum number of edges in a critically \(k\)-connected graph

DOI10.1016/S0012-365X(02)00489-2zbMath1018.05048OpenAlexW2116463819MaRDI QIDQ1861238

Yoshimi Egawa, Kiyoshi Ando

Publication date: 16 March 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00489-2

zbMATH Keywords

extremal graphs

Mathematics Subject Classification ID

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

This page was built for publication: Maximum number of edges in a critically \(k\)-connected graph