On the public citation graph
Bounds for the minimum oriented diameter
0 signed · 41 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199808)32:1<1::aid-net1>3.0.co;2-gopenalex-snapshot
Diameter-preserving orientations of the torus
inferredcites →https://doi.org/10.1002/jgt.10160openalex-snapshot
Complexity of approximating the oriented diameter of chordal graphs
inferredcites →https://doi.org/10.1002/net.3230150409openalex-snapshot
Strongly connected orientations of mixed multigraphs
inferredcites →https://doi.org/10.1007/3-540-36379-3_19openalex-snapshot
The Complexity of Approximating the Oriented Diameter of Chordal Graphs
inferredcites →https://doi.org/10.1007/bf01858466openalex-snapshot
The minimum diameter of orientations of complete multipartite graphs
inferredcites →https://doi.org/10.1016/0012-365x(88)90123-9openalex-snapshot
Orientations of the n-cube with minimum diameter
inferredcites →https://doi.org/10.1016/0012-365x(94)00315-aopenalex-snapshot
The diameter of an orientation of a complete multipartite graph
inferredcites →https://doi.org/10.1016/0095-8956(78)90078-3openalex-snapshot
Distances in orientations of graphs
inferredcites →https://doi.org/10.1016/j.dam.2004.01.005openalex-snapshot
Minimum average distance of strong orientations of graphs
inferredcites →https://doi.org/10.1016/j.disc.2005.02.010openalex-snapshot
The orientation number of two complete graphs with linkages
inferredcites →https://doi.org/10.1016/j.jctb.2004.11.005openalex-snapshot
The diameter of directed graphs
inferredcites →https://doi.org/10.1016/j.jctb.2009.08.003openalex-snapshot
Oriented diameter of graphs with diameter 3
inferredcites →https://doi.org/10.1016/s0012-365x(00)00346-0openalex-snapshot
On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle
inferredcites →https://doi.org/10.1016/s0012-365x(02)00807-5openalex-snapshot
On strong distances in oriented graphs
inferredcites →https://doi.org/10.1016/s0012-365x(99)00136-3openalex-snapshot
On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles
inferredcites →https://doi.org/10.1016/s0012-365x(99)00373-8openalex-snapshot
On optimal orientations of G vertex-multiplications
inferredcites →https://doi.org/10.1016/s0166-218x(03)00376-7openalex-snapshot
AT-free graphs: linear bounds for the oriented diameter
inferredcites →https://doi.org/10.1016/s0166-218x(04)00133-7openalex-snapshot
Minimum average distance of strong orientations of graphs
inferredcites →https://doi.org/10.1016/s0166-218x(97)00017-6openalex-snapshot
Optimal orientations of products of paths and cycles
inferredcites →https://doi.org/10.1016/s0166-218x(99)00110-9openalex-snapshot
On optimal orientations of cartesian products with a bipartite graph
inferredcites →https://doi.org/10.1016/s1571-0653(04)00216-1openalex-snapshot
Bilateral Orientations and Domination
inferredcites →https://doi.org/10.2307/2303897openalex-snapshot
A Theorem on Graphs, with an Application to a Problem of Traffic Control
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22181openalex-snapshot
Oriented diameter of graphs with given maximum degree
inferred← citeshttps://doi.org/10.1002/jgt.22707openalex-snapshot
Oriented diameter of maximal outerplanar graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-20796-9_14openalex-snapshot
Bounds for the Oriented Diameter of Planar Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_7openalex-snapshot
Directing Road Networks by Listing Strong Orientations
inferred← citeshttps://doi.org/10.1016/j.disc.2018.12.012openalex-snapshot
A degree condition for diameter two orientability of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113287openalex-snapshot
Oriented diameter of graphs with given girth and maximum degree
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113846openalex-snapshot
Large girth and small oriented diameter graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114406openalex-snapshot
On the oriented diameter of near planar triangulations
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114509openalex-snapshot
The oriented diameter of a bridgeless graph with the given path P
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114732openalex-snapshot
Diameter two orientability of mixed graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114821openalex-snapshot
A diameter bound for 4-edge-connected C4-free graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.03.003openalex-snapshot
Diameter of orientations of graphs with given minimum degree
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.08.006openalex-snapshot
Improved bound on the oriented diameter of graphs with given minimum degree
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.03.003openalex-snapshot
Optimal oriented diameter of graphs with diameter 3
inferred← citeshttps://doi.org/10.1109/candar.2013.16openalex-snapshot
On Oriented Diameter of Star Graphs
inferred← citeshttps://doi.org/10.2989/16073606.2025.2480134openalex-snapshot
Diameter of orientations of graphs with given order and number of blocks
inferred← citeshttps://doi.org/10.37236/9723openalex-snapshot
Diameter Three Orientability of Bipartite Graphs
inferred← citeshttps://doi.org/10.4208/aam.oa-2025-0029openalex-snapshot
Oriented Diameter and Radius of Triangulations
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.