Complete graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Complete graph" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
1st place
1st place
3rd place
3rd place
69th place
59th place
6th place
6th place
11th place
8th place
18th place
17th place
low place
low place
low place
low place
6,934th place
4,192nd place
5th place
5th place
6,413th place
4,268th place
207th place
136th place
4th place
4th place
low place
low place
451st place
277th place

ams.org

mathscinet.ams.org

archive.org

arxiv.org

bham.ac.uk

pure-oai.bham.ac.uk

books.google.com

  • Bang-Jensen, Jørgen; Gutin, Gregory (2018), "Basic Terminology, Notation and Results", in Bang-Jensen, Jørgen; Gutin, Gregory (eds.), Classes of Directed Graphs, Springer Monographs in Mathematics, Springer International Publishing, pp. 1–34, doi:10.1007/978-3-319-71840-8_1, ISBN 978-3-319-71839-2; see p. 17
  • Knuth, Donald E. (2013), "Two thousand years of combinatorics", in Wilson, Robin; Watkins, John J. (eds.), Combinatorics: Ancient and Modern, Oxford University Press, pp. 7–37, ISBN 978-0191630620.
  • Gries, David; Schneider, Fred B. (1993), A Logical Approach to Discrete Math, Springer-Verlag, p. 436, ISBN 0387941150.

diale.org

doi.org

  • Bang-Jensen, Jørgen; Gutin, Gregory (2018), "Basic Terminology, Notation and Results", in Bang-Jensen, Jørgen; Gutin, Gregory (eds.), Classes of Directed Graphs, Springer Monographs in Mathematics, Springer International Publishing, pp. 1–34, doi:10.1007/978-3-319-71840-8_1, ISBN 978-3-319-71839-2; see p. 17
  • Joos, Felix; Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk (2019-08-05). "Optimal packings of bounded degree trees" (PDF). Journal of the European Mathematical Society. 21 (12): 3573–3647. doi:10.4171/JEMS/909. ISSN 1435-9855. S2CID 119315954. Archived (PDF) from the original on 2020-03-09. Retrieved 2020-03-09.
  • Montgomery, Richard; Pokrovskiy, Alexey; Sudakov, Benny (2021). "A proof of Ringel's Conjecture". Geometric and Functional Analysis. 31 (3): 663–720. arXiv:2001.02665. doi:10.1007/s00039-021-00576-2.
  • Tichy, Robert F.; Wagner, Stephan (2005), "Extremal problems for topological indices in combinatorial chemistry" (PDF), Journal of Computational Biology, 12 (7): 1004–1013, CiteSeerX 10.1.1.379.8693, doi:10.1089/cmb.2005.12.1004, PMID 16201918, archived (PDF) from the original on 2017-09-21, retrieved 2012-03-29.
  • Robertson, Neil; Seymour, P. D.; Thomas, Robin (1993), "Linkless embeddings of graphs in 3-space", Bulletin of the American Mathematical Society, 28 (1): 84–89, arXiv:math/9301216, doi:10.1090/S0273-0979-1993-00335-5, MR 1164063, S2CID 1110662.
  • Conway, J. H.; Cameron Gordon (1983). "Knots and Links in Spatial Graphs". Journal of Graph Theory. 7 (4): 445–453. doi:10.1002/jgt.3190070410.

harvard.edu

ui.adsabs.harvard.edu

maths.org

nrich.maths.org

  • Mystic Rose, nrich.maths.org, retrieved 23 January 2012.

nih.gov

pubmed.ncbi.nlm.nih.gov

psu.edu

citeseerx.ist.psu.edu

quantamagazine.org

semanticscholar.org

api.semanticscholar.org

tugraz.at

math.tugraz.at

ist.tugraz.at

web.archive.org

worldcat.org

search.worldcat.org