A Note on the Erdos-Gy arf as Conjecture in Outer Planar Graphs

The Erdos-Gy arf as conjecture states that every graph with minimum degree at least three has a cycle with length a power of ۲. In this paper, we prove that if G isan outer planar graph of order at least ۴ with minimum degree ۲ that has at most three vertices of degree ۲, then it contains a ۴-cycle.

کلیدواژه ها:

Erdos-Gyarfas conjecture ، outer planar graph