Hostname: page-component-7dd5485656-bvgqh Total loading time: 0 Render date: 2025-10-31T06:39:29.543Z 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
Get access Rights & Permissions [Opens in a new window]

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

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 6 , Issue 1 , March 1997 , pp. 107 - 113
Copyright
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.)

Article purchase

Temporarily unavailable