Every signed planar graph without cycles of length from 4 to 8 is 3-colorable期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

Every signed planar graph without cycles of length from 4 to 8 is 3-colorable

Authors:	Lili Hu Xiangwen Li

Affiliation:	1. School of Mathematics & Statistics, Central China Normal University, Wuhan 430079, China;2. Minnan Normal University, Zhangzhou 363000, China

Abstract:	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 \leq k \leq c$ , is 3-colorable and prove that each signed planar graph without cycles of length from 4 to 8 is 3-colorable.

Keywords:	Signed graph Planar graph 3-colorable
本文献已被 ScienceDirect 等数据库收录！