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

Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an impressive amount of research has been dedicated to identifying classes of graphs that allow Hamiltonian cycles, and to related questions. The corresponding decision problem, that asks whether a given graph is Hamiltonian (...

Full description

Bibliographic Details

Published in:	Discrete Mathematics and Theoretical Computer Science Vol. 24, no. 1; no. Graph Theory; pp. 1 - 19
Main Authors:	Adler, Isolde, Köhler, Noleen
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 01.01.2022 Discrete Mathematics & Theoretical Computer Science
Subjects:	Apexes computer science - computational complexity computer science - data structures and algorithms computer science - discrete mathematics g.2.2 Graph theory Graphs Hamiltonian function Mathematical research Vertex sets United Kingdom
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!