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 |
| id |
doaj-c925828158b24d499c18e251ed9ce8c1 |
|---|---|
| record_format |
Article |
| spelling |
doaj-c925828158b24d499c18e251ed9ce8c12021-08-23T01:31:46ZengHindawi LimitedJournal of Mathematics2314-47852021-01-01202110.1155/2021/1593006On the Circumference of 3-Connected Cubic Triangle-Free Plane GraphsAdthasit Sinna0Witthawas Phanthawimol1Sirirat Singhun2Department of MathematicsDepartment of MathematicsDepartment of MathematicsThe 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.http://dx.doi.org/10.1155/2021/1593006 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Adthasit Sinna Witthawas Phanthawimol Sirirat Singhun |
| spellingShingle |
Adthasit Sinna Witthawas Phanthawimol Sirirat Singhun On the Circumference of 3-Connected Cubic Triangle-Free Plane Graphs Journal of Mathematics |
| author_facet |
Adthasit Sinna Witthawas Phanthawimol Sirirat Singhun |
| author_sort |
Adthasit Sinna |
| title |
On the Circumference of 3-Connected Cubic Triangle-Free Plane Graphs |
| title_short |
On the Circumference of 3-Connected Cubic Triangle-Free Plane Graphs |
| title_full |
On the Circumference of 3-Connected Cubic Triangle-Free Plane Graphs |
| title_fullStr |
On the Circumference of 3-Connected Cubic Triangle-Free Plane Graphs |
| title_full_unstemmed |
On the Circumference of 3-Connected Cubic Triangle-Free Plane Graphs |
| title_sort |
on the circumference of 3-connected cubic triangle-free plane graphs |
| publisher |
Hindawi Limited |
| series |
Journal of Mathematics |
| issn |
2314-4785 |
| publishDate |
2021-01-01 |
| description |
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. |
| url |
http://dx.doi.org/10.1155/2021/1593006 |
| work_keys_str_mv |
AT adthasitsinna onthecircumferenceof3connectedcubictrianglefreeplanegraphs AT witthawasphanthawimol onthecircumferenceof3connectedcubictrianglefreeplanegraphs AT siriratsinghun onthecircumferenceof3connectedcubictrianglefreeplanegraphs |
| _version_ |
1721199154960531456 |