Abstract
An algorithm for deriving the chromatic polynomial of a graph in coefficient form is described. A FORTRAN implementation is given, and some computational experience is summarized.
Zusammenfassung
Es wird ein Algorithmus beschrieben, der das chromatische Polynom eines Graphen in Koeffizientenform liefert. Ein FORTRAN-Programm wird angegeben und einige praktische Erfahrungen werden kurz zusammengefaßt.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Busacker, R. G., Saaty, T. L.: Finite Graphs and Networks. McGraw-Hill 1965.
Harary, F.: Graph Theory. Addison-Wesley 1969.
James, K. R., Riha, W.: On Certain Properties of Chromatic Polynomials. Submitted to J. Combinatorial Theory.
James, K. R., Riha, W.: Algorithm for Generating Graphs of a Given Degree Specification. Submitted to Computing.
Read, R. C.: An Introduction to Chromatic Polynomials. J. Combinatorial Theory4, 52–71 (1968).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
James, K.R., Riha, W. Algorithm 24 algorithm for deriving the chromatic polynomial of a graph. Computing 14, 195–203 (1975). https://doi.org/10.1007/BF02242318
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02242318