The Kelmans-Seymour conjecture II: 2-vertices in $K_4^-$
Combinatorics
2016-02-25 v1
Abstract
We use to denote the graph obtained from by removing an edge, and use to denote a subdivision of . Let be a 5-connected nonplanar graph and such that with . Let be distinct. We show that contains a in which is not a branch vertex, or contains , or has a special 5-separation, or contains .
Keywords
Cite
@article{arxiv.1602.07557,
title = {The Kelmans-Seymour conjecture II: 2-vertices in $K_4^-$},
author = {Dawei He and Yan Wang and Xingxing Yu},
journal= {arXiv preprint arXiv:1602.07557},
year = {2016}
}