K-szorosan élösszefüggő gráf (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "K-szorosan élösszefüggő gráf" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

2^nd place

8^th place

1uni-goettingen.de

2,594^th place

4,360^th place

6^th place

14^th place

26^th place

330^th place

488^th place

854^th place

archive.org

Robbins, H. E. (1939). „A theorem on graphs, with an application to a problem on traffic control”. American Mathematical Monthly 46, 281–283. o. DOI:10.2307/2303897. JSTOR 2303897.

columbia.edu

(1996) „A new approach to the minimum cut problem”. Journal of the ACM 43 (4), 601. o. DOI:10.1145/234533.234534.

doi.org

dx.doi.org

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.
Robbins, H. E. (1939). „A theorem on graphs, with an application to a problem on traffic control”. American Mathematical Monthly 46, 281–283. o. DOI:10.2307/2303897. JSTOR 2303897.
(1996) „A new approach to the minimum cut problem”. Journal of the ACM 43 (4), 601. o. DOI:10.1145/234533.234534.

jstor.org

Robbins, H. E. (1939). „A theorem on graphs, with an application to a problem on traffic control”. American Mathematical Monthly 46, 281–283. o. DOI:10.2307/2303897. JSTOR 2303897.

uni-goettingen.de

resolver.sub.uni-goettingen.de

Jordan, Camille (1869). „Sur les assemblages de lignes” (french nyelven). Journal für die reine und angewandte Mathematik 70 (2), 185–190. o.