Hostname: page-component-7b7567c8c-2rsb6 Total loading time: 0 Render date: 2026-11-12T19:59:44.222Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  01 March 1997

POU-LIN WU
POU-LIN WU
Affiliation:
Department of Mathematics, Louisiana State University, Baton Rouge, LA 70803-4918, USA
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 6 , Issue 1 , March 1997, pp. 107 - 113
Copyright
1997 Cambridge University Press