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 1 of 1 for “"covering range"”.

  1. Well-covered Graphs, Unique Colorability, and Covering Range

    … 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 and the cardinality of a smallest maximal independent set of the graph. We give the covering range for some cubic graphs and a class …

    mississippi Repository record for Well-covered Graphs, Unique Colorability, and Covering Range (opens in a new tab)