Geodesic

Combinatorics and graph theory. Part X

The structure of minimum-weight directed forests: related forests and convexity inequalities
p. 5-21
On contractible 5-vertex subgraphs of a 3-connected graph
p. 22-40
On the structure of a 3-connected graph.~ 2
p. 41-92
On spanning trees without vertices of degree 2 in plane triangulations
p. 93-98
On some enumerative problems of lambda calculus
p. 99-121
On the complexity of unique Circuit SAT
p. 122-136
On critically 3-connected graphs with exactly two vertices of degree~3. Part~2
p. 137-173
On the chromatic numbers corresponding to exponentially Ramsey sets
p. 174-189