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 3 of 3 for “"Cubic graphs"”.
-
Measurements of edge uncolourability in cubic graphs
The history of the pursuit of uncolourable cubic graphs dates back more than a century. This pursuit has evolved from the slow discovery of individual uncolourable cubic graphs such as the famous Petersen graph and the Blanusa snarks, to discovering in nite classes of uncolourable cubic graphs such …
-
Well-covered Graphs, Unique Colorability, and Covering Range
… of edges necessary for uniquely (k+1)-colorable graphs. We introduce the k-frames, a new class of minimal uniquely (k+1)-colorable graphs that generalizes the k-trees. </p> <p>The covering range of a graph is the difference between the cardinality of a largest maximal independent set of a graph …
-
Power Domination in graphs
Domination in graphs has been studied since the 1800s. Many parameters related to domination have been defined and studied since then. Power domi-nation was first defined and studied in the early 2000s. It is an abstraction of how an electrical power system is monitored. In this thesis, we focus on …