Geodesic

Combinatorics and graph theory. Part III

Sommaire

Bounds of a number of leaves of spanning trees in graphs without triangles
p. 5-17
Bounds of a number of leaves of spanning trees
p. 18-34
On graphs with a large chromatic number containing no small odd cycles
p. 35-44
Generalized flowers in $k$-connected graph
p. 45-78
On proper colorings of hypergraphs
p. 79-89
The structure of decomposition of a triconnected graph
p. 90-148
An upper bound on the chromatic number of circle graphs without $K_4$
p. 149-156
Local structure of 9 and 10-connected graphs
p. 157-197
About vertices of degree $k$ of minimally and contraction critically $k$-connected graphs: upper bounds
p. 198-210