arXiv (All)
open access
Geometric Realizations with Strong Self-Duality Part II: Diameter Graphs, Reuleaux Polyhedra, and Thrackles
In this paper we construct new examples of diameter graphs and Reuleaux polyhedra in $\mathbb{R}^3$, obtaining a full characterization of their combinatorial structure. For a finite set of points $X\subset\mathbb{R}^d$, its diameter graph is the graph on vertex set $X$ where pairs forming a diameter
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Shape optimization with inradius constraint and emergence of honeycomb structures#1217807
- When Shall We $k$ Meet Again? Tight Algorithms for Diameter and Radius under the Meet Distance#1037252
- Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics#66909
- A Bondy-type theorem for rainbow pancyclicity in graph systems#1064236
- A Note on Triple Repetition Sequence of Domination Number in Graphs#722491
Record · ID 1202759
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive