On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs

Erstveröffentlichung
2014
Metadata only
Search for full text
Wissenschaftlicher Artikel


Authors
Löwenstein, Christian
Rautenbach, Dieter
Sotak, Roman
Faculties
Fakultät für Mathematik und Wirtschaftswissenschaften
Institutions
Institut für Optimierung und Operations Research
Published in
Discrete Mathematics and Theoretical Computer Science ; 16 (2014), 1. - S. 7-30. - ISSN 1462-7264. - eISSN 1365-8050
Keywords
Distance graph; Toeplitz graph; circulant graph; Hamiltonian path; Hamiltonian cycle; traceability; RECURSIVE CIRCULANT GRAPHS; CHROMATIC-NUMBERS; TOEPLITZ GRAPHS; NETWORKS; CONNECTIVITY; PANCYCLICITY; DIAMETER
Dewey Decimal Group
DDC 000 / Computer science, information & general works
DDC 510 / Mathematics
Metadata
Show full item record