On long cycles through four prescribed vertices of a polyhedral graph
Discussiones Mathematicae. Graph Theory, Tome 28 (2008) no. 3, pp. 441-451

Voir la notice de l'article provenant de la source Library of Science

For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length at least (1/36)c+(20/3) through any four vertices of G.
Keywords: graph, long cycle, prescribed vertices
@article{DMGT_2008_28_3_a4,
     author = {Harant, Jochen and Jendrol', Stanislav and Walther, Hansjoachim},
     title = {On long cycles through four prescribed vertices of a polyhedral graph},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {441--451},
     publisher = {mathdoc},
     volume = {28},
     number = {3},
     year = {2008},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2008_28_3_a4/}
}
TY  - JOUR
AU  - Harant, Jochen
AU  - Jendrol', Stanislav
AU  - Walther, Hansjoachim
TI  - On long cycles through four prescribed vertices of a polyhedral graph
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2008
SP  - 441
EP  - 451
VL  - 28
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2008_28_3_a4/
LA  - en
ID  - DMGT_2008_28_3_a4
ER  - 
%0 Journal Article
%A Harant, Jochen
%A Jendrol', Stanislav
%A Walther, Hansjoachim
%T On long cycles through four prescribed vertices of a polyhedral graph
%J Discussiones Mathematicae. Graph Theory
%D 2008
%P 441-451
%V 28
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2008_28_3_a4/
%G en
%F DMGT_2008_28_3_a4
Harant, Jochen; Jendrol', Stanislav; Walther, Hansjoachim. On long cycles through four prescribed vertices of a polyhedral graph. Discussiones Mathematicae. Graph Theory, Tome 28 (2008) no. 3, pp. 441-451. http://geodesic.mathdoc.fr/item/DMGT_2008_28_3_a4/