We prove that Halin graphs,1-trees and outerplanar graphs satisfy the conjecture presented by N. Alon that the acyclic edge chromatic number of any graph does not exceed its maximum degree plus 2.
证明了Halin图、1-树和外平面图满足由N.Alon提出的任何一个图的无圈边色数不超过其最大度加2的猜想。
参考来源 - 若干图着色问题的研究·2,447,543篇论文数据,部分数据来源于NoteExpress
应用推荐