scientific article; zbMATH DE number 2080243
From MaRDI portal
Publication:4472488
zbMath1044.68137MaRDI QIDQ4472488
No author found.
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1969/19690156.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Eulerian and Hamiltonian graphs (05C45)
Related Items (2)
A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. ⋮ Local search algorithms for finding the Hamiltonian completion number of line graphs
This page was built for publication:
