A sufficient condition for a digraph to be Hamiltonian (Q3501984)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5284600
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sufficient condition for a digraph to be Hamiltonian |
scientific article; zbMATH DE number 5284600 |
Statements
3 June 2008
0 references
Hamiltonian digraph
0 references
\(C\)-bypass
0 references
common in-neighbor
0 references
common out-neighbor
0 references
0.9025077223777772
0 references
0.8731404542922974
0 references
0.8672556281089783
0 references
0.858956515789032
0 references
