Abstract | ||
---|---|---|
Erd\H{o}s proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. |
Year | DOI | Venue |
---|---|---|
2000 | 10.1016/S0012-365X(99)00165-X | Discrete Mathematics |
Keywords | Field | DocType |
graph coloring,satisfiability,independent set | Discrete mathematics,Odd graph,Graph,Combinatorics,Chromatic scale,Foster graph,Star (graph theory),Triangle-free graph,Mathematics,Arbitrarily large,Graph coloring | Journal |
Volume | Issue | ISSN |
213 | 1-3 | 0012-365X |
Citations | PageRank | References |
3 | 0.41 | 5 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Béla Bollobás | 1 | 2696 | 474.16 |
Douglas B. West | 2 | 1176 | 185.69 |