Article ID Journal Published Year Pages File Type
8903125 Discrete Mathematics 2018 5 Pages PDF
Abstract
In this paper, we propose a new topological lower bound for the chromatic number of a special family of graphs. As an application of this bound, we give a new proof of the well-known fact that complete graphs are test graphs.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A topological lower bound for the chromatic number of a special family of graphs
Authors
,