Keywords: graph theory, avoidable structures, paths, trails, two-rooted graphsPublished in RUP: 20.03.2026; Views: 523; Downloads: 14 Full text (537,14 KB)
Keywords: socialno in čustveno učenje, CASEL, sistematičen pregled literature, Tools of the Mnd, HighScope, PATHS, predšolsko obdobjePublished in RUP: 20.11.2025; Views: 663; Downloads: 19 Full text (137,86 KB)This document has more files! More...
Abstract: We show that if C1 and C2 are directed cycles (of length at least two), then the Cartesian product C1 □ C2 has two arc-disjoint hamiltonian paths. (This answers a question asked by J. A. Gallian in 1985.) The same conclusion also holds for the Cartesian product of any four or more directed cycles (of length at least two), but some cases remain open for the Cartesian product of three directed cycles. We also discuss the existence of arc-disjoint hamiltonian paths in 2-generated Cayley digraphs on (finite or infinite) abelian groups.Keywords: Abelian groups, Cayley digraphs, hamiltonian pathsPublished in RUP: 21.10.2025; Views: 1408; Downloads: 5 Full text (512,92 KB)
Keywords: multigraph, k-shortest paths, shallow parse and transfer RBMT, machine translationPublished in RUP: 14.03.2019; Views: 4271; Downloads: 115 Link to full text
