A linear algorithm for the Hamiltonian completion number of the line graph of a tree

Information Processing Letters

Volumn 79, Issue 1, 2001, Pages 17-24

  Agnetis, A ^a   Detti, P ^b   Meloni, C ^b   Pacciarelli, D ^b  

^a UNIVERSITY OF SIENA   (Italy)

^b ROMA TRE UNIVERSITY   (Italy)

Author keywords

Algorithms; Hamiltonian completion number; Hamiltonian path; Line graph; Tree

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HAMILTONIANS;

HAMILTONIAN COMPLETION NUMBER;

TREES (MATHEMATICS);

EID: 0035978930     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00164-2     Document Type: Article

References (6)

1. The edge Hamiltonian problem is NP-hard
2. On the Hamiltonian completion problems
3. A linear algorithm for the Hamiltonian completion number of a tree
4. The total interval number of a tree and the Hamiltonian completion number of its line graph
5. A result on Hamiltonian line graphs involving restrictions on induced subgraphs