arXiv:2105.02361 [math.CO]AbstractReferencesReviewsResources
The ratio of the numbers of odd and even cycles in outerplanar graphs
Akihiro Higashitani, Naoki Matsumoto
Published 2021-05-05Version 1
In this paper, we investigate the ratio of the numbers of odd and even cycles in outerplanar graphs. We verify that the ratio generally diverges to infinity as the order of a graph diverges to infinity. We also give sharp estimations of the ratio for several classes of outerplanar graphs, and obtain a constant upper bound of the ratio for some of them. Furthermore, we consider similar problems in graphs with some pairs of forbidden subgraphs/minors, and propose a challenging problem concerning claw-free graphs.
Comments: 16 page, 10 figures
Related articles: Most relevant | Search more
arXiv:1912.07679 [math.CO] (Published 2019-12-16)
The polynomial method for list-colouring extendability of outerplanar graphs
arXiv:1112.3353 [math.CO] (Published 2011-12-14)
On the bend-number of planar and outerplanar graphs
arXiv:2009.00287 [math.CO] (Published 2020-09-01)
Choosability with Separation of Cycles and Outerplanar Graphs