An Upper Bound on the Number of Edges of a 2-Connected Graph
From MaRDI portal
Publication:3123115
DOI10.1017/S0963548396002787zbMath0867.05042MaRDI QIDQ3123115
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
Related Items
Bonds Intersecting Long Paths in \(k\) -Connected Graphs, An Erdős-Gallai theorem for matroids, On cocircuit covers of bicircular matroids, A note on covering the edges of a graph with bonds, Matroids, delta-matroids and embedded graphs, A sharp bound on the size of a connected matroid