搜索结果: 1-1 共查到“组合数学 Coloring claw-free graphs”相关记录1条 . 查询时间(0.047 秒)
We prove that every claw-free graph $G$ that doesn't contain a clique on $\Delta(G) \geq 9$ vertices can be $\Delta(G) - 1$ colored.