Article

K_6 minors in large 6-connected graphs

03/2012;
Source: arXiv

ABSTRACT Jorgensen conjectured that every 6-connected graph with no K_6 minor has a
vertex whose deletion makes the graph planar. We prove the conjecture for all
sufficiently large graphs.

0 Bookmarks
 · 
82 Views

Full-text (2 Sources)

Download
41 Downloads
Available from
May 30, 2014