arXiv (All)
open access
An asymptotically tight bound on oriented diameter
Let $f(d)$ be the smallest integer such that every finite connected bridgeless simple graph of diameter $d$ admits a strong orientation of diameter at most $f(d)$. Chvátal and Thomassen (1978) proved $\lceil d^2/2\rceil+d\le f(d)\le2d^2+2d$. In this paper, we prove that $\lceil d^2/2\rceil+d\le f(d)
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
- An asymptotically tight bound on oriented diameter#1201074
- Polynomial Lower Bounds for Distributed Graph Sketching with Tiny Error: Connectivity and Spanning Tree Construction#973425
- Separating Notions of Graph Width: the Adaptive, Normal, Linear, Entropic, and Submodular Width#1169673
- Separating Notions of Graph Width: the Adaptive, Normal, Linear, Entropic, and Submodular Width#1145185
- Coloring Small $K_t$-Minor-Free Graphs#986042
Record · ID 1234016
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