The Chvátal-Erdős condition for panconnectivity of triangle-free graphs (Q1613497)
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: The Chvátal-Erdős condition for panconnectivity of triangle-free graphs |
scientific article; zbMATH DE number 1792425
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Chvátal-Erdős condition for panconnectivity of triangle-free graphs |
scientific article; zbMATH DE number 1792425 |
Statements
The Chvátal-Erdős condition for panconnectivity of triangle-free graphs (English)
0 references
29 August 2002
0 references
Let \(G\) be a triangle-free graph with \(n\) vertices and \(\alpha(G)\leq k(G)\). Then (1) \(G\) is \([4,n]\)-pancyclic unless \(G= K_{n/2,n/2}\) or \(G\) is a 5-cycle, and (2) \(G\) is \([4,n]\)-vertex-pancyclic unless \(G= K_{n/2,n/2}\) or \(G\) is a 5-cycle.
0 references
vertex-pancyclic
0 references