On the Circumference of 3-Connected Cubic Triangle-Free Plane Graphs

Adthasit Sinna, Witthawas Phanthawimol, Sirirat Singhun and M. M. Bhatti

Journal of Mathematics, 2021, vol. 2021, 1-6

Abstract: 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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/1593006.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/1593006.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:1593006

DOI: 10.1155/2021/1593006

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().