Abstract
Abstract The planar Ramsey number PR (G, H) is defined as the smallest integer n for which any 2-colouring of edges of Kn with red and blue where red edges induce a planar graph leads to either are red copy of G, or a blue H. In this note we study the value of the planar Ramsey numbers as well as their weak induced versions IPRw(G, H), for some classes of graphs Inparticular we calculate almost all values of PR (G, Kn) and IPRw(G, Kn) where G is connected.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
