Hostname: page-component-5d59c44645-n6p7q Total loading time: 0 Render date: 2024-03-03T12:44:00.357Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  01 March 1997

Department of Mathematics, Louisiana State University, Baton Rouge, LA 70803-4918, USA


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

Research Article
1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)