Geodesic

Combinatorics and graph theory. Part XII

Algorithm for sequential construction of spanning minimal directed forests
p. 5-25
An exact bound on the number of proper $3$-edge-colorings of a connected cubic graph
p. 26-52
Criterion for the existence of such a cycle that vertices beyond this cycle are independent
p. 53-79
On semi-reconstruction of graphs of connectivity $2$
p. 80-99
Partitioning of plane sets into $6$ subsets of small diameter
p. 100-123
Upper and lower bounds on the height of proofs in sequent calculus for intuitionistic logic
p. 124-169