Kuratowski's theorem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Kuratowski's theorem" in English language version.

refsWebsite

Global rank English rank

2^nd place

3^rd place

451^st place

277^th place

11^th place

8^th place

2,656^th place

5,310^th place

ams.org

Tutte, W. T. (1963), "How to draw a graph", Proceedings of the London Mathematical Society, Third Series, 13: 743–767, doi:10.1112/plms/s3-13.1.743, MR 0158387.
Thomassen, Carsten (1981), "Kuratowski's theorem", Journal of Graph Theory, 5 (3): 225–241, doi:10.1002/jgt.3190050304, MR 0625064.

Tutte, W. T. (1963), "How to draw a graph", Proceedings of the London Mathematical Society, Third Series, 13: 743–767, doi:10.1112/plms/s3-13.1.743, MR 0158387.
Williamson, S. G. (September 1984), "Depth-first search and Kuratowski subgraphs", J. ACM, 31 (4): 681–693, doi:10.1145/1634.322451, S2CID 8348222.
Chimani, Markus; Mutzel, Petra; Schmidt, Jens M. (2007), "Efficient extraction of multiple Kuratowski subdivisions", in Hong, Seok-Hee; Nishizeki, Takao; Quan, Wu (eds.), Graph Drawing: 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers, Lecture Notes in Computer Science, vol. 4875, Springer, pp. 159–170, doi:10.1007/978-3-540-77537-9_17, ISBN 978-3-540-77536-2
Kuratowski, Kazimierz (1930), "Sur le problème des courbes gauches en topologie" (PDF), Fund. Math. (in French), 15: 271–283, doi:10.4064/fm-15-1-271-283.
Thomassen, Carsten (1981), "Kuratowski's theorem", Journal of Graph Theory, 5 (3): 225–241, doi:10.1002/jgt.3190050304, MR 0625064.
Burstein, Michael (1978), "Kuratowski-Pontrjagin theorem on planar graphs", Journal of Combinatorial Theory, Series B, 24 (2): 228–232, doi:10.1016/0095-8956(78)90024-2
Kennedy, John W.; Quintas, Louis V.; Sysło, Maciej M. (1985), "The theorem on planar graphs", Historia Mathematica, 12 (4): 356–368, doi:10.1016/0315-0860(85)90045-X

Williamson, S. G. (September 1984), "Depth-first search and Kuratowski subgraphs", J. ACM, 31 (4): 681–693, doi:10.1145/1634.322451, S2CID 8348222.