On the number of C 5 's in a triangle-free graph. On Winkler's four-thirds conjecture on mean distance of graphs. Average distance in graphs with removed elements. Decompositions of graphs into complete subgraphs of given order. Any four independent edges of a 4-connected graph are contained in a circuit.
Every graph is contained in a sparsest possible balanced graph.
On the edge numbers of graphs with Hadwiger number 4 and 5. Partition conditions and vertex-connectivity of graphs.