Minimal pancyclic graphs (Q2866564)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimal pancyclic graphs |
scientific article; zbMATH DE number 6238382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal pancyclic graphs |
scientific article; zbMATH DE number 6238382 |
Statements
13 December 2013
0 references
pancyclic graph
0 references
cycle
0 references
Minimal pancyclic graphs (English)
0 references
A graph with \(v\) vertices is said to be pancyclic if it contains cycles of every length from 3 to \(v\). This paper discusses the minimum number \(m(v)\) of edges in a pancyclic graph. For some values of \(v\), the \(m(v)\) is determined by improving known lower and upper bounds.
0 references
0.8758525848388672
0 references
0.8192988038063049
0 references
0.8017755746841431
0 references
0.7971552610397339
0 references
0.7966259121894836
0 references
