Combinatorics Probability Computing · 1997 · 18 citations · 4 references
Natural SciencesComputer ScienceMathematicsCombinatoricsTopologyDirected Acyclic GraphsGraph AlgorithmsGraph TheoryGraph ConnectivityUpper Bound Computation
Let G be a loopless 2-connected graph whose largest cycle has c edges, and whose largest bond has c * edges. We show that | E ( G )| [les ] ½ cc *.
4
W. T. Tutte · Canadian Journal of Mathematics · 1966 · 313 citations · Full text
J. A. Bondy · Discrete Mathematics · 1971 · 106 citations
Talmage James Reid · European Journal of Combinatorics · 1997 · 12 citations
Series‐parallel graphs: A logical approach
T. A. McKee · Journal of Graph Theory · 1983 · 11 citations