Abstract
Albertson conjectured that if a graph G has chromatic number r, then the crossing number of G is at least as large as the crossing number of Kr, the complete graph on r vertices. Albertson, Cranston, and Fox verified the conjecture for r < 12. In this paper we prove it for r < 16.
Cite
CITATION STYLE
APA
Bárat, J., & Tóth, G. (2010). Towards the Albertson conjecture. Electronic Journal of Combinatorics, 17(1), 1–15. https://doi.org/10.37236/345
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free