Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

2014, Volume 427  
| General information | Contents |


Combinatorics and graph theory. Part VII


On characteristic polynomial coefficients of the Laplace matrix of a weighted digraph and all minors theorem
V. A. Buslov 		5–21
The tree of cuts and minimal $k$-connected graphs
D. V. Karpov 		22–40
Minimal $k$-connected graphs with minimal number of vertices of degree $k$
D. V. Karpov 		41–65
Deleting vertices from a biconnected graph with preserving biconnectinity
D. V. Karpov 		66–73
On Heawood-type problem for maps with tangencies
G. V. Nenashev 		74–88
About vertices of degree $6$ of $C_3$-critical minimal $6$-connected graph
A. V. Pastor 		89–104
Almost regular partition of a graph
K. S. Savenkov 		105–113
On graphs which can be drawn on an orientable surface with small number of intersections on an edge
O. E. Samoilova 		114–124
Записки научных семинаров ПОМИ
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025