If a graph G is k-colorable and k

• A. n-colorable
• B. n² nodes
• C. (k+n)-colorable
• D. (k³+n³+1) nodes