Indexed metadata
On the Minimum Number of Hamilton Cycles in Hamiltonian Threshold Graphs: A Simple Proof
Chengli Li, Feng Liu
Source abstract
A graph is called a threshold graph if it is induced- free. In 2020, Qiao and Zhan [J. Graph Theory 93 (2020) 222--229] determined the minimum number of Hamilton cycles in a Hamiltonian threshold graph and characterized the extremal graphs attaining this minimum. We show that every Hamiltonian threshold graph contains a special spanning subgraph, from which their two results follow directly.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.