A linear algorithm for the Hamiltonian completion number of a tree
type: Item
instance of: scholarly article
title: A linear algorithm for the Hamiltonian completion number of a tree
zbMATH Open document ID: 0327.05104
DOI: 10.1016/0020-0190(76)90080-6
author: Sukhamay Kundu
published in: Information Processing Letters
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 3512144
MaRDI profile type: Publication
full work available at URL: 0020-0190(76)90080-6
OpenAlex ID: W2022016054
cites work: Q4052166
cites work: Q4050641
cites work: Parallel concepts in graph theory
cites work: Q4142699
cites work: A Linear Tree Partitioning Algorithm
cites work: Q5585020
cites work: Optimal chain partitions of trees
description: scientific article; zbMATH DE number 3512144