Type: Article
Publication Date: 2012-11-23
Citations: 5
DOI: https://doi.org/10.46298/dmtcs.584
Graph Theory 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.