Grafo di Goldner-Harary (Italian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Grafo di Goldner-Harary" in Italian language version.

refsWebsite

Global rank Italian rank

799^th place

22^nd place

2^nd place

7^th place

6,873^rd place

low place

doi.org

Dillencourt, M. B., Polyhedra of small orders and their Hamiltonian properties, in Journal of Combinatorial Theory, Series B, vol. 66, 1996, pp. 87–122, DOI:10.1006/jctb.1996.0008..
Frank R. Bernhart e Paul C. Kainen, The book thickness of a graph, in Journal of Combinatorial Theory, Series B, vol. 27, n. 3, 1979, pp. 320–331, DOI:10.1016/0095-8956(79)90021-2.. Cfr. in particolare la figura 9.
Mihalis Yannakakis, Four pages are necessary and sufficient for planar graphs, in Proc. 18th ACM Symp. Theory of Computing (STOC), 1986, pp. 104–108, DOI:10.1145/12130.12141..
Günter Ewald, Hamiltonian circuits in simplicial complexes, in Geometriae Dedicata, vol. 2, n. 1, 1973, pp. 115–125, DOI:10.1007/BF00149287..

A. Goldner e F. Harary, Note on a smallest nonhamiltonian maximal planar graph, in Bull. Malaysian Math. Soc., vol. 6, n. 1, 1975, pp. 41–42.. See also the same journal 6(2):33 (1975) and 8:104-106 (1977). Reference from elenco delle pubblicazioni di Harary.

Dillencourt, M. B., Polyhedra of small orders and their Hamiltonian properties, in Journal of Combinatorial Theory, Series B, vol. 66, 1996, pp. 87–122, DOI:10.1006/jctb.1996.0008..
Frank R. Bernhart e Paul C. Kainen, The book thickness of a graph, in Journal of Combinatorial Theory, Series B, vol. 27, n. 3, 1979, pp. 320–331, DOI:10.1016/0095-8956(79)90021-2.. Cfr. in particolare la figura 9.
Mihalis Yannakakis, Four pages are necessary and sufficient for planar graphs, in Proc. 18th ACM Symp. Theory of Computing (STOC), 1986, pp. 104–108, DOI:10.1145/12130.12141..
Günter Ewald, Hamiltonian circuits in simplicial complexes, in Geometriae Dedicata, vol. 2, n. 1, 1973, pp. 115–125, DOI:10.1007/BF00149287..