The following pages link to (Q5663904):
Displayed 33 items.
- A dynamic location problem for graphs (Q583245) (← links)
- On biclique partitions of the complete graph (Q686164) (← links)
- Isometric embedding in products of complete graphs (Q787171) (← links)
- Proof of the squashed cube conjecture (Q1055790) (← links)
- On the addressing problem for directed graphs (Q1068101) (← links)
- Decomposition of product graphs into complete bipartite subgraphs (Q1073047) (← links)
- Metric transforms of finite spaces and connected graphs (Q1075344) (← links)
- Clique partitions of the cocktail party graph (Q1076691) (← links)
- Collapse of the metric hierarchy for bipartite graphs (Q1089359) (← links)
- A survey of the theory of hypercube graphs (Q1102985) (← links)
- On a product dimension of graphs (Q1142231) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- On tournament matrices (Q1183197) (← links)
- Multicolored forests in bipartite decompositions of graphs (Q1186126) (← links)
- Minimal cut cover of a graph with an application to the testing of electronic boards (Q1195870) (← links)
- Embedding finite posets in cubes (Q1219897) (← links)
- Distance matrix polynomials of trees (Q1247981) (← links)
- A generalization of Fisher's inequality (Q1279662) (← links)
- Factoring distance matrix polynomials (Q1313852) (← links)
- Non-deterministic communication complexity with few witnesses (Q1337464) (← links)
- Subsets of a finite set that almost always intersect each other in \(\lambda\) elements (Q1356776) (← links)
- Proof of a conjecture of Frankl and Füredi (Q1369678) (← links)
- Fast recognition algorithms for classes of partial cubes (Q1408812) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs (Q1430968) (← links)
- Decomposition of the complete r-graph into complete r-partite r-graphs (Q1821120) (← links)
- On a conjecture of Graham and Lovász about distance matrices (Q2276978) (← links)
- A polynomial space proof of the Graham-Pollak theorem (Q2427560) (← links)
- A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph (Q2502039) (← links)
- On Isometric Embeddings of Graphs (Q3697031) (← links)
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs (Q3797213) (← links)
- Isometric subgraphs of Hamming graphs and d-convexity (Q4710662) (← links)
- Recognizing binary Hamming graphs inO(n 2 logn) time (Q4850329) (← links)