On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs
Wissenschaftlicher Artikel
Authors
Löwenstein, Christian
Rautenbach, Dieter
Sotak, Roman
Faculties
Fakultät für Mathematik und WirtschaftswissenschaftenInstitutions
Institut für Optimierung und Operations ResearchPublished 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; DIAMETERDewey Decimal Group
DDC 000 / Computer science, information & general worksDDC 510 / Mathematics
Metadata
Show full item recordThis could also interest you:
-
Forests and trees among Gallai graphs
Joos, Felix; Van Bang Le; Rautenbach, Dieter (2015)Wissenschaftlicher Artikel
-
Unit Interval Graphs of Open and Closed Intervals
Rautenbach, Dieter; Szwarcfiter, Jayme L. (2013)Wissenschaftlicher Artikel
-
Long cycles and paths in distance graphs
Penso, Lucia Draque; Rautenbach, Dieter; Szwarcfiter, Jayme Luiz (2010)Wissenschaftlicher Artikel