RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

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
On characteristical polinomial and eigenvectors in terms of tree-like structure of the graph
V. A. Buslov
14
Bounds on the dynamic chromatic number of a graph in terms of the chromatic number
N. Y. Vlasova, D. V. Karpov
37
An algorithm for solving an overdetermined tropical linear system with the help of analysis of stable solutions of subsystems
A. Davydow
43
Lower bounds on the number of leaves in spanning trees
D. V. Karpov
62
Enumeration of regular maps on surfaces of a given genus
E. C. Krasko, A. V. Omelchenko
74
On a decomposition of a $3$-connected graph into cyclically $4$-edge-connected components
A. V. Pastor
109
An upper bound on the number of edges of a graph which $k$-th power has connected complement
V. S. Samoilov
151


© Steklov Math. Inst. of RAS, 2025