A note on large graphs of diameter two and given maximum degree. The degree sequence of a random graph. I. The models. The asymptotic number of labeled graphs with n vertices, q edges, and no isolated vertices. Subgraph counting identities and Ramsey numbers.
Small graphs are reconstructible.
Vertex-transitive graphs that are not Cayley graphs. NC algorithms for dynamically solving the all pairs shortest paths problem and related problems. Asymptotic enumeration of tournaments with a given score sequence. Vertex-transitive graphs which are not Cayley graphs. Multicolored trees in random graphs.