Kelmans–Seymour conjecture

Known as: Kelmans-Seymour conjecture

In graph theory, the Kelmans–Seymour conjecture states that every 5-vertex-connected graph that is not planar contains a subdivision of the 5-vertex…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

Let H denote the tree with six vertices, two of which are adjacent and of degree 3. Let G be a graph and u1,u2,a1,a2,a3,a4 be…

2011

Let H denote the tree with six vertices two of which are adjacent and of degree three. Let G be a graph and u 1 , u 2 , a 1 , a 2…