On the circumference of 3-connected cubic triangle-free plane graphs (Q2666403)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7431635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the circumference of 3-connected cubic triangle-free plane graphs |
scientific article; zbMATH DE number 7431635 |
Statements
On the circumference of 3-connected cubic triangle-free plane graphs (English)
0 references
22 November 2021
0 references
Summary: The circumference of a graph \(G\) is the length of a longest cycle in \(G\), denoted by \(\mathrm{cir}(G)\). For any even number \(n\), let \[ c(n) = \min\{\mathrm{cir}(G)\mid G \text{ is a 3-connected cubic triangle-free plane graph with } n \text{ vertices}\}. \] In this paper, we show that an upper bound of \(c(n)\) is \(n+1-3\lfloor n/136\rfloor\) for \(n\geq136\).
0 references
0 references
0.8784139156341553
0 references
0.857263445854187
0 references
0.8475644588470459
0 references
0.8372557163238525
0 references
