A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
type: Item
instance of: scholarly article
title: A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
zbMATH Open document ID: 1039.05039
DOI: 10.1016/S0166-218X(03)00441-4
author: Paolo Detti
author: C. Meloni
published in: Discrete Applied Mathematics
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 2055505
zbMATH Keywords: Hamiltonian path
MaRDI profile type: Publication
cites work: Set-up coordination between two stages of a supply chain
cites work: A linear algorithm for the Hamiltonian completion number of the line graph of a tree
cites work: Q4091421
cites work: Minimum node disjoint path covering for circular-arc graphs
cites work: Graph Classes: A Survey
cites work: Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
cites work: Graph searching and interval completion
cites work: Advances on the Hamiltonian Completion Problem
cites work: On Eulerian and Hamiltonian Graphs and Line Graphs
cites work: A linear algorithm for finding a minimum dominating set in a cactus
cites work: Wiener number of vertex-weighted graphs and a chemical application
cites work: A linear algorithm for the Hamiltonian completion number of a tree
cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
cites work: An optimal path cover algorithm for cographs
cites work: Optimal chain partitions of trees
cites work: Linear algorithm for optimal path cover problem on interval graphs
cites work: The total interval number of a tree and the Hamiltonian completion number of its line graph
cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
cites work: Q4097319
cites work: Hamiltonian shortage, path partitions of vertices, and matchings in a graph
cites work: Optimal path cover problem on block graphs and bipartite permutation graphs
cites work: A result on Hamiltonian line graphs involving restrictions on induced subgraphs
cites work: Optimal path cover problem on block graphs
cites work: Q4472488
cites work: The path-partition problem in block graphs
description: scientific article; zbMATH DE number 2055505