Girth (graph theory) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Girth (graph theory)" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

2semanticscholar.org

11^th place

8^th place

451^st place

277^th place

513^th place

537^th place

9,054^th place

6,363^rd place

1web.archive.org

1^st place

1^st place

1technion.ac.il

low place

low place

low place

low place

1stackexchange.com

1,983^rd place

1,330^th place

69^th place

59^th place

5^th place

5^th place

ams.org

mathscinet.ams.org

Davidoff, Giuliana; Sarnak, Peter; Valette, Alain (2003), Elementary number theory, group theory, and Ramanujan graphs, London Mathematical Society Student Texts, vol. 55, Cambridge University Press, Cambridge, doi:10.1017/CBO9780511615825, ISBN 0-521-82426-5, MR 1989434
Cho, Jung Jin; Chen, Yong; Ding, Yu (2007), "On the (co)girth of a connected matroid", Discrete Applied Mathematics, 155 (18): 2456–2470, doi:10.1016/j.dam.2007.06.015, MR 2365057.

arxiv.org

Chang, Hsien-Chih; Lu, Hsueh-I. (2013). "Computing the Girth of a Planar Graph in Linear Time". SIAM Journal on Computing. 42 (3): 1077–1094. arXiv:1104.4892. doi:10.1137/110832033. ISSN 0097-5397. S2CID 2493979.

doi.org

Erdős, Paul (1959), "Graph theory and probability", Canadian Journal of Mathematics, 11: 34–38, doi:10.4153/CJM-1959-003-9, S2CID 122784453.
Davidoff, Giuliana; Sarnak, Peter; Valette, Alain (2003), Elementary number theory, group theory, and Ramanujan graphs, London Mathematical Society Student Texts, vol. 55, Cambridge University Press, Cambridge, doi:10.1017/CBO9780511615825, ISBN 0-521-82426-5, MR 1989434
Cho, Jung Jin; Chen, Yong; Ding, Yu (2007), "On the (co)girth of a connected matroid", Discrete Applied Mathematics, 155 (18): 2456–2470, doi:10.1016/j.dam.2007.06.015, MR 2365057.
Chang, Hsien-Chih; Lu, Hsueh-I. (2013). "Computing the Girth of a Planar Graph in Linear Time". SIAM Journal on Computing. 42 (3): 1077–1094. arXiv:1104.4892. doi:10.1137/110832033. ISSN 0097-5397. S2CID 2493979.

semanticscholar.org

api.semanticscholar.org

Erdős, Paul (1959), "Graph theory and probability", Canadian Journal of Mathematics, 11: 34–38, doi:10.4153/CJM-1959-003-9, S2CID 122784453.
Chang, Hsien-Chih; Lu, Hsueh-I. (2013). "Computing the Girth of a Planar Graph in Linear Time". SIAM Journal on Computing. 42 (3): 1077–1094. arXiv:1104.4892. doi:10.1137/110832033. ISSN 0097-5397. S2CID 2493979.

stackexchange.com

cstheory.stackexchange.com

"ds.algorithms - Optimal algorithm for finding the girth of a sparse graph?". Theoretical Computer Science Stack Exchange. Retrieved 2023-02-22.

technion.ac.il

webcourse.cs.technion.ac.il

"Question 3: Computing the girth of a graph" (PDF). Archived from the original (PDF) on August 29, 2017. Retrieved February 22, 2023.

tryalgo.org

Völkel, Christoph Dürr, Louis Abraham and Finn (2016-11-06). "Shortest cycle". TryAlgo. Retrieved 2023-02-22.{{cite web}}: CS1 maint: multiple names: authors list (link)

tue.nl

win.tue.nl

Brouwer, Andries E., Cages. Electronic supplement to the book Distance-Regular Graphs (Brouwer, Cohen, and Neumaier 1989, Springer-Verlag).

web.archive.org

"Question 3: Computing the girth of a graph" (PDF). Archived from the original (PDF) on August 29, 2017. Retrieved February 22, 2023.

wolfram.com

mathworld.wolfram.com

Weisstein, Eric W., "Girth", MathWorld

worldcat.org

search.worldcat.org

Chang, Hsien-Chih; Lu, Hsueh-I. (2013). "Computing the Girth of a Planar Graph in Linear Time". SIAM Journal on Computing. 42 (3): 1077–1094. arXiv:1104.4892. doi:10.1137/110832033. ISSN 0097-5397. S2CID 2493979.