Geodesic

Combinatorics and graph theory. Part VII

On characteristic polynomial coefficients of the Laplace matrix of a~weighted digraph and all minors theorem
p. 5-21
The tree of cuts and minimal $k$-connected graphs
p. 22-40
Minimal $k$-connected graphs with minimal number of vertices of degree~$k$
p. 41-65
Deleting vertices from a~biconnected graph with preserving biconnectinity
p. 66-73
On Heawood-type problem for maps with tangencies
p. 74-88
About vertices of degree~$6$ of $C_3$-critical minimal $6$-connected graph
p. 89-104
Almost regular partition of a~graph
p. 105-113
On graphs which can be drawn on an orientable surface with small number of intersections on an edge
p. 114-124