A new sufficient condition for a 2-strong digraph to be Hamiltonian (Q6606989)
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 new sufficient condition for a 2-strong digraph to be Hamiltonian |
scientific article; zbMATH DE number 7914877
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new sufficient condition for a 2-strong digraph to be Hamiltonian |
scientific article; zbMATH DE number 7914877 |
Statements
A new sufficient condition for a 2-strong digraph to be Hamiltonian (English)
0 references
17 September 2024
0 references
digraph
0 references
Hamiltonian cycle
0 references
Hamiltonian-connected graph
0 references
\(k\)-strong graph
0 references
degree
0 references
0 references
0 references
0 references
0 references
