A sufficient condition for pancyclism of Hamiltonian graphs (Q2739192)
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: A sufficient condition for pancyclism of Hamiltonian graphs |
scientific article; zbMATH DE number 1643602
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition for pancyclism of Hamiltonian graphs |
scientific article; zbMATH DE number 1643602 |
Statements
20 January 2003
0 references
2-connected graph
0 references
pancyclic graph
0 references
0 references
0 references
0.9514395
0 references
0 references
0.9461372
0 references
0.94215536
0 references
0.94215536
0 references
A sufficient condition for pancyclism of Hamiltonian graphs (English)
0 references
The author proves the following result: Let \(G\) be a 2-connected graph with \(n\) vertices, \(\delta(G)\geq t\). If \(|N(u)\cup N(v)|\geq n-t\) for all nonadjacent vertices \(u\) and \(v\), then \(G\) is a pancyclic graph or \(n=2t\) and \(G= K_{t,t}\).
0 references
