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

• âÅÒÌÏ× ó. ì. òÁ×ÎÏÍÅÒÎÙÅ ÒÁÓËÒÁÓËÉ ÇÒÁÆÏ×.......5 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ëÁÒÐÏ× ä. ÷. ÷ÅÒÈÎÑÑ ÏÃÅÎËÁ ËÏÌÉÞÅÓÔ×Á Ò£ÂÅÒ × Ä×ÕÄÏÌØÎÏÍ ÐÏÞÔÉ ÐÌÁÎÁÒÎÏÍ ÇÒÁÆÅ.......12 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ëÁÒÐÏ× ä. ÷. ïÓÔÏ×ÎÙÅ ÄÅÒÅ×ØÑ Ó ÂÏÌØÛÉÍ ËÏÌÉÞÅÓÔ×ÏÍ ×ÉÓÑÞÉÈ ×ÅÒÛÉÎ: ÎÏ×ÙÅ ÎÉÖÎÉÅ ÏÃÅÎËÉ ÞÅÒÅÚ ËÏÌÉÞÅÓÔ×Ï ×ÅÒÛÉÎ ÓÔÅÐÅÎÅÊ 3 É ÎÅ ÍÅÎÅÅ 4.......31 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ëÁÒÐÏ× ä. ÷. ïÓÔÏ×ÎÙÅ ÄÅÒÅ×ØÑ Ó ÂÏÌØÛÉÍ ËÏÌÉÞÅÓÔ×ÏÍ ×ÉÓÑÞÉÈ ×ÅÒÛÉÎ: ÎÉÖÎÉÅ ÏÃÅÎËÉ ÞÅÒÅÚ ËÏÌÉÞÅÓÔ×Ï ×ÅÒÛÉÎ ÓÔÅÐÅÎÅÊ 1, 3 É ÎÅ ÍÅÎÅÅ 4.......67 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• îÅÎÁÛÅ× ç. ÷. ïÃÅÎËÁ ÈÒÏÍÁÔÉÞÅÓËÏÇÏ ÞÉÓÌÁ ÐÏÞÔÉ ÐÌÁÎÁÒÎÏÇÏ ÇÒÁÆÁ.......95 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• îÅÎÁÛÅ× ç. ÷. óÕÝÅÓÔ×Ï×ÁÎÉÅ ÎÅËÒÉÔÉÞÅÓËÉÈ ×ÅÒÛÉÎ × ÏÒÉÅÎÔÉÒÏ×ÁÎÎÙÈ ÇÒÁÆÁÈ.......107 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ðÁÓÔÏÒ á. ÷., òÏÄÉÏÎÏ×Á ï. ð. îÅËÏÔÏÒÙÅ ÆÏÒÍÕÌÙ ÄÌÑ ÞÉÓÌÁ ÓËÌÅÅË.......117 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• òÅÆÅÒÁÔÙ ....... 157 (.pdf)

---


Contents 
• Berlov S. L. Uniform colorings of graphs.......5
• Karpov D. V. Upper bound on the number of edges of an almost planar bipartite graph.......12
• Karpov D. V. Spanning trees with many leaves: new lower bounds in terms of number of vertices of degree 3 and at least~4.......31
• Karpov D. V. Spanning trees with many leaves: lower bounds in terms of number of vertices of degree 1, 3 and at least~4.......67
• Nenashev G. V. On a bound on the chromatic number of almost planar graph.......95
• Nenashev G. V. On existence of noncritical vertices in digraphs.......107
• Pastor A. V., Rodionova O. P. Some formulas for the number of gluings.......117
• Reviews ....... 159

---

Paging: 159 pp.

• ---

  Back to the Petersburg Department of Steklov Institute of Mathematics