Graphe complet (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Graphe complet" in French language version.

refsWebsite

Global rank French rank

2^nd place

3^rd place

3,051^st place

182^nd place

6^th place

63^rd place

4^th place

12^th place

18^th place

118^th place

451^st place

1,058^th place

ams.org

Shengjun Pan et R. Bruce Richter, « The crossing number of $K 11$ is $100$ », Journal of Graph Theory, vol. 56, n^o 2,‎ 2007, p. 128–134 (DOI 10.1002/jgt.20249, MR 2350621).

archive.org

(en) Thomas L Pirnot, Mathematics all around, Addison Wesley, 2001 (ISBN 9780201308150, lire en ligne ), p. 154

doi.org

dx.doi.org

T.L. Saaty, « The minimum number of intersections in complete graphs », Proceedings of the National Academy of Sciences of the United States of America, vol. 52,‎ 1964, p. 688–690 (PMID 16591215, PMCID 300329, DOI 10.1073/pnas.52.3.688, Bibcode 1964PNAS...52..688S)
Shengjun Pan et R. Bruce Richter, « The crossing number of $K 11$ is $100$ », Journal of Graph Theory, vol. 56, n^o 2,‎ 2007, p. 128–134 (DOI 10.1002/jgt.20249, MR 2350621).

google.fr

books.google.fr

(en) David Gries et Fred B. Schneider, A logical approach to discrete math, Springer-Verlag, coll. « Texts and monographs in computer science », 1995 (ISBN 978-0-387-94115-8 et 978-3-540-94115-6, lire en ligne ), p. 436

harvard.edu

ui.adsabs.harvard.edu

T.L. Saaty, « The minimum number of intersections in complete graphs », Proceedings of the National Academy of Sciences of the United States of America, vol. 52,‎ 1964, p. 688–690 (PMID 16591215, PMCID 300329, DOI 10.1073/pnas.52.3.688, Bibcode 1964PNAS...52..688S)

nih.gov

ncbi.nlm.nih.gov

T.L. Saaty, « The minimum number of intersections in complete graphs », Proceedings of the National Academy of Sciences of the United States of America, vol. 52,‎ 1964, p. 688–690 (PMID 16591215, PMCID 300329, DOI 10.1073/pnas.52.3.688, Bibcode 1964PNAS...52..688S)