K-fa (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "K-fa" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

3,645^th place

4,710^th place

low place

low place

1web.archive.org

1^st place

1^st place

69^th place

778^th place

2^nd place

8^th place

arxiv.org

Below, Alexander; De Loera, Jesús A.; Richter-Gebert, Jürgen. "The Complexity of Finding Small Triangulations of Convex 3-Polytopes". arXiv:math/0012177..

cuni.cz

kam.mff.cuni.cz

Nešetřil, Jaroslav & Ossona de Mendez, Patrice (2008), "Structural Properties of Sparse Graphs", Building Bridges: between Mathematics and Computer Science, vol. 19, Bolyai Society Mathematical Studies, Springer-Verlag, p. 390, ISBN 978-3-540-85218-6.

doi.org

dx.doi.org

Kleinschmidt, Peter (1976. december 1.). „Eine graphentheoretische Kennzeichnung der Stapelpolytope”. Archiv der Mathematik 27 (1), 663–667. o. DOI:10.1007/BF01224736.

univ-mrs.fr

cirm.univ-mrs.fr

Distances in random Apollonian network structures Archiválva 2011. július 21-i dátummal a Wayback Machine-ben, talk slides by Olivier Bodini, Alexis Darrasse, and Michèle Soria from a talk at FPSAC 2008, accessed 2011-03-06.

web.archive.org

Distances in random Apollonian network structures Archiválva 2011. július 21-i dátummal a Wayback Machine-ben, talk slides by Olivier Bodini, Alexis Darrasse, and Michèle Soria from a talk at FPSAC 2008, accessed 2011-03-06.