20.500.12556/DKUM-86504 Counting Traversing Hamiltonian Cycles in Tiled Graphs 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. Hamiltonian cycle traversing Hamiltonian cycle counting problem tiled graph Hamiltonski cikel prečkajoči Hamiltonski cikel preštevalni problem tlakovan graf ne zaključna dela true true true MDPI Angleški jezik Ostali Članek v reviji 2023-12-06 06:58:24 2024-01-04 11:48:19 2024-09-13 11:36:55 0000-00-00 00:00:00 2023 0 0 str. 2650 no. 12 Vol. 11 2023 0000-00-00 Zaloznikova Objavljeno apc 2023-04-25 2023-06-09 2023-06-10 519.17 2227-7390 175170051 10.3390/math11122650 2227-7390 mathematics-11-02650-v2.pdf mathematics-11-02650-v2.pdf 1 AC70E5D2A8F848F857E3A76F8B88E48E df6482aab05abb11df94942b209bf24de5d347724a24fdca24920335c274d1c2 a292b444-93fc-11ee-8142-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=174656 https://www.mdpi.com/2227-7390/11/12/2650/pdf 1 8c1b070e-93fc-11ee-8142-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=174655 Fakulteta za naravoslovje in matematiko 0 0 0