Acta mathematica Universitatis Comenianae, Tome 88 (2019) no. 3, pp. 963-966
Citer cet article
Samuel Mohr; Samuel Mohr. Cycles through a set of specified vertices of a planar graph. Acta mathematica Universitatis Comenianae, Tome 88 (2019) no. 3, pp. 963-966. http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a93/
@article{AMUC_2019_88_3_a93,
author = {Samuel Mohr and Samuel Mohr},
title = { Cycles through a set of specified vertices of a planar graph},
journal = {Acta mathematica Universitatis Comenianae},
pages = {963--966},
year = {2019},
volume = {88},
number = {3},
url = {http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a93/}
}
TY - JOUR
AU - Samuel Mohr
AU - Samuel Mohr
TI - Cycles through a set of specified vertices of a planar graph
JO - Acta mathematica Universitatis Comenianae
PY - 2019
SP - 963
EP - 966
VL - 88
IS - 3
UR - http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a93/
ID - AMUC_2019_88_3_a93
ER -
%0 Journal Article
%A Samuel Mohr
%A Samuel Mohr
%T Cycles through a set of specified vertices of a planar graph
%J Acta mathematica Universitatis Comenianae
%D 2019
%P 963-966
%V 88
%N 3
%U http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a93/
%F AMUC_2019_88_3_a93
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.
