首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Planar Ramsey numbers for cycles
Authors:Izolda Gorgol
Institution:a Department of Applied Mathematics, Technical University of Lublin, ul. Nadbystrzycka 38, 20-618 Lublin, Poland
b Department of Discrete Mathematics, Adam Mickiewicz University, ul. Umultowska 87, 61-614 Poznań, Poland
Abstract:For two given graphs G and H the planar Ramsey number PR(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 H. By studying the existence of subhamiltonian cycles in complements of sparse graphs, we determine all planar Ramsey numbers for pairs of cycles.
Keywords:05D10  05C55
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号