 | |
 |
 |
|
 |
|
 |
|
 |
|
 |
|
 |
|
 |
|
 |
|
 |
|
 |
|
 |
 | |
|
 |
|
 |
 | |
|
 |
|
 |
|
 |
|
 |
|
 |
|
 |
|
 |
|
 |
Volume 8, Issue 4
This note presents some nonevident ways for determining the color ability of a graph and the number of its colorings via algebraic manipulations of polynomials in many variables.
Download this article:
Mathematica Notebook PDF
(If you don't have a copy of Mathematica, you can view notebooks with Mathematica Player.)
Copyright © 2002 Wolfram Media, Inc. All rights reserved.