The first author was partially supported by NSF of Fujian ( JA15301 , 2016J01673 ) and the second author was partially supported by NSF of China ( 11571134 ).
机构署名：
本校为第一且通讯机构
院系归属：
数学与统计学学院
摘要：
In this paper, we investigate the signed graph version of Erdös problem: Is there a constant c such that every signed planar graph without k-cycles, where 4≤k≤c, is 3-colorable and prove that each signed planar graph without cycles of length...
