Advertisement

Siberian Mathematical Journal

, Volume 32, Issue 1, pp 17–21 | Cite as

A characterization of chromatically rigid polynomials

  • O. V. Vorodin
  • I. G. Dmitriev
Article

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    A. A. Zykov, The Theory of Finite Graphs [in Russian], Vol. 1, Nauka, Moscow (1969).Google Scholar
  2. 2.
    F. Harary, Graph Theory, Addison-Wesley, Reading (1969).Google Scholar
  3. 3.
    R. C. Read, “An introduction to chromatic polynomials,” J. Combin. Theory,4, 52–71 (1968).Google Scholar
  4. 4.
    G. H. J. Meredith, “Coefficients of chromatic polynomials,” J. Combin. Theory,13, 14–17 (1972).Google Scholar
  5. 5.
    E. J. Farrel, “On chromatic coefficients,” Discrete Math.,29, 257–264 (1980).Google Scholar
  6. 6.
    K. Braun, M. Kretz, B. Walter, and M. Walter, “Die chromatischen Polynome interring-freier Graphen,” Manuscr. Math.,14, 223–224 (1974).Google Scholar
  7. 7.
    I. G. Dmitriev, “Weakly cyclic graphs with integral chromatic spectra,” in: Methods of of Discrete Analysis in the Solution of Combinatorial Problems, Institute of Mathematics of the Siberian Branch of the Academy of Sciences of the USSR, No. 34, Novosibirsk (1980), pp. 3–4.Google Scholar
  8. 8.
    E. G. Whitehead, “Chromaticity of two-trees,” J. Graph Theory,9, 279–284 (1985).Google Scholar
  9. 9.
    I. G. Dmitriev, “A characterization of a class of 2-trees in terms of their chromatic polynomials,” in: V All-Union Conference on Problems of Theoretical Cybernetics, Institute of Mathematics of the Siberian Branch of the Academy of Sciences of the USSR, Novosibirsk (1980), p. 126.Google Scholar
  10. 10.
    I. G. Dmitriev, “A characterization of the class of k-trees,” in: Methods of Discrete Analysis in Estimates of the Complexity of Control Systems, Institute of Mathematics of the Siberian Branch of the Academy of Sciences of the USSR No. 38, Novosibirisk (1982), pp. 9–18.Google Scholar
  11. 11.
    P. Vaderlind, “Chromatic uniqueness of k-trees,” in: Reports of the Math. Dept., No. 9, Univ. of Stockholm (1986), pp. 1–9.Google Scholar
  12. 12.
    C.-Y. Chao, N.-Z. Li, and S.-J. Xu, “On q-trees,” J. Graph Theory,10, 131–136 (1986).Google Scholar
  13. 13.
    O. V. Borodin, “The existence in G(n, m) of a graph with the fewest number of colorings in an arbitrary number of colors,” Thesis report, in: V All-Union Conference on problems of Theoretical Cybernetics, Institute of Mathematics of the Siberian Branch of the Academy of Sciences of the USSR, Novosibirsk (1980), p. 124.Google Scholar
  14. 14.
    W. T. Tutte, “The graph of the chromial of a graph,” Lecture Notes in Math.,452, 55–61, Springer-Verlag, Berlin (1975).Google Scholar

Copyright information

© Plenum Publishing Corporation 1991

Authors and Affiliations

  • O. V. Vorodin
  • I. G. Dmitriev

There are no affiliations available

Personalised recommendations