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.

Source : oai:HAL:hal-00990600v1

Volume: Vol. 14 no. 2

Section: Graph Theory

Published on: November 23, 2012

Submitted on: April 12, 2012

Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

This page has been seen 107 times.

This article's PDF has been downloaded 278 times.