Geodesic

Combinatorics and graph theory. Part VIII

Sommaire

On the connection between the chromatic number of a~graph and the number of cycles, covering a~vertex or an edge
p. 5-13
On characteristical polinomial and eigenvectors in terms of tree-like structure of the graph
p. 14-36
Bounds on the dynamic chromatic number of a~graph in terms of the chromatic number
p. 37-42
An algorithm for solving an overdetermined tropical linear system with the help of analysis of stable solutions of subsystems
p. 43-61
Lower bounds on the number of leaves in spanning trees
p. 62-73
Enumeration of regular maps on surfaces of a~given genus
p. 74-108
On a~decomposition of a~$3$-connected graph into cyclically $4$-edge-connected components
p. 109-150
An upper bound on the number of edges of a~graph which $k$-th power has connected complement
p. 151-174