Friendship graph (English Wikipedia)
Analysis of information sources in references of the Wikipedia article "Friendship graph" in English language version.
refsWebsite
Global rank
English rank
513th place
537th place
1,518th place
1,072nd place
ams.org
mathscinet.ams.org
- Bermond, J.-C.; Brouwer, A. E.; Germa, A. (1978), "Systèmes de triplets et différences associées", Problèmes Combinatoires et Théorie des Graphes (Univ. Orsay, 1976), Colloq. Intern. du CNRS, vol. 260, CNRS, Paris, pp. 35–38, MR 0539936.
- Bermond, J.-C.; Kotzig, A.; Turgeon, J. (1978), "On a combinatorial problem of antennas in radioastronomy", Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. I, Colloq. Math. Soc. János Bolyai, vol. 18, North-Holland, Amsterdam-New York, pp. 135–149, MR 0519261.
- Erdős, P.; Füredi, Z.; Gould, R. J.; Gunderson, D. S. (1995), "Extremal graphs for intersecting triangles", Journal of Combinatorial Theory, Series B, 64 (1): 89–100, CiteSeerX 10.1.1.491.974, doi:10.1006/jctb.1995.1026, MR 1328293.
doi.org
- Gallian, Joseph A. (January 3, 2007), "A dynamic survey of graph labeling", Electronic Journal of Combinatorics: DS6, doi:10.37236/27.
- Chvátal, Václav; Kotzig, Anton; Rosenberg, Ivo G.; Davies, Roy O. (1976), "There are friendship graphs of cardinal ", Canadian Mathematical Bulletin, 19 (4): 431–433, doi:10.4153/cmb-1976-064-1.
- Huneke, Craig (1 January 2002), "The Friendship Theorem", The American Mathematical Monthly, 109 (2): 192–194, doi:10.2307/2695332, JSTOR 2695332
- Erdős, P.; Füredi, Z.; Gould, R. J.; Gunderson, D. S. (1995), "Extremal graphs for intersecting triangles", Journal of Combinatorial Theory, Series B, 64 (1): 89–100, CiteSeerX 10.1.1.491.974, doi:10.1006/jctb.1995.1026, MR 1328293.
dur.ac.uk
- Mertzios, George; Walter Unger (2008), "The friendship problem on graphs" (PDF), Relations, Orders and Graphs: Interaction with Computer Science
groups.google.com
- van der Vekens, Alexander (11 October 2018), "Friendship Theorem (#83 of "100 theorem list")", Metamath mailing list
jstor.org
- Huneke, Craig (1 January 2002), "The Friendship Theorem", The American Mathematical Monthly, 109 (2): 192–194, doi:10.2307/2695332, JSTOR 2695332
psu.edu
citeseerx.ist.psu.edu
- Erdős, P.; Füredi, Z.; Gould, R. J.; Gunderson, D. S. (1995), "Extremal graphs for intersecting triangles", Journal of Combinatorial Theory, Series B, 64 (1): 89–100, CiteSeerX 10.1.1.491.974, doi:10.1006/jctb.1995.1026, MR 1328293.
renyi.hu
- Erdős, Paul; Rényi, Alfréd; Sós, Vera T. (1966), "On a problem of graph theory" (PDF), Studia Sci. Math. Hungar., 1: 215–235.
uiuc.edu
math.uiuc.edu
- Erdős, P.; Füredi, Z.; Gould, R. J.; Gunderson, D. S. (1995), "Extremal graphs for intersecting triangles", Journal of Combinatorial Theory, Series B, 64 (1): 89–100, CiteSeerX 10.1.1.491.974, doi:10.1006/jctb.1995.1026, MR 1328293.