K 6 minors in 6-connected graphs of bounded tree-widthReport as inadecuate



 K 6 minors in 6-connected graphs of bounded tree-width


K 6 minors in 6-connected graphs of bounded tree-width - Download this document for free, or read online. Document in PDF available to download.

Download or read this book online for free in PDF: K 6 minors in 6-connected graphs of bounded tree-width
We prove that every sufficiently big 6-connected graph of bounded tree-width either has a K 6 minor, or has a vertex whose deletion makes the graph planar. This is a step toward proving that the same conclusion holds for all sufficiently big 6-connected graphs. Jorgensen conjectured that it holds for all 6-connected graphs.



Author: Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas; Paul Wollan

Source: https://archive.org/



DOWNLOAD PDF




Related documents