Skip to main content
SpringerLink
Log in

Algorithm 24 algorithm for deriving the chromatic polynomial of a graph

Algorithmus zur Bestimmung des chromatischen Polynoms eines Graphen

  • Published:
Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Busacker, R. G., Saaty, T. L.: Finite Graphs and Networks. McGraw-Hill 1965.

  2. Harary, F.: Graph Theory. Addison-Wesley 1969.

  3. James, K. R., Riha, W.: On Certain Properties of Chromatic Polynomials. Submitted to J. Combinatorial Theory.

  4. James, K. R., Riha, W.: Algorithm for Generating Graphs of a Given Degree Specification. Submitted to Computing.

  5. Read, R. C.: An Introduction to Chromatic Polynomials. J. Combinatorial Theory4, 52–71 (1968).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Computer Studies, University of Leeds, LS2 9JT, Leeds, England

    K. R. James &  W. Riha

Authors
  1. K. R. James
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. Riha
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02242318

Keywords

Search

Navigation