 | 1 | initial version |
I know it is kind of silly, but the computation of the chromatic polynomial of the empty graph loops forever.
graphs.EmptyGraph().chromatic_polynomial()
(no question here... just a comment. I guess it is easy to correct, since it is supposed to be 1)
| | 2 | retagged |
I know it is kind of silly, but the computation of the chromatic polynomial of the empty graph loops forever.
graphs.EmptyGraph().chromatic_polynomial()
(no question here... just a comment. I guess it is easy to correct, since it is supposed to be 1)
| | 3 | retagged |
I know it is kind of silly, but the computation of the chromatic polynomial of the empty graph loops forever.
graphs.EmptyGraph().chromatic_polynomial()
(no question here... just a comment. I guess it is easy to correct, since it is supposed to be 1)
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.