A lower bound on the Hamiltonian path completion number of a line graph (Q902504)
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 6532365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on the Hamiltonian path completion number of a line graph |
scientific article; zbMATH DE number 6532365 |
Statements
A lower bound on the Hamiltonian path completion number of a line graph (English)
0 references
18 January 2016
0 references
Hamiltonian path completion number
0 references
line graphs
0 references
dominating trail
0 references
lower bound
0 references
0 references
0 references
0 references
0 references
0.91807294
0 references
0.9050136
0 references
0.8959398
0 references
0.89381343
0 references
0.8931326
0 references
0.89285123
0 references
