Publication:5663904
From MaRDI portal
zbMath0251.05123MaRDI QIDQ5663904
H. O. Pollak, Ronald L. Graham
Publication date: 1972
Related Items
Isometric subgraphs of Hamming graphs and d-convexity, Recognizing binary Hamming graphs inO(n 2 logn) time, A dynamic location problem for graphs, On biclique partitions of the complete graph, Isometric embedding in products of complete graphs, Proof of the squashed cube conjecture, On the addressing problem for directed graphs, Decomposition of product graphs into complete bipartite subgraphs, Metric transforms of finite spaces and connected graphs, Clique partitions of the cocktail party graph, Collapse of the metric hierarchy for bipartite graphs, A survey of the theory of hypercube graphs, On a product dimension of graphs, Representations of graphs and networks (coding, layouts and embeddings), On tournament matrices, Multicolored forests in bipartite decompositions of graphs, Minimal cut cover of a graph with an application to the testing of electronic boards, Embedding finite posets in cubes, Distance matrix polynomials of trees, A generalization of Fisher's inequality, Factoring distance matrix polynomials, Non-deterministic communication complexity with few witnesses, Subsets of a finite set that almost always intersect each other in \(\lambda\) elements, Proof of a conjecture of Frankl and Füredi, Fast recognition algorithms for classes of partial cubes, Distance labeling scheme and split decomposition, Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs, Decomposition of the complete r-graph into complete r-partite r-graphs, On a conjecture of Graham and Lovász about distance matrices, A polynomial space proof of the Graham-Pollak theorem, A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph, On Isometric Embeddings of Graphs, Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
