An Upper bound on the chromatic number of circle graphs without
arXiv:1212.3983 · doi:10.1007/s10958-012-0886-0
Abstract
Let be a circle graph without clique on 4 vertices. We prove that the chromatic number of doesn't exceed 30.
arXiv:1212.3983 · doi:10.1007/s10958-012-0886-0
Let be a circle graph without clique on 4 vertices. We prove that the chromatic number of doesn't exceed 30.