加载中…
2015-06-15
The 3-colorability of planar graphs without cycles of length 4, 6 and 9
Yingli KangLigang JinYingqian Wang
文献摘要
In this paper, we prove that planar graphs without cycles of length 4, 6, 9 are 3-colorable.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本