Geodesic

Combinatorics and graph theory. Part V

Sommaire

Uniform colorings of graphs
p. 5-11
Upper bound on the number of edges of an almost planar bipartite graph
p. 12-30
Spanning trees with many leaves: new lower bounds in terms of number of vertices of degree 3 and at least 4
p. 31-66
Spanning trees with many leaves: lower bounds in terms of number of vertices of degree 1, 3 and at least 4
p. 67-94
On a bound on the chromatic number of almost planar graph
p. 95-106
On existence of noncritical vertices in digraphs
p. 107-116
Some formulas for the number of gluings
p. 117-156