Grafo poliedrico (Italian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Grafo poliedrico" in Italian language version.

refsWebsite

Global rank Italian rank

2^nd place

7^th place

799^th place

22^nd place

513^th place

577^th place

742^nd place

1,122^nd place

451^st place

2,019^th place

low place

low place

low place

low place

ams.org

W. T. Tutte, How to draw a graph, in Proceedings of the London Mathematical Society, vol. 13, 1963, pp. 743–767, DOI:10.1112/plms/s3-13.1.743, MR 0158387..

doi.org

dx.doi.org

W. T. Tutte, How to draw a graph, in Proceedings of the London Mathematical Society, vol. 13, 1963, pp. 743–767, DOI:10.1112/plms/s3-13.1.743, MR 0158387..
Branko Grünbaum e T. S. Motzkin, Longest simple paths in polyhedral graphs, in Journal of the London Mathematical Society, s1-37, n. 1, 1962, pp. 152–160, DOI:10.1112/jlms/s1-37.1.152..
A. J. W. Duijvestijn, The number of polyhedral (3-connected planar) graphs (PDF), in Mathematics of Computation, vol. 65, 1996, pp. 1289–1293, DOI:10.1090/S0025-5718-96-00749-1..

oadoi.org

W. T. Tutte, How to draw a graph, in Proceedings of the London Mathematical Society, vol. 13, 1963, pp. 743–767, DOI:10.1112/plms/s3-13.1.743, MR 0158387..
Branko Grünbaum e T. S. Motzkin, Longest simple paths in polyhedral graphs, in Journal of the London Mathematical Society, s1-37, n. 1, 1962, pp. 152–160, DOI:10.1112/jlms/s1-37.1.152..

oeis.org

Successione A002840 nel progetto OEIS, su oeis.org.
Successione A000944 in OEIS, su oeis.org.

utwente.nl

ris.utwente.nl

A. J. W. Duijvestijn, The number of polyhedral (3-connected planar) graphs (PDF), in Mathematics of Computation, vol. 65, 1996, pp. 1289–1293, DOI:10.1090/S0025-5718-96-00749-1..

wikipedia.org

en.wikipedia.org

Al riguardo, si può consultare la voce Tutte embedding presente nella Wikipedia in inglese.

wolfram.com

mathworld.wolfram.com

Grafo di Herschel, su mathworld.wolfram.com.
Goldner-Harary Graph, su mathworld.wolfram.com.