论文信息 - On graph invariants given by linear recurrence relations

On graph invariants given by linear recurrence relations

On considere la theorie des «invariants donnes par une relation de recurrence lineaire» par lesquels il y a des exemples dans la litterature sur les graphes, comme les polynomes chromatiques et bichromatiques. On reprend la theorie des «reussite systems» de Clurch et Rosser, en calcul lambda et en algebre universelle, pour la generaliser et l'appliquer a la theorie des graphes, et on obtient de nouveaux des variantes de graphe

David N. Yetter | D. Yetter

[1] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .

[2] David Joyce,et al. Generalized chromatic polynomials , 1984, Discret. Math..

[3] W. J. Thron,et al. Encyclopedia of Mathematics and its Applications. , 1982 .

[4] H. Whitney. A logical expansion in mathematics , 1932 .

[5] M. Newman. On Theories with a Combinatorial Definition of "Equivalence" , 1942 .

[6] Frank Harary,et al. Graph Theory , 2016 .

[7] Joan S. Birman,et al. Braids : proceedings of the AMS-IMS-SIAM joint summer research conference on Artin's braid group held July 13-26, 1986 at the University of California, Santa Cruz, California , 1988 .

[8] A. Church,et al. Some properties of conversion , 1936 .

[9] William T. Tutte. A Ring in Graph Theory , 1947 .

[10] Kenneth C. Millett,et al. A new polynomial invariant of knots and links , 1985 .

[11] Norman Biggs,et al. Approximations for chromatic polynomials , 1976 .

[12] H. E. Vaughan. Review: M. H. A. Newman, On Theories with a Combinatorial Definition of "Equivalence." , 1942 .