Iren Darijani
Memorial University
Scientific, Distinguished Lecture
ULethbridge Number Theory and Combinatorics Seminar: Iren Darijani
A directed graph H consists of a set V(H) of vertices together with a subset A(H) of V(H)×V(H) which are called arcs. A hamiltonian dipath in a digraph is a dipath that visits each vertex exactly once. The Cartesian product H 1◻H 2 of two digraphs H...