Modularity of some distance graphs
From MaRDI portal
Publication:6182000
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- scientific article; zbMATH DE number 714489 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- A counterexample to Borsuk’s conjecture
- A generalization of Kneser graphs
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- Around Borsuk's hypothesis
- Clique chromatic numbers of intersection graphs
- Counterexamples to Borsuk's conjecture with large girth
- Intersection theorems with geometric consequences
- Modularity of complex networks models
- Modularity of regular and treelike graphs
- On lower bounds for the chromatic number of spheres
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- Search with small sets in presence of a liar
- The Borsuk partition problem: the seventieth anniversary
- The isoperimetric number of random regular graphs
- The number of edges in induced subgraphs of some distance graphs
This page was built for publication: Modularity of some distance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182000)