Longest cycles in triangle-free graphs (Q1096647)
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: Longest cycles in triangle-free graphs |
scientific article; zbMATH DE number 4031737
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Longest cycles in triangle-free graphs |
scientific article; zbMATH DE number 4031737 |
Statements
Longest cycles in triangle-free graphs (English)
0 references
1988
0 references
We prove that, for each longest cycle in a 2-connected triangle-free graph G of minimum valence \(\delta\) on at most \(6\delta\)-6 vertices, G-C has at most one edge. It follows that such a graph contains a longest cycle which is also dominating.
0 references
bipartite graph
0 references
long cycle
0 references
dominating cycle
0 references
longest cycle
0 references
triangle- free graph
0 references
