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

• âÕÓÌÏ× ÷. á. áÌÇÏÒÉÔÍ ÐÏÓÌÅÄÏ×ÁÔÅÌØÎÏÇÏ ÐÏÓÔÒÏÅÎÉÑ ÏÓÔÏ×ÎÙÈ ÍÉÎÉÍÁÌØÎÙÈ ÏÒÉÅÎÔÉÒÏ×ÁÎÎÙÈ ÌÅÓÏ× ....... 5 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• é×ÁÎÏ× í. ð. ôÏÞÎÁÑ ÏÃÅÎËÁ ÎÁ ËÏÌÉÞÅÓÔ×Ï ÐÒÁ×ÉÌØÎÙÈ 3-ÒÁÓËÒÁÓÏË Ò£ÂÅÒ Ó×ÑÚÎÏÇÏ ËÕÂÉÞÅÓËÏÇÏ ÇÒÁÆÁ ....... 26 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ëÁÒÏÌØ î. á. ëÒÉÔÅÒÉÊ ÎÁÌÉÞÉÑ ÔÁËÏÇÏ ÃÉËÌÁ, ÞÔÏ ÍÎÏÖÅÓÔ×Ï ÎÅ ×ÈÏÄÑÝÉÈ × ÎÅÇÏ ×ÅÒÛÉÎ ÎÅÚÁ×ÉÓÉÍÏ ....... 53 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ëÁÒÐÏ× ä. ÷. ï ÒÅËÏÎÓÔÒÕËÃÉÉ ÇÒÁÆÏ× Ó×ÑÚÎÏÓÔÉ 2 ....... 80 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ëÏ×ÁÌØ ÷. ï. ï ÒÁÚÂÉÅÎÉÉ ÐÌÏÓËÉÈ ÍÎÏÖÅÓÔ× ÎÁ 6 ÞÁÓÔÅÊ ÍÁÌÏÇÏ ÄÉÁÍÅÔÒÁ ....... 100 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ïÒÅ×ËÏ× ÷. ð. ÷ÅÒÈÎÉÅ É ÎÉÖÎÉÅ ÏÃÅÎËÉ ×ÙÓÏÔ ÓÅË×ÅÎÃÉÁÌØÎÙÈ ÄÏËÁÚÁÔÅÌØÓÔ× × ÉÎÔÕÉÃÉÏÎÉÓÔÓËÏÍ ÉÓÞÉÓÌÅÎÉÉ ....... 124 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• òÅÆÅÒÁÔÙ ....... 170 (.pdf)

---


Contents 
• Buslov V. A. Algorithm for sequential construction of spanning minimal directed forests ....... 5
• Ivanov M. P. An exact bound on the number of proper 3-edge-colorings of a connected cubic graph ....... 26
• Karol' N. A. Criterion for the existence of such a cycle that vertices beyond this cycle are independent ....... 53
• Karpov D. V. On semi-reconstruction of graphs of connectivity 2 ....... 80
• Koval' V. O. Partitioning of plane sets into 6 subsets of small diameter ....... 100
• Orevkov V. P. Upper and lower bounds on the height of proofs in sequent calculus for intuitionistic logic ....... 124
Reviews ....... 170

---

Paging: 171 pp.

• ---

  Back to the Petersburg Department of Steklov Institute of Mathematics