A sufficient condition for oriented graphs to be Hamiltonian (Q1079579)
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 oriented graphs to be Hamiltonian |
scientific article; zbMATH DE number 3963865
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition for oriented graphs to be Hamiltonian |
scientific article; zbMATH DE number 3963865 |
Statements
A sufficient condition for oriented graphs to be Hamiltonian (English)
0 references
1986
0 references
The authors conjecture that every k-conneted oriented graph with n vertices and more than \(n(n-1)-k(k+1)\) arcs has a Hamiltonian cycle. The conjecture is best possible for \(n>3k\) and in the present paper it is verified for \(k=2\).
0 references
k-conneted oriented graph
0 references
Hamiltonian cycle
0 references
conjecture
0 references
