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 “"graph saturation"”.

  1. Extremal problems in disjoint cycles and graph saturation

    … conditions for the existence of particular subgraphs in a graph, and variations on graph saturation. Determining whether a graph contains a certain subgraph is a computationally difficult problem; as such, sufficient conditions for the existence of a given subgraph are prized. In Chapter 2, we …

    uiuc Repository record for Extremal problems in disjoint cycles and graph saturation (opens in a new tab)

  2. Degree Ramsey theory, game and Roman domination, and game saturation in graphs

    "We examine several problems in extremal graph theory, emphasizing problems involving games on graphs. In Chapter 2, we study a variant of Ramsey theory, seeking Ramsey hosts with small maximum degree. We focus on finding such hosts for trees and cycles. In Chapter 3 we consider the ""on-line"" …

    uiuc Repository record for Degree Ramsey theory, game and Roman domination, and game saturation in graphs (opens in a new tab)