An algorithm for Hamiltonian cycles under implicit degree conditions.

MaRDI QIDQ2822830zbMATH OpenFDO

Authors Junqing Cai

Publication date 5 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cycleimplicit degreeindependent set

Mathematics Subject Classification ID

Vertex degrees (05C07) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• An implicit degree condition for Hamiltonian cycles
• An implicit degree Dirac condition for Hamiltonian cycles.
• Implicit degree sum condition for Hamiltonian cycles.
• An implicit degree condition for Hamiltonian graphs
• Implicit degree condition for Hamiltonicity of graphs.

Cited in

(11)

• Analyzing lattice networks through substructures
• Vertex-based and edge-based centroids of graphs
• Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter
• An implicit degree sum condition for cycles through specified vertices
• scientific article; zbMATH DE number 7559398 (Why is no real title available?)
• High-order copositive tensors and its applications
• Implicit degree sum condition for Hamiltonian cycles.
• An implicit degree condition for Hamiltonian cycles
• scientific article; zbMATH DE number 4185649 (Why is no real title available?)
• Implicit degree condition restricted to essential independent sets for Hamiltonian cycles
• An improved degree based condition for Hamiltonian cycles

This page was built for publication: An algorithm for Hamiltonian cycles under implicit degree conditions.

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