@article{M19cyclesspecifiedvertices,
title = {Cycles through a set of specified vertices of a planar graph},
author = {Mohr, Samuel},
journal = {Acta Mathematica Universitatis Comenianae},
number = {3},
pages = {963--966},
volume = {88},
year = {2019},
url = {http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1286},
biburl = {http://samuel-mohr.de/files/bib/extabstr2.bib},
note = {Eurocomb 2019},
abstract = {Confirming a conjecture of Plummer, Thomas and Yu proved that a 4-connected planar graph contains a cycle through all but two (freely choosable) vertices.
Here we prove that a planar graph {$G$} contains a cycle through {$X\setminus \{x_1,x_2\}$} if {$X\subseteq V(G)$}, {$X$} large enough, {$x_1,x_2\in X$}, and {$X$} cannot be separated in {$G$} by removing less than 4 vertices.}
}