The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order
From MaRDI portal
Publication:5110653
DOI10.1002/JGT.22483zbMath1495.05136arXiv1802.09250OpenAlexW2969590123WikidataQ127357504 ScholiaQ127357504MaRDI QIDQ5110653
Publication date: 21 May 2020
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.09250
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45)
Related Items (1)
This page was built for publication: The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order