scientific article; zbMATH DE number 3395950
From MaRDI portal
Publication:5663904
zbMath0251.05123MaRDI QIDQ5663904
H. O. Pollak, Ronald L. Graham
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Clique partitions of the cocktail party graph, The generalized distance spectrum of a graph and applications, Non-deterministic communication complexity with few witnesses, Better distance labeling for unweighted planar graphs, Collapse of the metric hierarchy for bipartite graphs, An overview of graph covering and partitioning, A note on \(k\)-wise oddtown problems, Some improved bounds on communication complexity via new decomposition of cliques, Subsets of a finite set that almost always intersect each other in \(\lambda\) elements, A survey of the theory of hypercube graphs, Unnamed Item, Proof of a conjecture of Frankl and Füredi, Decomposing the complete \(r\)-graph, The inertia of distance matrices of some graphs, Recognizing binary Hamming graphs inO(n 2 logn) time, New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\), Clique versus independent set, Graph and hypergraph colouring via nibble methods: a survey, Dushnik-Miller dimension of contact systems of \(d\)-dimensional boxes, On 2-colored graphs and partitions of boxes, A proof of the Erdős-Faber-Lovász conjecture, Odd covers of graphs, On a product dimension of graphs, Improved bounds for the Graham-Pollak problem for hypergraphs, On a symmetric representation of Hermitian matrices and its applications to graph theory, Wiener index and addressing of some finite graphs, Supremal \(p\)-negative type of vertex transitive graphs, A polynomial space proof of the Graham-Pollak theorem, Finding biclique partitions of co-chordal graphs, A note on exact distance labeling, Exact values and improved bounds on \(k\)-neighborly families of boxes, Some graft transformations and its applications on the distance spectral radius of a graph, Fast recognition algorithms for classes of partial cubes, Unnamed Item, Distance spectral radius of trees with fixed number of pendent vertices, Eigenvalues of complete multipartite graphs, Distance labeling scheme and split decomposition, Unnamed Item, Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs, Representations of graphs and networks (coding, layouts and embeddings), On Isometric Embeddings of Graphs, Better distance labeling for unweighted planar graphs, On tournament matrices, Multicolored forests in bipartite decompositions of graphs, Wiener index and addressing of the total graph, Minimal cut cover of a graph with an application to the testing of electronic boards, On biclique partitions of the complete graph, Distance spectra of graphs: a survey, Addressing graph products and distance-regular graphs, Embedding finite posets in cubes, Multicovering hypergraphs, A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph, On a conjecture of Graham and Lovász about distance matrices, A dynamic location problem for graphs, Distance matrix polynomials of trees, On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs, Eigenvalues and clique partitions of graphs, Fault-tolerant distance labeling for planar graphs, Isometric subgraphs of Hamming graphs and d-convexity, Decomposition of the complete r-graph into complete r-partite r-graphs, A generalization of Fisher's inequality, Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs, Isometric Universal Graphs, Bounds for the Graham-Pollak theorem for hypergraphs, Isometric embedding in products of complete graphs, Proof of the squashed cube conjecture, Ordered biclique partitions and communication complexity problems, Fault-tolerant distance labeling for planar graphs, Factoring distance matrix polynomials, On the distance spectrum of distance regular graphs, On the addressing problem for directed graphs, Decomposition of product graphs into complete bipartite subgraphs, Metric transforms of finite spaces and connected graphs
