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

Pou-Lin Wu

Combinatorics Probability Computing · 1997 · 18 citations · 4 references

Concepts

Abstract

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 *.

References

4