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*.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bonds Intersecting Long Paths in \(k\) -Connected Graphs;SIAM Journal on Discrete Mathematics;2023-06-02
2. Matroids, delta-matroids and embedded graphs;Journal of Combinatorial Theory, Series A;2019-10
3. Matroidal Methods in Graph Theory;Discrete Mathematics and Its Applications;2013-11-26
4. An Erdős-Gallai Theorem for Matroids;Annals of Combinatorics;2011-12-16
5. On cocircuit covers of bicircular matroids;Discrete Mathematics;2008-09