Polinomio cromatico (Italian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Polinomio cromatico" in Italian language version.

refsWebsite

Global rank Italian rank

6doi.org

2^nd place

7^th place

4oadoi.org

799^th place

22^nd place

1arxiv.org

69^th place

235^th place

arxiv.org

Huh (2012) J. Huh, Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs, 2012, arXiv:1008.4749v3.

doi.org

dx.doi.org

Stanley (1973) R. P. Stanley, Acyclic orientations of graphs, in Disc. Math., vol. 5, n. 2, 1973, pp. 171-178, DOI:10.1016/0012-365X(73)90108-8.
Sokal (2004) A. D. Sokal, Chromatic Roots are Dense in the Whole Complex Plane, in Combinatorics, Probability and Computing, vol. 13, n. 2, 2004, pp. 221-261, DOI:10.1017/S0963548303006023.
Naor, Naor & Scahffer (1987) J. Naor, M. Naor e A. Schaffer, Fast parallel algorithms for chordal graphs, in Proc. 19th ACM Symp. Theory of Computing (STOC '87), 1987, pp. 355-364, DOI:10.1145/28395.28433.
Giménez, Hliněný & Noy (2005); Makowsky, Rotics, Averbouch & Godlin (2006) O. Giménez, P. Hliněný e M. Noy, Computing the Tutte polynomial on graphs of bounded clique-width, in Proc. 31st Int. Worksh. Graph-Theoretic Concepts in Computer Science (WG 2005), Lecture Notes in Computer Science, vol. 3787, Springer-Verlag, 2005, pp. 59-68, DOI:10.1007/11604686_6. J. A. Makowsky, U. Rotics, I. Averbouch e B. Godlin, Computing graph polynomials on graphs of bounded clique-width, in Proc. 32nd Int. Worksh. Graph-Theoretic Concepts in Computer Science (WG 2006), Lecture Notes in Computer Science, vol. 4271, Springer-Verlag, 2006, pp. 191-204, DOI:10.1007/11917496_18.
Jaeger, Vertigan & Welsh (1990), basato su una riduzione in Linial (1986). F. Jaeger, D. L. Vertigan e D. J. A. Welsh, On the computational complexity of the Jones and Tutte polynomials, in Mathematical Proceedings of the Cambridge Philosophical Society, vol. 108, 1990, pp. 35-53, DOI:10.1017/S0305004100068936. N. Linial, Hard enumeration problems in geometry and combinatorics, in SIAM J. Algebraic Discrete Methods, vol. 7, n. 2, 1986, pp. 331-335, DOI:10.1137/0607036.
Goldberg & Jerrum (2008) L.A. Goldberg e M. Jerrum, Inapproximability of the Tutte polynomial, in Information and Computation, vol. 206, n. 7, 2008, p. 908, DOI:10.1016/j.ic.2008.04.003.

oadoi.org

Stanley (1973) R. P. Stanley, Acyclic orientations of graphs, in Disc. Math., vol. 5, n. 2, 1973, pp. 171-178, DOI:10.1016/0012-365X(73)90108-8.
Sokal (2004) A. D. Sokal, Chromatic Roots are Dense in the Whole Complex Plane, in Combinatorics, Probability and Computing, vol. 13, n. 2, 2004, pp. 221-261, DOI:10.1017/S0963548303006023.
Jaeger, Vertigan & Welsh (1990), basato su una riduzione in Linial (1986). F. Jaeger, D. L. Vertigan e D. J. A. Welsh, On the computational complexity of the Jones and Tutte polynomials, in Mathematical Proceedings of the Cambridge Philosophical Society, vol. 108, 1990, pp. 35-53, DOI:10.1017/S0305004100068936. N. Linial, Hard enumeration problems in geometry and combinatorics, in SIAM J. Algebraic Discrete Methods, vol. 7, n. 2, 1986, pp. 331-335, DOI:10.1137/0607036.
Goldberg & Jerrum (2008) L.A. Goldberg e M. Jerrum, Inapproximability of the Tutte polynomial, in Information and Computation, vol. 206, n. 7, 2008, p. 908, DOI:10.1016/j.ic.2008.04.003.