On the public citation graph

Minimizing and maximizing the diameter in orientations of graphs

0 signed · 45 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1080/00029890.1980.11995131openalex-snapshot
Robbins's Theorem for Mixed Multigraphs
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/(sici)1097-0037(199901)33:1<57::aid-net4>3.0.co;2-ropenalex-snapshot
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199808)28:4<171::aid-jgt1>3.0.co;2-gopenalex-snapshot
Generalizations of tournaments: A survey
inferred← citeshttps://doi.org/10.1002/jgt.10135openalex-snapshot
Short proofs of classical theorems
inferred← citeshttps://doi.org/10.1002/jgt.10160openalex-snapshot
Complexity of approximating the oriented diameter of chordal graphs
inferred← citeshttps://doi.org/10.1002/jgt.22707openalex-snapshot
Oriented diameter of maximal outerplanar graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190190405openalex-snapshot
Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
inferred← citeshttps://doi.org/10.1002/jgt.v45:4openalex-snapshot
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_19openalex-snapshot
The Complexity of Approximating the Oriented Diameter of Chordal Graphs
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.1007/978-3-540-72588-6_58openalex-snapshot
Sharp Bounds for the Oriented Diameters of Interval Graphs and 2-Connected Proper Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_27openalex-snapshot
Orientable Burning Number of Graphs
inferred← citeshttps://doi.org/10.1007/bf01858466openalex-snapshot
The minimum diameter of orientations of complete multipartite graphs
inferred← citeshttps://doi.org/10.1007/s003730200036openalex-snapshot
Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs
inferred← citeshttps://doi.org/10.1007/s40305-023-00476-2openalex-snapshot
Using the minimum and maximum degrees to bound the diameter of orientations of bridgeless graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2006.01.010openalex-snapshot
Lower and upper orientable strong radius and strong diameter of complete k-partite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.02.004openalex-snapshot
Orientable burning number of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2026.05.012openalex-snapshot
Oriented diameter of graphs with diameter 4 and given edge girth
inferred← citeshttps://doi.org/10.1016/j.disc.2005.02.010openalex-snapshot
The orientation number of two complete graphs with linkages
inferred← citeshttps://doi.org/10.1016/j.disc.2005.04.012openalex-snapshot
On optimal orientation of cycle vertex multiplications
inferred← citeshttps://doi.org/10.1016/j.disc.2007.03.053openalex-snapshot
Multipartite tournaments: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2008.02.039openalex-snapshot
On a conjecture concerning the orientation number of a graph
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.ejc.2015.03.003openalex-snapshot
Diameter of orientations 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.1016/s0012-365x(00)00055-8openalex-snapshot
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00054-xopenalex-snapshot
The diameter of an orientation of a complete multipartite graph [Discrete Math. 149 (1996) 131–139]
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00038-7openalex-snapshot
On optimal orientations of cartesian products of graphs (I)
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00136-3openalex-snapshot
On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00373-8openalex-snapshot
On optimal orientations of G vertex-multiplications
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00376-7openalex-snapshot
AT-free graphs: linear bounds for the oriented diameter
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00017-6openalex-snapshot
Optimal orientations of products of paths and cycles
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00110-9openalex-snapshot
On optimal orientations of cartesian products with a bipartite graph
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00216-1openalex-snapshot
Bilateral Orientations and Domination
inferred← citeshttps://doi.org/10.1109/apcip.2009.79openalex-snapshot
Minimal Diameter Orientation of Complete Split Graph
inferred← citeshttps://doi.org/10.1142/s0219265900000032openalex-snapshot
OPTIMAL ORIENTATIONS OF ANNULAR NETWORKS
inferred← citeshttps://doi.org/10.2298/fil2502675lopenalex-snapshot
Oriented diameter of the complete tripartite graph
inferred← citeshttps://doi.org/10.3390/appliedmath6080133openalex-snapshot
A New Four-Color Problem
inferred← citeshttps://doi.org/10.4208/aam.oa-2025-0029openalex-snapshot
Oriented Diameter and Radius of Triangulations
inferred← citeshttps://doi.org/10.4236/ojdm.2017.72007openalex-snapshot
Length of the Longest Path and Diameter in Orientations of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2001.01908openalex-snapshot
On optimal orientations of complete tripartite graphs
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.