An explicit construction of graphs of bounded degree that are far from being Hamiltonian

Adler, I orcid.org/0000-0002-9667-9841 and Köhler, N (2022) An explicit construction of graphs of bounded degree that are far from being Hamiltonian. Discrete Mathematics and Theoretical Computer Science, 24 (1). 3. ISSN 1462-7264

Abstract

Metadata

Item Type: Article
Authors/Creators:
Copyright, Publisher and Additional Information:

© 2022 by the author(s). Distributed under a Creative Commons Attribution 4.0 International License.

Keywords: Hamiltonian cycle, property testing, bounded-degree graphs, bounded-degree model, lower bound
Dates:
  • Published: 31 January 2022
  • Published (online): 31 January 2022
  • Accepted: 2 January 2022
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 31 Jan 2022 15:45
Last Modified: 16 Mar 2023 14:21
Status: Published
Publisher: Episciences
Identification Number: 10.46298/dmtcs.7109
Open Archives Initiative ID (OAI ID):

Download

Export

Statistics