Voir la notice de l'article provenant de la source Math-Net.Ru
@article{MP_2008_a2,
author = {A. B. Skopenkov},
title = {{\CYRR}{\cyra}{\cyrz}{\cyrm}{\cyrery}{\cyrsh}{\cyrl}{\cyre}{\cyrn}{\cyri}{\cyrya} {\cyro}{\cyrb} {\cyri}{\cyrs}{\cyrs}{\cyrl}{\cyre}{\cyrd}{\cyro}{\cyrv}{\cyra}{\cyrt}{\cyre}{\cyrl}{\cyrsftsn}{\cyrs}{\cyrk}{\cyri}{\cyrh} {\cyrz}{\cyra}{\cyrd}{\cyra}{\cyrch}{\cyra}{\cyrh} {\cyrd}{\cyrl}{\cyrya} {\cyrsh}{\cyrk}{\cyro}{\cyrl}{\cyrsftsn}{\cyrn}{\cyri}{\cyrk}{\cyro}{\cyrv}},
journal = {Matematicheskoe Prosveshchenie},
pages = {23--32},
publisher = {mathdoc},
year = {2008},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MP_2008_a2/}
}
A. B. Skopenkov. Размышления об исследовательских задачах для школьников. Matematicheskoe Prosveshchenie, Matematicheskoe Prosveshchenie (2008), pp. 23-32. http://geodesic.mathdoc.fr/item/MP_2008_a2/
[1] V. I. Arnold, “O predstavlenii funktsii neskolkikh peremennykh v vide superpozitsii funktsii menshego chisla peremennykh”, Mat. Prosveschenie, ser. 2, 1958, no. 3, 41–61 | Zbl
[2] A. Cavicchioli, D. Repovš, A. B. Skopenkov, “Open problems on graphs, arising from geometric topology”, Topol. Appl., 84 (1998), 207–226 | DOI | MR | Zbl
[3] M. Gortinskii, O. Skryabin, “Kriterii vlozhimosti grafov v ploskost vdol pryamoi” (to appear) | Zbl
[4] P. R. Halmos, “How to talk Mathematics”, Notices Amer. Math. Soc., 21 (1974), 155–158
[5] P. R. Halmos, “How to write Mathematics”, L'Enseignement Math., 16 (1970), 123–152 ; P. R. Khalmosh, “Kak pisat matematicheskie teksty”, UMN, 26:5 (1971), 243–269 | MR | Zbl | MR | Zbl
[6] R. Kurant, G. Robbins, Chto takoe matematika?, MTsNMO, M., 2001
[7] A. Kaibkhanov, A. Skopenkov, “Primery transtsendentnykh chisel”, Mat. Prosveschenie, ser. 3, no. 10, 2006, 176–184
[8] V. Kurlin, A. Skopenkov, “Bazisnye vlozheniya grafov v ploskost”, Mat. Obrazovanie, 1997, no. 3, 105–113
[9] P. Kozhevnikov, A. Skopenkov, “Uzkie derevya na ploskosti”, Mat. Obrazovanie, 1999, no. 3, 126–131
[10] V. A. Kurlin, “Basic embeddings into products of graphs”, Topol. Appl., 102 (2000), 113–137 | DOI | MR | Zbl
[11] Yu. Makarychev, “A short proof of Kuratowski's graph planarity criterion”, J. of Graph Theory, 25 (1997), 129–131 | 3.0.CO;2-O class='badge bg-secondary rounded-pill ref-badge extid-badge'>DOI | MR | Zbl
[12] N. Odnobokov, “Klassifikatsiya vlozheniya grafov v ploskost s neperesekayuschimisya obrazami” (to appear)
[13] G. Polya, How to Solve it, Princeton University Press, Princeton, 1945 ; Poia D., Kak reshat zadachu, Uchpedgiz, M., 1961 | MR | Zbl
[14] G. Pogudin, P. Verevkin, On the embeddability of cubic $R$-graphs into the torus, Preprint, 2006
[15] M. Skopenkov, “On approximability by embeddings of cycles in the plane”, Topology and its Applications, 134 (2003), 1–22 | DOI | MR | Zbl
[16] A. Skopenkov, “Vokrug kriteriya Kuratovskogo planarnosti grafov”, Mat. Prosveschenie, ser. 3, no. 9, 2005, 116–128 ; No 10, 2006, 276–277 | Zbl
[17] A. Skopenkov, Algebraicheskaya topologiya s elementarnoi tochki zreniya, MTsNMO, M. (to appear)
[18] A. Skopenkov, 13-ya problema Gilberta i bazisnye vlozheniya, http://dfgm.math.msu.su/files/skopenkov/hilbert.pdf
[19] A. Skopenkov, A. Talambutsa, “Upakovki pravilnykh mnogogrannikov”, Mat. Obrazovanie, 2000, no. 3(14), 52–53
[20] A. Skopenkov, A. Talambutsa, “Ekstremalnye raspolozheniya pravilnykh mnogogrannikov”, Mat. Prosveschenie, ser. 3, no. 8, 2004, 53–65
[21] A. Skopenkov i A. Telishev, “I vnov o kriterii Kuratovskogo planarnosti grafov”, Mat. Prosveschenie, ser. 3, no. 11, 2007, 159–160
[22] A. Telishev, On realizability of graphs on the Klein bottle, Preprint, 2007 | MR
[23] Thomassen C., “Kuratowski's theorem”, J. Graph. Theory, 5:3 (1981), 225–241 | DOI | MR | Zbl