Abstract : For two given graphs G and H , the planar Ramsey number P R ( G; H ) is the smallest integer n such that every planar graph F on n vertices either contains a copy of G , or its complement contains a copy of H . In this paper, we determine all planar Ramsey numbers for a triangle versus wheels.
https://hal.inria.fr/hal-00990600
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Soumis le : mardi 13 mai 2014 - 16:28:01
Dernière modification le : jeudi 7 septembre 2017 - 01:03:37
Document(s) archivé(s) le : lundi 10 avril 2017 - 22:49:04
