Finding Hamiltonian circuits in quasi-adjoint graphs

DOI10.1016/j.dam.2008.03.014zbMath1165.05012DBLPjournals/dam/BlazewiczKLW08OpenAlexW2013396468WikidataQ57387746 ScholiaQ57387746MaRDI QIDQ955323

Benjamin Leroy-Beaulieu, Marta Kasprzak, Dominique de Werra, Jacek Błażewicz

Publication date: 19 November 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.014

zbMATH Keywords

Hamiltonian circuitsquasi-adjoint graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Unnamed Item ⋮ Graph algorithms for DNA sequencing -- origins, current models and the future ⋮ Classification of de Bruijn-based labeled digraphs ⋮ On directed covering and domination problems ⋮ On Directed Covering and Domination Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding Hamiltonian circuits in proper interval graphs
• Finding Hamiltonian circuits in interval graphs
• Complement reducible graphs
• The edge Hamiltonian path problem is NP-complete
• Complexity of DNA sequencing by hybridization.
• HAMILTONian circuits in chordal bipartite graphs
• On some properties of DNA graphs
• Computational complexity of isothermic DNA sequencing by hybridization
• Reducibility Among Combinatorial Problems
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
• Hamilton Paths in Grid Graphs

This page was built for publication: Finding Hamiltonian circuits in quasi-adjoint graphs