Geodesic

Combinatorics and graph theory. Part II

Chromatic numbers of layered graphs with bounded maximal clique
p. 5-30
Construction of a spanning tree with many leaves
p. 31-46
Dynamic proper vertex colorings of the graph
p. 47-77
Spanning trees with many leaves
p. 78-87
Local structure of 5 and 6-connected graphs
p. 88-96
Local structure of 7 and 8-connected graphs
p. 97-111