Abstract
In this paper we give a lower bound of the circumference of a graph in terms of girth and the number of edges. It is shown that a graph of girth at least with vertices and at least edges contains a cycle of length at least . In particular, for the case , an analogous result for 2-edge-connected weighted graphs is given. Moreover, the extremal case is characterized in both results.
Citation
Jun Fujisawa. Katsuhiro Ota. "Maximal cycles in graphs of large girth." SUT J. Math. 50 (2) 427 - 438, June 2014. https://doi.org/10.55937/sut/1424795056
Information