Abstract
We consider the minimum number of edges in a k-edge-connected graph of order n with chromatic number at least c, obtaining the optimal bounds in most cases.
Original language | English (US) |
---|---|
Pages (from-to) | 209-213 |
Number of pages | 5 |
Journal | Graphs and Combinatorics |
Volume | 10 |
Issue number | 2 |
DOIs | |
State | Published - Jun 1994 |