Name
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 K-r, 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. |
Year | Venue | Keywords |
|---|---|---|
2010 | ELECTRONIC JOURNAL OF COMBINATORICS | crossing number |
Field | DocType | Volume |
Graph,Complete graph,Discrete mathematics,Combinatorics,Crossing number (graph theory),Vertex (geometry),Chromatic scale,Conjecture,Mathematics | Journal | 17.0 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 2 |
PageRank | References | Authors |
0.42 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| János Barát | 1 | 141 | 14.18 |
| Géza Tóth | 2 | 581 | 55.60 |