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 cir G . For any even number n , let c n = min { cir G | G is a 3-connected cubic triangle-free plane graph with n vertices}. In this paper, we show that an upper bound of c n is n + 1 − 3 ⌊ n / 136 ⌋ for n ≥ 136 .
2019 ◽
Vol 28
(14)
◽
pp. 1950085
Keyword(s):
2018 ◽
Vol 27
(08)
◽
pp. 1850044
Keyword(s):
2012 ◽
Vol 21
(14)
◽
pp. 1250129
◽
Keyword(s):
2013 ◽
Vol 23
(02)
◽
pp. 75-92
◽
Keyword(s):
2006 ◽
Vol 17
(05)
◽
pp. 1031-1060
◽
Keyword(s):
2009 ◽
Vol 18
(12)
◽
pp. 1711-1726
◽
Keyword(s):
2007 ◽
Vol 17
(03)
◽
pp. 201-230
◽
Keyword(s):
2013 ◽
Vol 22
(6)
◽
pp. 935-954
◽
Keyword(s):