چکیده مقاله
The Erdos Gy arf as conjecture states that every graph with minimum degree at least three has a cycle with length a power of 2 In this paper, we prove that if G isan outer planar graph of order at least 4 with minimum degree 2 that has at most three vertices of degree 2, then it contains a 4 cycle
کلیدواژهها
outer planar graph Erdos-Gyarfas conjecture Erdos Gyarfas conjecture
نویسندگان
Mohammad Hassan Shirdareh Haghighi
Department of Mathematics, Shiraz University, Shiraz, Iran
شیوه ارجاع
Shirdareh Haghighi, Mohammad Hassan,1401,A Note on the Erdos-Gy arf as Conjecture in Outer Planar Graphs,10th National Conference on Mathematics, Payame Noor University,Shiraz
ارائهشده در
مجموعه مقالات دهمین همایش ملی ریاضی دانشگاه پیام نور28 اردیبهشت 1401 · شیراز