Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:On reduced Hamilton walks
Authors:ID Malnič, Aleksander (Author)
ID Požar, Rok (Author)
Files:.pdf PDF - Presentation file, download (1,91 MB)
MD5: FBE5B262667B45FEB56A4CE21367B6BC
 
URL URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S0096300325004217
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:A Hamilton walk in a finite graph is a walk, either open or closed, that traverses every vertex at least once. Here, we introduce Hamilton walks that are reduced in the sense that they avoid immediate backtracking: a reduced Hamilton walk never traverses the same edge forth and back consecutively. While every connected graph admits a Hamilton walk, existence of a reduced Hamilton walk is not guaranteed for all graphs. However, we prove that a reduced Hamilton walk does exist in a connected graph with minimal valency at least $2$. Furthermore, given such a graph on $n$ vertices, we present an $O(n^2)$-time algorithm that constructs a reduced Hamilton walk of length at most $n(n+3)/2$. Specifically, for a graph belonging to a family of regular expander graphs, we can find a reduced Hamilton walk of length at most $c(6n−2)\log n+2n$, where $c$ is a constant independent of $n$.
Keywords:algorithm, Hamilton walk, nonstandard metric, reduced walk
Publication status:Published
Publication version:Version of Record
Publication date:01.02.2026
Year of publishing:2026
Number of pages:str. 1-11
Numbering:Vol. 510, art. 129695
PID:20.500.12556/DiRROS-23757 New window
UDC:519.17
ISSN on article:0096-3003
DOI:10.1016/j.amc.2025.129695 New window
COBISS.SI-ID:248238083 New window
Publication date in DiRROS:01.10.2025
Views:175
Downloads:86
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Applied mathematics and computation
Shortened title:Appl. math. comput.
Publisher:Elsevier
ISSN:0096-3003
COBISS.SI-ID:24983808 New window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0285
Name:Algebra, diskretna matematika, verjetnostni račun in teorija iger

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0159
Name:Konstrukcija nekaterih diskretnih matematičnih objektov v spektralni domeni

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-2451
Name:Simetrija na grafih preko rigidnih celic

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0209
Name:Orodja za inovativno oblikovanje zdravil

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J5-4596
Name:Višjestopenjske bibliografske storitve

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Keywords:algoritem, hamiltonski sprehod, nestandardna metrika, reduciran sprehod


Back