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 “"Disjoint paths in graphs"”.

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

    … Hajos conjectured that for any positive 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 …

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

  2. 6-connected graphs are two-three linked

    … graph and $a_0, a_1, a_2, b_1,$ and $b_2$ be distinct vertices of $G$. Motivated by their work on Four Color Theorem, Hadwiger's conjecture for $K_6$, and J\o rgensen's conjecture, Robertson and Seymour asked when does $G$ contain disjoint connected subgraphs $G_1, G_2$, such that $\{a_0, a_1, …

    gatech Repository record for 6-connected graphs are two-three linked (opens in a new tab)