Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Graceful Labelings"”.
-
Common Techniques in Graceful Tree Labeling with a New Computational Approach
The graceful tree conjecture was first introduced over 50 years ago, and to this day it remains largely unresolved. Ideas for how to label arbitrary trees have been sparse, and so most work in this area focuses on demonstrating that particular classes of trees are graceful. In my research, I …
-
The Last of the Mixed Triple Systems.
<p>In this thesis, we consider the decomposition of the complete mixed graph on <em>v</em> vertices denoted <em>M<sub>v</sub></em>, into every possible mixed graph on three vertices which has (like <em>M<sub>v</sub></em>) twice as many arcs as edges. Direct constructions are given in most cases. …