{
  "abstract": "A graph is called a threshold graph if it is induced-$\\{P_4,C_4,2K_2\\}$ 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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": null,
  "author_total": 2,
  "authors": [
    {
      "name": "Chengli Li"
    },
    {
      "name": "Feng Liu"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/f7qrx5ztwd0n6.bib",
  "cited_by": 0,
  "doi": "10.37236/15076",
  "fulltext_url": null,
  "id": "f7qrx5ztwd0n6",
  "issns": [
    "1077-8926"
  ],
  "landing_url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p25",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "journal",
  "licence_url": "https://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "openalex",
      "1703|Advanced Graph Theory Research"
    ]
  ],
  "openalex": "W7223360381",
  "pdf_url": "https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i4p25/pdf",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-23",
  "publisher": "The Electronic Journal of Combinatorics",
  "ris": "https://research.draconitic.com/paper/f7qrx5ztwd0n6.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:18:24Z",
      "native_id": "10.37236/15076",
      "source": "crossref",
      "url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p25"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "issn:1077-8926",
      "subfield": "combinatorics"
    }
  ],
  "title": "On the Minimum Number of Hamilton Cycles in Hamiltonian Threshold Graphs: A Simple Proof",
  "title_text": "On the Minimum Number of Hamilton Cycles in Hamiltonian Threshold Graphs: A Simple Proof",
  "type": "peer-reviewed",
  "updated_at": "2026-10-30T12:18:24Z",
  "url": "https://research.draconitic.com/paper/f7qrx5ztwd0n6",
  "venue": "The Electronic Journal of Combinatorics",
  "versions": []
}