Journal of Graph Theory · 1982 · 113 citations · 1 references
N VerticesGraph TheoryAlgebraic Graph TheoryStructural Graph TheoryTopological Graph TheoryComplete GraphExtremal Graph TheoryShort ProofComplete Bipartite Graphs
Abstract A short proof is given of the impossibility of decomposing the complete graph on n vertices into n ‐2 or fewer complete bipartite graphs.
1
Distance matrix polynomials of trees
R. L. Graham, László Lovász · Advances in Mathematics · 1978 · 201 citations