"úÁÐÉÓËÉ ÎÁÕÞÎÙÈ ÓÅÍÉÎÁÒÏ× ðïíé"

• âÅÒÌÏ× ó. ì., ôÙÝÕË ë. é. ï Ó×ÑÚÉ ÍÅÖÄÕ ÈÒÏÍÁÔÉÞÅÓËÉÍ ÞÉÓÌÏÍ ÇÒÁÆÁ É ËÏÌÉÞÅÓÔ×ÏÍ ÃÉËÌÏ×, ÐÏËÒÙ×ÁÀÝÉÈ ÄÁÎÎÏÅ ÒÅÂÒÏ ÉÌÉ ×ÅÒÛÉÎÕ ....... 5 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• âÕÓÌÏ× ÷. á. ï ÈÁÒÁËÔÅÒÉÓÔÉÞÅÓËÏÍ ÍÎÏÇÏÞÌÅÎÅ É ÓÏÂÓÔ×ÅÎÎÙÈ ×ÅËÔÏÒÁÈ × ÔÅÒÍÉÎÁÈ ÄÒÅ×Ï×ÉÄÎÏÊ ÓÔÒÕËÔÕÒÙ ÏÒÇÒÁÆÁ ....... 14 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ÷ÌÁÓÏ×Á î. à., ëÁÒÐÏ× ä. ÷. ïÃÅÎËÁ ÄÉÎÁÍÉÞÅÓËÏÇÏ ÈÒÏÍÁÔÉÞÅÓËÏÇÏ ÞÉÓÌÁ ÇÒÁÆÁ ÞÅÒÅÚ ÅÇÏ ÈÒÏÍÁÔÉÞÅÓËÏÅ ÞÉÓÌÏ ....... 37 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• äÁ×ÙÄÏ× á. áÌÇÏÒÉÔÍ ÐÏÉÓËÁ ÒÅÛÅÎÉÑ ÐÅÒÅÏÐÒÅÄÅÌÅÎÎÏÊ ÔÒÏÐÉÞÅÓËÏÊ ÌÉÎÅÊÎÏÊ ÓÉÓÔÅÍÙ Ó ÐÏÍÏÝØÀ ÁÎÁÌÉÚÁ ÓÔÁÂÉÌØÎÙÈ ÔÏÞÅË ÐÏÄÓÉÓÔÅÍ ....... 43 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ëÁÒÐÏ× ä. ÷. îÉÖÎÉÅ ÏÃÅÎËÉ ËÏÌÉÞÅÓÔ×Á ÌÉÓÔØÅ× × ÏÓÔÏ×ÎÙÈ ÄÅÒÅ×ØÑÈ ....... 62 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ëÒÁÓËÏ å. ó., ïÍÅÌØÞÅÎËÏ á. ÷. ðÅÒÅÞÉÓÌÅÎÉÅ ÒÅÇÕÌÑÒÎÙÈ ËÁÒÔ ÎÁ ÐÏ×ÅÒÈÎÏÓÔÑÈ ÚÁÄÁÎÎÏÇÏ ÒÏÄÁ ....... 74 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ðÁÓÔÏÒ á. ÷. ï ÒÁÚÂÉÅÎÉÉ ÔÒÅÈÓ×ÑÚÎÏÇÏ ÇÒÁÆÁ ÎÁ ÃÉËÌÉÞÅÓËÉ ÒÅÂÅÒÎÏ-ÞÅÔÙÒÅÈÓ×ÑÚÎÙÅ ËÏÍÐÏÎÅÎÔÙ ....... 109 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• óÁÍÏÊÌÏ× ÷. ó. ÷ÅÒÈÎÑÑ ÏÃÅÎËÁ ËÏÌÉÞÅÓÔ×Á Ò£ÂÅÒ × ÇÒÁÆÅ, ÄÏÐÏÌÎÅÎÉÅ $k$-ÏÊ ÓÔÅÐÅÎÉ ËÏÔÏÒÏÇÏ Ó×ÑÚÎÏ ....... 151 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• òÅÆÅÒÁÔÙ ....... 175 (.pdf)

---


Contents 
• Berlov S. L., Tyschuk K. I. On the connection between the chromatic number of a graph and the number of cycles, covering a vertex or an edge ....... 5
• Buslov V. A. On characteristical polinomial and eigenvectors in terms of tree-like structure of the graph ....... 14
• Vlasova N. Y., Karpov D. V. Bounds on the dynamic chromatic number of a graph in terms of the chromatic number ....... 37
• Davydow A. An algorithm for solving an overdetermined tropical linear system with the help of analysis of stable solutions of subsystems ....... 43
• Karpov D. V. Lower bounds on the number of leaves in spanning trees ....... 62
• Krasko E. S., Omelchenko A. V. Enumeration of regular maps on surfaces of a given genus ....... 74
• Pastor A. V. On a decomposition of a $3$-connected graph into cyclically $4$-edge-connected components ....... 109
• Samoilov V. S. An upper bound on the number of edges of a graph which $k$ power has connected complement ....... 151
Reviews ....... 175

---

Paging: 178 pp.

• ---

  Back to the Petersburg Department of Steklov Institute of Mathematics