scientific article; zbMATH DE number 3395950

Cited in

(82)

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 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
Decomposing the complete \(r\)-graph
Dushnik-Miller dimension of contact systems of d-dimensional boxes
Improved bounds for the Graham-Pollak problem for hypergraphs
Decomposition of the complete r-graph into complete r-partite r-graphs
A note on exact distance labeling
Wiener index and addressing of the total graph
Addressing graph products and distance-regular graphs
Multicovering hypergraphs
Eigenvalues and clique partitions of graphs
An overview of graph covering and partitioning
A note on k-wise oddtown problems
Distance spectra of graphs: a survey
On a conjecture of Graham and Lovász about distance matrices
Bounds for the Graham-Pollak theorem for hypergraphs
Ordered biclique partitions and communication complexity problems
On the distance spectrum of distance regular graphs
On 2-colored graphs and partitions of boxes
A polynomial space proof of the Graham-Pollak theorem
Distance spectral radius of trees with fixed number of pendent vertices
A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
Some improved bounds on communication complexity via new decomposition of cliques
On Isometric Embeddings of Graphs
Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
The inertia of distance matrices of some graphs
Clique versus independent set
Supremal \(p\)-negative type of vertex transitive graphs
Some graft transformations and its applications on the distance spectral radius of a graph
Eigenvalues of complete multipartite graphs
Problems and invariants connected with bicliques and multicliques of graphs
Isometric subgraphs of Hamming graphs and d-convexity
Recognizing binary Hamming graphs inO(n 2 logn) time
Isometric universal graphs
Near-optimal distance emulator for planar graphs
The generalized distance spectrum of a graph and applications
A dynamic location problem for graphs
Fault-tolerant distance labeling for planar graphs
Fault-tolerant distance labeling for planar graphs
New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\)
Graph and hypergraph colouring via nibble methods: a survey
A proof of the Erdős-Faber-Lovász conjecture
Odd covers of graphs
Better distance labeling for unweighted planar graphs
Wiener index and addressing of some finite graphs
scientific article; zbMATH DE number 7731161 (Why is no real title available?)
Finding biclique partitions of co-chordal graphs
Exact values and improved bounds on \(k\)-neighborly families of boxes
Complete bipartite decompositions of crowns, with applications to complete directed graphs
Decomposing complete graphs into isomorphic complete multipartite graphs
Distance labeling for families of cycles
On biclique partitions of the complete graph
Odd covers of complete graphs and hypergraphs
Neighborly boxes and bipartite coverings; constructions and conjectures
The -rank of a (0, 1)-matrix
Binary stretch embedding of weighted graphs
Regular bipartite decompositions of pseudorandom graphs
Path odd-covers of graphs
On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs
Isometric embedding in products of complete graphs
Better distance labeling for unweighted planar graphs
On a symmetric representation of Hermitian matrices and its applications to graph theory

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5663904)