Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs

DOI10.1016/0020-0190(93)90100-NzbMath0777.68047OpenAlexW2089261921MaRDI QIDQ685527

Falk Nicolai, Haiko Müller

Publication date: 15 December 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90100-n

zbMATH Keywords

Hamiltonian circuitspolynomial time algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

HAMILTONian circuits in chordal bipartite graphs ⋮ Equistable distance-hereditary graphs ⋮ The Hamiltonian problem on distance-hereditary graphs ⋮ A linear time recognition algorithm for proper interval graphs ⋮ Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chordality properties on graphs and minimal conceptual connections in semantic data models
• Completely separable graphs
• Distance-hereditary graphs

This page was built for publication: Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs