Digital repository of Slovenian research organisations

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

Title:All generalized rose window graphs are hamiltonian
Authors:ID Bonvicini, Simona (Author)
ID Pisanski, Tomaž (Author)
ID Žitnik, Arjana (Author)
Files:.pdf PDF - Presentation file, download (593,81 KB)
MD5: 98E3D3A248A223AF0F61CD5FC607131A
 
URL URL - Source URL, visit https://link.springer.com/article/10.1007/s00373-026-03016-w
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:A bicirculant is a regular, $d$-valent graph that admits a semiregular automorphism of order $m$ having two vertex-orbits of size $m$. The vertices of each orbit induce a circulant graph of order $m$ and the remaining edges span a regular bipartite graph of valence, say $s, 1 \le s \le d$, connecting the two vertex-orbits. Generalized Petersen graphs constitute a prominent family of bicirculants, with $d=3$ and $s=1$. In 1983, Brian Alspach proved that all generalized Petersen graphs are hamiltonian, except for the family $G(m, 2)$ with $m \equiv 5$ ($\mod 6$). In this paper we conjecture that among all connected bicirculants of valence at least $2$, there are no other exceptions. It follows from various sources that the conjecture is true for all cubic bicirculants. In this paper we prove the conjecture for quartic bicirulants with $s=2$, also known as the generalized rose window graphs.
Keywords:Hamilton cycle, generalized rose window graphs, bicirculants, generalized Petersen graphs, Lovász conjecture
Publication status:Published
Publication version:Version of Record
Publication date:01.04.2026
Year of publishing:2026
Number of pages:20 str.
Numbering:Vol. 42, iss. 2, article no. 27
PID:20.500.12556/DiRROS-27826 New window
UDC:519.17
ISSN on article:0911-0119
DOI:10.1007/s00373-026-03016-w New window
COBISS.SI-ID:269644547 New window
Note:
Publication date in DiRROS:25.02.2026
Views:24
Downloads:9
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:Graphs and combinatorics
Shortened title:Graphs comb.
Publisher:Springer
ISSN:0911-0119
COBISS.SI-ID:25536512 New window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0294
Name:Računsko intenzivne metode v teoretičnem računalništvu, diskretni matematiki, kombinatorični optimizaciji ter numerični analizi in algebri z uporabo v naravoslovju in družboslovju

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-4351
Name:Generiranje, analiza in katalogizacija simetričnih grafov

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

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:BI-HR/23-24-012
Name:Sinergetske aplikacije novejših metod teorije načrtov, konfiguracij, grafov in grup

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-3002
Name:Prirejanja in barvanja povezav v kubičnih grafih

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:Hamiltonov cikel, posplošeni rozetni grafi, bicirkulanti, posplošeni Petersenovi grafi, Lovászova domneva


Back