A new Hamilton circle algorithm of the closure that is complete graph

DOI10.3969/J.ISSN.1003-5060.2013.09.024MaRDI QIDQ4980916zbMATH OpenFDO

Authors Fengbin Peng, Zhixiang Yin

Publication date 30 June 2014

zbMATH Keywords

closurecomplete graphHamilton circleBondy-Chvátal algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• Finding Hamiltonian circuits in interval graphs
• The Hamilton circuit problem on grids
• An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
• scientific article; zbMATH DE number 44783
• Hamiltonian circuits in interval graph generalizations

Cited in

(1)

• A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence

This page was built for publication: A new Hamilton circle algorithm of the closure that is complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4980916)