无K₄圆图的色数上界
组合数学
2012-12-18 v1
摘要
设G为一个不含4个顶点的团的圆图。我们证明G的色数不超过30。
引用
@article{arxiv.1212.3983,
title = {An Upper bound on the chromatic number of circle graphs without $K_4$},
author = {G. V. Nenashev},
journal= {arXiv preprint arXiv:1212.3983},
year = {2012}
}