Graphs Containing Topological H
Jie Ma, Qiqin Xie, Xingxing Yu · Journal of Graph Theory · 2015
Abstract Let H denote the tree with six vertices, two of which are adjacent and of degree 3. Let G be a graph and be distinct vertices of G. We characterize those G that contain a topological H in which are of degree 3 and are of degree 1, which include all 5‐connected graphs. This work was motivated by the Kelmans–Seymour conjecture that 5‐connected nonplanar graphs contain topological K5.