Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DA_2008_15_1_a1, author = {O. V. Borodin and I. G. Dmitriev and A. O. Ivanova}, title = {{\CYRV}{\cyrery}{\cyrs}{\cyro}{\cyrt}{\cyra} {\cyrc}{\cyri}{\cyrk}{\cyrl}{\cyra} {\cyrd}{\cyrl}{\cyri}{\cyrn}{\cyrery}~4 {\cyrv}~1-{\cyrp}{\cyrl}{\cyra}{\cyrn}{\cyra}{\cyrr}{\cyrn}{\cyrery}{\cyrh} {\cyrg}{\cyrr}{\cyra}{\cyrf}{\cyra}{\cyrh} {\cyrs}~{\cyrm}{\cyri}{\cyrn}{\cyri}{\cyrm}{\cyra}{\cyrl}{\cyrsftsn}{\cyrn}{\cyro}{\cyrishrt} {\cyrs}{\cyrt}{\cyre}{\cyrp}{\cyre}{\cyrn}{\cyrsftsn}{\cyryu}~5 {\cyrb}{\cyre}{\cyrz} {\cyrt}{\cyrr}{\cyre}{\cyru}{\cyrg}{\cyro}{\cyrl}{\cyrsftsn}{\cyrn}{\cyri}{\cyrk}{\cyro}{\cyrv}}, journal = {Diskretnyj analiz i issledovanie operacij}, pages = {11--16}, publisher = {mathdoc}, volume = {15}, number = {1}, year = {2008}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DA_2008_15_1_a1/} }
TY - JOUR AU - O. V. Borodin AU - I. G. Dmitriev AU - A. O. Ivanova TI - Высота цикла длины~4 в~1-планарных графах с~минимальной степенью~5 без треугольников JO - Diskretnyj analiz i issledovanie operacij PY - 2008 SP - 11 EP - 16 VL - 15 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DA_2008_15_1_a1/ LA - ru ID - DA_2008_15_1_a1 ER -
%0 Journal Article %A O. V. Borodin %A I. G. Dmitriev %A A. O. Ivanova %T Высота цикла длины~4 в~1-планарных графах с~минимальной степенью~5 без треугольников %J Diskretnyj analiz i issledovanie operacij %D 2008 %P 11-16 %V 15 %N 1 %I mathdoc %U http://geodesic.mathdoc.fr/item/DA_2008_15_1_a1/ %G ru %F DA_2008_15_1_a1
O. V. Borodin; I. G. Dmitriev; A. O. Ivanova. Высота цикла длины~4 в~1-планарных графах с~минимальной степенью~5 без треугольников. Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 1, pp. 11-16. http://geodesic.mathdoc.fr/item/DA_2008_15_1_a1/
[1] Borodin O. V., “Reshenie zadach Ringelya o vershinno-granevoi raskraske ploskikh grafov i o raskraske 1-planarnykh grafov”, Metody diskretnogo analiza v izuchenii realizatsii logicheskikh funktsii, Sb. nauch. tr. Vyp. 41, In-t matematiki SO AN SSSR, Novosibirsk, 1984, 12–26 | MR
[2] Borodin O. V., “Reshenie zadach Kotsiga i Gryunbauma ob otdelimosti tsikla v ploskikh grafakh”, Matem. zametki, 46:5 (1989), 9–12 | MR
[3] Borodin O. V., “A new proof of 6 color theorem”, J. Graph Theory, 19:4 (1995), 507–521 | DOI | MR | Zbl
[4] Fabrici I., Madaras T., “The structure of 1-planar graphs”, Discrete Math., 307:7–8 (2007), 854–865 | DOI | MR | Zbl
[5] Grünbaum B., “Polytopal graphs”, Studies in Graph Theory, Part II, Studies in Math., 12, Math. Assoc. Amer., Washington, DC, 1975, 201–204 | MR
[6] Kotzig A., “From the theory of Euler polyhedra”, Mat.-Fyz. Casopis, 13:1 (1963), 20–34 | MR
[7] Lebesgue H., “Quelques cosequences simple de la formule d'Euler”, J. Math. Pures Appl., 9 (1940), 27–43 | MR | Zbl
[8] Ringel G., “Ein Sechsfarbenproblem auf der Kugel”, Abh. Math. Sem. Univ. Hamburg, 29 (1965), 107–117 | DOI | MR | Zbl