%A Mohr, Samuel
%D 2019
%T Cycles through a set of specified vertices of a planar graph
%K
%X 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.
%U http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1286
%J Acta Mathematica Universitatis Comenianae
%0 Journal Article
%P 963-966%V 88
%N 3
%@ 0862-9544
%8 2019-07-31