A linear algorithm for the Hamiltonian completion number of the line graph of a tree (Q1603430): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Alessandro Agnetis / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Paolo Detti / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Carlo Meloni / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Dario Pacciarelli / rank | |||
Normal rank | |||
Revision as of 16:55, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear algorithm for the Hamiltonian completion number of the line graph of a tree |
scientific article |
Statements
A linear algorithm for the Hamiltonian completion number of the line graph of a tree (English)
0 references
14 July 2002
0 references
algorithms
0 references
Hamiltonian path
0 references
Hamiltonian completion number
0 references
tree
0 references
line graph
0 references
