A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
From MaRDI portal
Publication:1427178
DOI10.1016/S0166-218X(03)00441-4zbMath1039.05039MaRDI QIDQ1427178
Publication date: 14 March 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (4)
Evolutionary operators for the Hamiltonian completion problem ⋮ A lower bound on the Hamiltonian path completion number of a line graph ⋮ Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor ⋮ Local search algorithms for finding the Hamiltonian completion number of line graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The total interval number of a tree and the Hamiltonian completion number of its line graph
- Linear algorithm for optimal path cover problem on interval graphs
- A linear algorithm for finding a minimum dominating set in a cactus
- Optimal chain partitions of trees
- A linear algorithm for the Hamiltonian completion number of a tree
- Minimum node disjoint path covering for circular-arc graphs
- Optimal path cover problem on block graphs and bipartite permutation graphs
- The path-partition problem in block graphs
- Wiener number of vertex-weighted graphs and a chemical application
- Set-up coordination between two stages of a supply chain
- A linear algorithm for the Hamiltonian completion number of the line graph of a tree
- An optimal path cover algorithm for cographs
- Optimal path cover problem on block graphs
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Graph Searching and Interval Completion
- A result on Hamiltonian line graphs involving restrictions on induced subgraphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Advances on the Hamiltonian Completion Problem
- Hamiltonian shortage, path partitions of vertices, and matchings in a graph
- Graph Classes: A Survey
- Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
- On Eulerian and Hamiltonian Graphs and Line Graphs
This page was built for publication: A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
