Every planar graph without 5-cycles and K4− and adjacent 4-cycles is (2,0,0)-colorable 期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

Every planar graph without 5-cycles and K4− and adjacent 4-cycles is (2,0,0)-colorable

摘要：
收稿时间：	2018-02-28
本文献已被 ScienceDirect 等数据库收录！