Graphe de Barnette-Bosák-Lederberg (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Graphe de Barnette-Bosák-Lederberg" in French language version.

refsWebsite

Global rank French rank

4^th place

12^th place

513^th place

972^nd place

3,558^th place

9,993^rd place

1,389^th place

508^th place

2^nd place

3^rd place

doi.org

(en) D. A. Holton et B. D. McKay, « The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices », Journal of Combinatorial Theory, Series B, vol. 45, n^o 3,‎ 1988, p. 305–319 (DOI 10.1016/0095-8956(88)90075-5)

(en) Lederberg, J. "DENDRAL-64: A System for Computer Construction, Enumeration and Notation of Organic Molecules as Tree Structures and Cyclic Graphs. Part II. Topology of Cyclic Graphs." Interim Report to the National Aeronautics and Space Administration. Grant NsG 81-60. December 15, 1965. [1]

(en) W. T. Tutte, « On Hamiltonian circuits », Journal of the London Mathematical Society (2nd ser.), vol. 21, n^o 2,‎ 1946, p. 98–101 (lire en ligne)

(en) Derek Holton and Robert E. L. Aldred. Planar Graphs, Regular Graphs, Bipartite Graphs and Hamiltonicity. Australasian Journal of Combinatorics, 20:111–131, 1999. [2]