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

• âÕÓÌÏ× ÷. á. ï ËÏÜÆÆÉÃÉÅÎÔÁÈ ÈÁÒÁËÔÅÒÉÓÔÉÞÅÓËÏÇÏ ÍÎÏÇÏÞÌÅÎÁ ÌÁÐÌÁÓÉÁÎÁ ×Ú×ÅÛÅÎÎÏÇÏ ÏÒÉÅÎÔÉÒÏ×ÁÎÎÏÇÏ ÇÒÁÆÁ É ÔÅÏÒÅÍÅ Ï ×ÓÅÈ ÍÉÎÏÒÁÈ ....... 5 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ëÁÒÐÏ× ä. ÷. äÅÒÅ×Ï ÒÁÚÒÅÚÏ× É ÍÉÎÉÍÁÌØÎÙÊ $k$-Ó×ÑÚÎÙÊ ÇÒÁÆ ....... 22 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ëÁÒÐÏ× ä. ÷. íÉÎÉÍÁÌØÎÙÅ $k$-Ó×ÑÚÎÙÅ ÇÒÁÆÙ Ó ÍÉÎÉÍÁÌØÎÙÍ ÞÉÓÌÏÍ ×ÅÒÛÉÎ ÓÔÅÐÅÎÉ $k$ ....... 41 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ëÁÒÐÏ× ä. ÷. õÄÁÌÅÎÉÅ ×ÅÒÛÉÎ ÉÚ Ä×ÕÓ×ÑÚÎÏÇÏ ÇÒÁÆÁ Ó ÓÏÈÒÁÎÅÎÉÅÍ Ä×ÕÓ×ÑÚÎÏÓÔÉ ....... 66 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• îÅÎÁÛÅ× ç. ÷. ï ÐÒÏÂÌÅÍÅ ÔÉÐÁ èÉ×ÕÄÁ ÄÌÑ ËÁÒÔ Ó ËÁÓÁÎÉÑÍÉ ....... 74 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• ðÁÓÔÏÒ á. ÷. ï ÓÔÒÕËÔÕÒÅ $C_3$-ËÒÉÔÉÞÅÓËÉÈ ÍÉÎÉÍÁÌØÎÙÈ $6$-Ó×ÑÚÎÙÈ ÇÒÁÆÏ× ....... 89 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• óÁ×ÅÎËÏ× ë. ó. ðÏÞÔÉ ÒÅÇÕÌÑÒÎÙÅ ÒÁÚÂÉÅÎÉÑ ÇÒÁÆÁ ....... 105 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• óÁÍÏÊÌÏ×Á ï. å. ï ÇÒÁÆÁÈ, ËÏÔÏÒÙÅ ÍÏÖÎÏ ÉÚÏÂÒÁÚÉÔØ ÎÁ ÏÒÉÅÎÔÉÒÕÅÍÙÈ ÐÏ×ÅÒÈÎÏÓÔÑÈ Ó ÍÁÌÙÍ ÞÉÓÌÏÍ ÐÅÒÅÓÅÞÅÎÉÊ ÎÁ ÒÅÂÒÅ ....... 114 áÎÎÏÔÁÃÉÑ ðÏÌÎÙÊ ÔÅËÓÔ(.pdf)
• òÅÆÅÒÁÔÙ ....... 125 (.pdf)

---


Contents 
• Buslov V. A. On characteristic polynomial coefficients of the Laplace matrix of a weighted digraph and all minors theorem ....... 5
• Karpov D. V. The tree of cuts and minimal $k$-connected graphs ....... 22
• Karpov D. V. Minimal $k$-connected graphs with minimal number of vertices of degree $k$ ....... 41
• Karpov D. V. Deleting vertices from a biconnected graph with preserving biconnectinity ....... 66
• Nenashev G. V. On Heawood-type problem for maps with tangencies ....... 74
• Pastor A. V. About vertices of degree 6 of $C_3$-critical minimal 6-connec\-ted graph ....... 89
• Savenkov K. S. Almost regular partition of a graph ....... 105
• Samoilova O. E. On graphs which can be drawn on an orientable surface with small number of intersections on an edge ....... 114
Reviews ....... 125

---

Paging: 127 pp.

• ---

  Back to the Petersburg Department of Steklov Institute of Mathematics