Title:
Special TK5 in graphs containing K4-
Special TK5 in graphs containing K4-
Author(s)
He, Dawei
Advisor(s)
Yu, Xingxing
Editor(s)
Collections
Supplementary to
Permanent Link
Abstract
Given a graph K, TK is used to denote a subdivision of K, which is a graph
obtained from K by substituting 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 completely resolving
the Kelmans-Seymour conjecture. Let G be a 5-connected nonplanar graph and let x1, x2, y1, y2 in V(G) be distinct, such that G[{x1, x2, y1, y2}] is isomorphic to K4- and y1y2 is not in E(G). We show that one of the following holds: G - y2 contains K4-, or G contains a TK5 in which y2 is not a branch vertex, or G has a special 5-separation, or for any distinct w1, w2, w3 in N(y2) - {x1, x2}, G - {y2v : v not in {x1, x2, w1, w2, w3}} contains TK5. We show that one of the following holds: G - x1 contains K4-, or G contains a TK5 in which x1 is not a branch vertex, or G contains a K4- in which x1 is of degree 2, or {x2, y1, y2} may be chosen so that for any distinct z0, z1 in N(x1) - {x2, y1, y2}, G - {x1v : v not in {z0, z1, x2, y1, y2}} contains TK5.
Sponsor
Date Issued
2017-04-05
Extent
Resource Type
Text
Resource Subtype
Dissertation