Skip to main content

Resolvable and near-resolvable oriented 3- and 4- cycle decompositions of the complete symmetric digraph

Resource type
Thesis
Thesis type
(Thesis) M.Sc.
Date created
1989
Authors/Contributors
Author (aut): Hamm, Susan
Copyright statement
Copyright is held by the author.
Permissions
The author has not granted permission for the file to be printed nor for the text to be copied and pasted. If you would like a printable copy of this thesis, please contact summit-permissions@sfu.ca.
Scholarly level
Graduate student (Masters)
Subject
Graph theory.
Paths and cycles (Graph theory)
Complete graphs.
Language
English
Member of collection
Statistics and Actuarial Science Theses
Download file Size
b14435433.pdf 1.16 MB

Views & downloads - as of June 2023

Views: 0
Downloads: 0