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 (...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Mathematics and Theoretical Computer Science Ročník 24, no. 1; číslo Graph Theory; s. 1 - 19
Hlavní autori:	Adler, Isolde, Köhler, Noleen
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Nancy DMTCS 01.01.2022 Discrete Mathematics & Theoretical Computer Science
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!