We improve the known upper bounds for the chromatic number of cubic graphs with large girth. In addition, we also improve the lower bound on the independent set and give a simple proof of a weaker upper bound.
We improve the known upper bounds for the chromatic number of cubic graphs with large girth. In addition, we also improve the lower bound on the independent set and give a simple proof of a weaker upper bound. (en)