Neil Robertson (mathematician) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Neil Robertson (mathematician)" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

6worldcat.org

5^th place

4ams.org

451^st place

277^th place

1web.archive.org

1^st place

1harvard.edu

18^th place

17^th place

1nih.gov

4^th place

1brandonu.ca

low place

1mathgenealogy.org

4,501^st place

3,002^nd place

1sciencedirect.com

149^th place

178^th place

1princeton.edu

741^st place

577^th place

1arxiv.org

69^th place

59^th place

ams.org

Robertson, Neil (1964). "The smallest graph of girth 5 and valency 4". Bulletin of the American Mathematical Society. 70 (6): 824–825. doi:10.1090/S0002-9904-1964-11250-7. ISSN 0273-0979.
Robertson, Neil; Sanders, Daniel; Seymour, Paul; Thomas, Robin (1996). "A new proof of the four-colour theorem". Electronic Research Announcements of the American Mathematical Society. 2 (1): 17–25. doi:10.1090/S1079-6762-96-00003-0. ISSN 1079-6762.
Delbert Rey Fulkerson Prize, American Mathematical Society, accessed 2012-01-03.
List of Fellows of the American Mathematical Society, retrieved 2013-07-07.

arxiv.org

Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006-07-01). "The strong perfect graph theorem". Annals of Mathematics. 164 (1): 51–229. arXiv:math/0212070. doi:10.4007/annals.2006.164.51. ISSN 0003-486X.

brandonu.ca

The Sickle, Brandon College Year Book 1959 p.30

doi.org

Bhattacharjee, Yudhijit (9 December 2011), "Saudi Universities offer cash in exchange for academic prestige", Science, 334 (6061): 1344–1345, Bibcode:2011Sci...334.1344B, doi:10.1126/science.334.6061.1344, PMID 22158799.
Robertson, Neil; Seymour, P. D. (2004-11-01). "Graph Minors. XX. Wagner's conjecture". Journal of Combinatorial Theory, Series B. Special Issue Dedicated to Professor W.T. Tutte. 92 (2): 325–357. doi:10.1016/j.jctb.2004.08.001. ISSN 0095-8956.
Robertson, Neil; Seymour, P. D (2003-09-01). "Graph Minors. XVI. Excluding a non-planar graph". Journal of Combinatorial Theory, Series B. 89 (1): 43–76. doi:10.1016/S0095-8956(03)00042-X. ISSN 0095-8956.
Robertson, Neil (1964). "The smallest graph of girth 5 and valency 4". Bulletin of the American Mathematical Society. 70 (6): 824–825. doi:10.1090/S0002-9904-1964-11250-7. ISSN 0273-0979.
Robertson, Neil; Seymour, Paul; Thomas, Robin (1993-09-01). "Hadwiger's conjecture forK6-free graphs". Combinatorica. 13 (3): 279–361. doi:10.1007/BF01202354. ISSN 1439-6912.
Robertson, Neil; Sanders, Daniel; Seymour, Paul; Thomas, Robin (1996). "A new proof of the four-colour theorem". Electronic Research Announcements of the American Mathematical Society. 2 (1): 17–25. doi:10.1090/S1079-6762-96-00003-0. ISSN 1079-6762.
Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006-07-01). "The strong perfect graph theorem". Annals of Mathematics. 164 (1): 51–229. arXiv:math/0212070. doi:10.4007/annals.2006.164.51. ISSN 0003-486X.

harvard.edu

ui.adsabs.harvard.edu

Bhattacharjee, Yudhijit (9 December 2011), "Saudi Universities offer cash in exchange for academic prestige", Science, 334 (6061): 1344–1345, Bibcode:2011Sci...334.1344B, doi:10.1126/science.334.6061.1344, PMID 22158799.

mathgenealogy.org

G. Neil (George) Robertson at the Mathematics Genealogy Project

nih.gov

pubmed.ncbi.nlm.nih.gov

Bhattacharjee, Yudhijit (9 December 2011), "Saudi Universities offer cash in exchange for academic prestige", Science, 334 (6061): 1344–1345, Bibcode:2011Sci...334.1344B, doi:10.1126/science.334.6061.1344, PMID 22158799.

princeton.edu

annals.math.princeton.edu

Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006-07-01). "The strong perfect graph theorem". Annals of Mathematics. 164 (1): 51–229. arXiv:math/0212070. doi:10.4007/annals.2006.164.51. ISSN 0003-486X.

sciencedirect.com

Robertson, Neil; Seymour, P. D (2003-09-01). "Graph Minors. XVI. Excluding a non-planar graph". Journal of Combinatorial Theory, Series B. 89 (1): 43–76. doi:10.1016/S0095-8956(03)00042-X. ISSN 0095-8956.

web.archive.org

Neil Robertson awarded the title of Distinguished Professor, David Goss, Ohio State, 2006-09-26.

worldcat.org

search.worldcat.org

Robertson, Neil; Seymour, P. D. (2004-11-01). "Graph Minors. XX. Wagner's conjecture". Journal of Combinatorial Theory, Series B. Special Issue Dedicated to Professor W.T. Tutte. 92 (2): 325–357. doi:10.1016/j.jctb.2004.08.001. ISSN 0095-8956.
Robertson, Neil; Seymour, P. D (2003-09-01). "Graph Minors. XVI. Excluding a non-planar graph". Journal of Combinatorial Theory, Series B. 89 (1): 43–76. doi:10.1016/S0095-8956(03)00042-X. ISSN 0095-8956.
Robertson, Neil (1964). "The smallest graph of girth 5 and valency 4". Bulletin of the American Mathematical Society. 70 (6): 824–825. doi:10.1090/S0002-9904-1964-11250-7. ISSN 0273-0979.
Robertson, Neil; Seymour, Paul; Thomas, Robin (1993-09-01). "Hadwiger's conjecture forK6-free graphs". Combinatorica. 13 (3): 279–361. doi:10.1007/BF01202354. ISSN 1439-6912.
Robertson, Neil; Sanders, Daniel; Seymour, Paul; Thomas, Robin (1996). "A new proof of the four-colour theorem". Electronic Research Announcements of the American Mathematical Society. 2 (1): 17–25. doi:10.1090/S1079-6762-96-00003-0. ISSN 1079-6762.
Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006-07-01). "The strong perfect graph theorem". Annals of Mathematics. 164 (1): 51–229. arXiv:math/0212070. doi:10.4007/annals.2006.164.51. ISSN 0003-486X.