| Naslov: | Counting Traversing Hamiltonian Cycles in Tiled Graphs |
|---|
| Avtorji: | ID Vegi Kalamar, Alen, Department of Mathematics and Computer Science, University of Maribor, 2000 Maribor, Slovenia Comtrade Gaming, 2000 Maribor, Slovenia (Avtor) |
| Datoteke: | mathematics-11-02650-v2.pdf (281,48 KB) MD5: AC70E5D2A8F848F857E3A76F8B88E48E
https://www.mdpi.com/2227-7390/11/12/2650/pdf
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Članek v reviji |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: | FNM - Fakulteta za naravoslovje in matematiko
|
|---|
| Opis: | Recently, the problem of counting Hamiltonian cycles in 2-tiled graphs was resolved by Vegi Kalamar, Bokal, and Žerak. In this paper, we continue our research on generalized tiled graphs. We extend algorithms on counting traversing Hamiltonian cycles from 2-tiled graphs to generalized tiled graphs. We further show that, similarly as for 2-tiled graphs, for a fixed finite set of tiles, counting traversing Hamiltonian cycles can be performed in linear time with respect to the size of such graph, implying that counting traversing Hamiltonian cycles in tiled graphs is fixed-parameter tractable. |
|---|
| Ključne besede: | Hamiltonian cycle, traversing Hamiltonian cycle, counting problem, tiled graph |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Poslano v recenzijo: | 25.04.2023 |
|---|
| Datum sprejetja članka: | 09.06.2023 |
|---|
| Datum objave: | 10.06.2023 |
|---|
| Založnik: | MDPI |
|---|
| Leto izida: | 2023 |
|---|
| Št. strani: | str. 2650 |
|---|
| Številčenje: | Vol. 11, no. 12 |
|---|
| PID: | 20.500.12556/DKUM-86504  |
|---|
| UDK: | 519.17 |
|---|
| eISSN: | 2227-7390 |
|---|
| COBISS.SI-ID: | 175170051  |
|---|
| DOI: | 10.3390/math11122650  |
|---|
| ISSN pri članku: | 2227-7390 |
|---|
| Datum objave v DKUM: | 04.01.2024 |
|---|
| Število ogledov: | 503 |
|---|
| Število prenosov: | 67 |
|---|
| Metapodatki: |  |
|---|
| Področja: | Ostalo
|
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |