Now showing items 1-1 of 1
Hamilton Decompositions of Graphs with Primitive Complements
A graph G is a pair (V, E) where V is the set of vertices(or nodes) and E is the set of edges connecting the vertices. A graph is called k-regular, if all of its vertices are incident with k edges. A k-factor of a graph G ...