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. (C) 2017 Published by Elsevier Inc.
K-6 minors in large 6-connected graphs / Kawarabayashi, K; Norine, S; Thomas, R; Wollan, P. - In: JOURNAL OF COMBINATORIAL THEORY. - ISSN 0095-8956. - STAMPA. - 129:(2018), pp. 158-203. [10.1016/j.jetb.2017.09.007]
K-6 minors in large 6-connected graphs
Wollan, P
2018
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. (C) 2017 Published by Elsevier Inc.File allegati a questo prodotto
| File | Dimensione | Formato | |
|---|---|---|---|
|
Wollan_K6minors_2018.pdf
accesso aperto
Tipologia:
Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza:
Creative commons
Dimensione
483.18 kB
Formato
Adobe PDF
|
483.18 kB | Adobe PDF |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
