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 “"K5-subdivision"”.

  1. Coloring graphs with no k5-subdivision: disjoint paths in graphs

    … integer k, every graph containing no K_{k+1}-subdivision is k-colorable. However, Catlin disproved Hajos conjecture for k>=6. It is not hard to prove that the conjecture is true for k<=3. Hajos' conjecture remains open for k=4 and k=5. We consider a minimal counterexample to Hajos conjecture …

    gatech Repository record for Coloring graphs with no k5-subdivision: disjoint paths in graphs (opens in a new tab)

  2. Subdivisions of complete graphs

    A subdivision of a graph G, also known as a topological G and denoted by TG, is a graph obtained from G by replacing certain edges of G with internally vertex-disjoint paths. This dissertation studies a problem in structural graph theory regarding subdivisions of a complete graph in graphs. In this …

    gatech Repository record for Subdivisions of complete graphs (opens in a new tab)