K 6 minors in 6-connected graphs of bounded tree-widthReportar como inadecuado



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


K 6 minors in 6-connected graphs of bounded tree-width - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Descargar gratis o leer online en formato PDF el libro: 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.



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

Fuente: https://archive.org/



DESCARGAR PDF




Documentos relacionados