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

2018, Volume 475  
| General information | Contents |


Combinatorics and graph theory. Part X


The structure of minimum-weight directed forests: related forests and convexity inequalities
V. A. Buslov 		5–21
On contractible 5-vertex subgraphs of a 3-connected graph
N. Yu. Vlasova 		22–40
On the structure of a 3-connected graph. 2
D. V. Karpov 		41–92
On spanning trees without vertices of degree 2 in plane triangulations
D. V. Karpov 		93–98
On some enumerative problems of lambda calculus
E. C. Krasko, I. N. Labutin, D. N. Moskvin, A. V. Omelchenko, A. I. Khrabrov 		99–121
On the complexity of unique Circuit SAT
A. A. Lialina 		122–136
On critically 3-connected graphs with exactly two vertices of degree 3. Part 2
A. V. Pastor 		137–173
On the chromatic numbers corresponding to exponentially Ramsey sets
A. A. Sagdeev 		174–189
Записки научных семинаров ПОМИ
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026