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 “"Kelmans-Seymour conjecture"”.

  1. Special TK5 in graphs containing K4-

    … some edges for paths. The well-known Kelmans-Seymour conjecture states that every nonplanar 5-connected graph contains TK5 . Ma and Yu proved the conjecture for graphs containing K4-. In this dissertation, we strengthen their result in two ways. The results will be useful for …

    gatech Repository record for Special TK5 in graphs containing K4- (opens in a new tab)