Title of article :
Planar Ramsey numbers for cycles Original Research Article
Author/Authors :
Izolda Gorgol، نويسنده , , Andrzej Ruci?ski، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
Pages :
7
From page :
4389
To page :
4395
Abstract :
For two given graphs G and H the planar Ramsey number image 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 H. By studying the existence of subhamiltonian cycles in complements of sparse graphs, we determine all planar Ramsey numbers for pairs of cycles.
Keywords :
Ramsey number , Planar graph , Cycles
Journal title :
Discrete Mathematics
Serial Year :
2008
Journal title :
Discrete Mathematics
Record number :
947054
Link To Document :
بازگشت