On the Circumference of 3-Connected Cubic Triangle-Free Plane Graphs
The circumference of a graph G is the length of a longest cycle in G, denoted by cirG. For any even number n, let cn = min {cirG|G is a 3-connected cubic triangle-free plane graph with n vertices}. In this paper, we show that an upper bound of cn is n+1−3⌊n/136⌋ for n≥136.
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2021-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2021/1593006 |