Geodesic

Combinatorics and graph theory. Part XI

The structure of directed forests of minimal weight: algebra of subsets of the set of vertices
p. 5-30
On proper edge $3$-colorings of a cubic graph
p. 31-48
On plane drawings of $2$-planar graphs
p. 49-65
Cliques and constructors in ``Hats'' game.~I
p. 66-96
Cliques and constructors in ``Hats'' game.~II
p. 97-118
Enumeration of labelled and unlabelled Hamiltonian cycles in complete $k$-partite graphs
p. 119-142
On vertices of degree $6$ of minimally and contraction critically $6$-connected graph
p. 143-167
On the Erd{\H o}s--Hajnal problem in the case of $3$-graphs
p. 168-176