The following pages link to The diameter of directed graphs (Q1775900):
Displaying 22 items.
- Distance and size in digraphs (Q468452) (← links)
- Minimum orders of Eulerian oriented digraphs with given diameter (Q477806) (← links)
- The diameter of almost Eulerian digraphs (Q612941) (← links)
- The diameter and Laplacian eigenvalues of directed graphs (Q819189) (← links)
- The diameter of Hanoi graphs (Q844161) (← links)
- Diameter and maximum degree in Eulerian digraphs (Q906483) (← links)
- Diameters of uniform subset graphs (Q998410) (← links)
- On the relationship between the diameter and the size of a boundary of a directed graph (Q1329425) (← links)
- Formally verified algorithms for upper-bounding state space diameters (Q1663245) (← links)
- On average distance in tournaments and Eulerian digraphs (Q2026317) (← links)
- Diameter of orientations of graphs with given minimum degree (Q2349963) (← links)
- (Q3201084) (← links)
- (Q3417284) (← links)
- The Diameter of a Graph and its Complement (Q3679229) (← links)
- (Q4232788) (← links)
- (Q4261824) (← links)
- (Q4489239) (← links)
- (Q5450589) (← links)
- APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION (Q5863397) (← links)
- DIAMETER OF THE DIRECT PRODUCT OF WIELANDT GRAPH (Q5887429) (← links)
- Diameter determination on restricted graph families (Q5951960) (← links)
- Bounds on the fault-diameter of graphs (Q6496348) (← links)