A linear algorithm for the Hamiltonian completion number of the line graph of a tree (Q1603430): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Set-up coordination between two stages of a supply chain / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The edge Hamiltonian path problem is NP-complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4050641 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear algorithm for the Hamiltonian completion number of a tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The total interval number of a tree and the Hamiltonian completion number of its line graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A result on Hamiltonian line graphs involving restrictions on induced subgraphs / rank | |||
Normal rank | |||
Revision as of 10:47, 4 June 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
0 references
