scientific article; zbMATH DE number 3845607
From MaRDI portal
Publication:3315532
Recommendations
Cited in
(39)- On computational complexity of length embeddability of graphs
- Strongly self-dual polytopes and distance graphs in the unit sphere
- The distinguishing chromatic numbers of triangulations on the sphere
- Colouring quadrangulations of projective spaces
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles
- On the chromatic number of 2-dimensional spheres
- Self-polar polytopes
- Lovász' theorem on the chromatic number of spheres revisited
- Conway’s Spiral and a Discrete Gömböc with 21 Point Masses
- Self-Dual Polyhedral Cones and Their Slack Matrices
- 𝑑-dimensional self-dual polytopes and Meissner polytopes
- Chromatic numbers of spheres
- Spectral bounds for the independence ratio and the chromatic number of an operator
- On lower bounds for the chromatic number of sphere
- On the distance and multidistance graph embeddability problem
- Metric thickenings and group actions
- Counterexamples to Borsuk's conjecture with large girth
- The graphs behind reuleaux polyhedra
- Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
- Colorful subgraphs in Kneser-like graphs
- On topological relaxations of chromatic conjectures
- On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges
- Metric thickenings, Borsuk-Ulam theorems, and orbitopes
- Lower bounds for measurable chromatic numbers
- Diameter-extremal subsets of spheres
- On lower bounds for the chromatic number of spheres
- On directed local chromatic number, shift graphs, and Borsuk-like graphs
- Critical graphs without triangles: an optimum density construction
- Self-dual maps. I: Antipodality
- Topological bounds on the dimension of orthogonal representations of graphs
- Meissner polyhedra
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
- The Chromatic Number of Kneser Hypergraphs
- On the computational complexity of degenerate unit distance representations of graphs
- Strongly involutive self-dual polyhedra
- Local chromatic number and distinguishing the strength of topological obstructions
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
- Metric reconstruction via optimal transport
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 Q3315532)
