| Title: | On reduced Hamilton walks |
|---|
| Authors: | ID Malnič, Aleksander (Author) ID Požar, Rok (Author) |
| Files: | PDF - Presentation file, download (1,91 MB) MD5: FBE5B262667B45FEB56A4CE21367B6BC
URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S0096300325004217
|
|---|
| Language: | English |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | 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  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 0096-3003 |
|---|
| DOI: | 10.1016/j.amc.2025.129695  |
|---|
| COBISS.SI-ID: | 248238083  |
|---|
| Publication date in DiRROS: | 01.10.2025 |
|---|
| Views: | 175 |
|---|
| Downloads: | 86 |
|---|
| Metadata: |  |
|---|
|
:
|
Copy citation |
|---|
| | | | Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |