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

2016, Volume 450  
| General information | Contents |


Combinatorics and graph theory. Part VIII


On the connection between the chromatic number of a graph and the number of cycles, covering a vertex or an edge
S. L. Berlov, K. I. Tyschuk 		5–13
On characteristical polinomial and eigenvectors in terms of tree-like structure of the graph
V. A. Buslov 		14–36
Bounds on the dynamic chromatic number of a graph in terms of the chromatic number
N. Y. Vlasova, D. V. Karpov 		37–42
An algorithm for solving an overdetermined tropical linear system with the help of analysis of stable solutions of subsystems
A. Davydow 		43–61
Lower bounds on the number of leaves in spanning trees
D. V. Karpov 		62–73
Enumeration of regular maps on surfaces of a given genus
E. C. Krasko, A. V. Omelchenko 		74–108
On a decomposition of a $3$-connected graph into cyclically $4$-edge-connected components
A. V. Pastor 		109–150
An upper bound on the number of edges of a graph which $k$-th power has connected complement
V. S. Samoilov 		151–174
Записки научных семинаров ПОМИ
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024