| Title: | On reduced Hamilton walks |
|---|
| Authors: | ID Malnič, Aleksander (Author)
ID Požar, Rok (Author) |
|---|
| Files: |  RAZ_Malnic_Aleksander_2026.pdf (1,91 MB)
MD5: 66FADE9EBCDF55DD76090DB30C0614BF
 https://www.sciencedirect.com/science/article/pii/S0096300325004217
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FAMNIT - Faculty of Mathematics, Science and Information Technologies
IAM - Andrej Marušič Institute
|
|---|
| 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(n2)-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)logn+2n, where c is a constant independent of n. |
|---|
| Keywords: | algorithm, Hamilton walk, nonstandard metric, reduced walk |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 02.09.2025 |
|---|
| Year of publishing: | 2026 |
|---|
| Number of pages: | str. 1-11 |
|---|
| Numbering: | Vol. 510, art. 129695 |
|---|
| PID: | 20.500.12556/RUP-21698  |
|---|
| UDC: | 51 |
|---|
| ISSN on article: | 0096-3003 |
|---|
| DOI: | 10.1016/j.amc.2025.129695 |
|---|
| COBISS.SI-ID: | 248238083 |
|---|
| Publication date in RUP: | 09.09.2025 |
|---|
| Views: | 476 |
|---|
| Downloads: | 7 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
