A linear algorithm for the Hamiltonian completion number of the line graph of a tree
type: Item
instance of: scholarly article
title: A linear algorithm for the Hamiltonian completion number of the line graph of a tree
zbMATH Open document ID: 0998.68219
DOI: 10.1016/S0020-0190(00)00164-2
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1767304
zbMATH Keywords: algorithms
zbMATH Keywords: Hamiltonian path
zbMATH Keywords: Hamiltonian completion number
zbMATH Keywords: tree
zbMATH Keywords: line graph
author: Alessandro Agnetis
author: Paolo Detti
author: C. Meloni
author: Dario Pacciarelli
MaRDI profile type: Publication
cites work: Set-up coordination between two stages of a supply chain
cites work: The edge Hamiltonian path problem is NP-complete
cites work: Q4050641
cites work: A linear algorithm for the Hamiltonian completion number of a tree
cites work: The total interval number of a tree and the Hamiltonian completion number of its line graph
cites work: A result on Hamiltonian line graphs involving restrictions on induced subgraphs
Wikidata QID: Q126550363
description: scientific article; zbMATH DE number 1767304