1. Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groupsŠtefko Miklavič, Primož Šparl, 2012, original scientific article Keywords: graph theory, Hamilton cycle, Hamilton path, nHCextendable, strongly nHPextendable, weakly nHPextendable, Cayley graph, abelian group Full text (outside link) 





7. Relatively uniformly continuous semigroups of positive operators on vector latticesMichael Kaplin, 2020, doctoral dissertation Keywords: vector lattices, relatively uniform convergence, relatively uniform topology, relatively uniform continuity, positive operator semigroups, strongly continuous semigroups, HilleYosida theorem Full text (file, 705,86 KB) 
8. Algorithms for finding the strongly connected components of directed graphsINA LANG, 2021, undergraduate thesis Keywords: graph, strong connectivity, strongly connected, Tarjan’s algorithm, Kosaraju’s algorithm, Gabow, pathbased, Blelloch, Fleischer, parallelism. Full text (file, 2,01 MB) 
