Sufficient conditions for a graph to be \(k\)-edge-Hamiltonian, \(k\)-path-coverable, traceable and Hamilton-connected (Q3300703)
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 7225869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sufficient conditions for a graph to be \(k\)-edge-Hamiltonian, \(k\)-path-coverable, traceable and Hamilton-connected |
scientific article; zbMATH DE number 7225869 |
Statements
29 July 2020
0 references
\(k\)-path-coverable graph
0 references
forgotten index of graphs
0 references
0 references
0 references
0 references
0.7805579304695129
0 references
0.7760384678840637
0 references
0.7701635360717773
0 references
0.7562792301177979
0 references
0.7539382576942444
0 references
