An Upper Bound on the Number of Edges of a 2-Connected Graph

DOI10.1017/S0963548396002787zbMath0867.05042OpenAlexW1982554476MaRDI QIDQ3123115

Pou-Lin Wu

Publication date: 6 March 1997

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548396002787

zbMATH Keywords

edge connectivitynumber of edges2-connected

Mathematics Subject Classification ID

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

Related Items

Bonds Intersecting Long Paths in \(k\) -Connected Graphs ⋮ An Erdős-Gallai theorem for matroids ⋮ On cocircuit covers of bicircular matroids ⋮ A sharp bound on the size of a connected matroid ⋮ Matroids, delta-matroids and embedded graphs ⋮ A note on covering the edges of a graph with bonds