A note on uniquely 10-colorable graphs
arXiv (Cornell University)（2020）
摘要
We prove for k at most 10, that every graph of chromatic number k with a unique k-coloring admits a clique minor of order k.
更多查看译文
关键词
graphs
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要