Pages that link to "Item:Q4020701"
From MaRDI portal
The following pages link to Maximum diameter of regular digraphs (Q4020701):
Displaying 10 items.
- Capturing the drunk robber on a graph (Q406701) (← links)
- Distance and size in digraphs (Q468452) (← links)
- Minimum orders of Eulerian oriented digraphs with given diameter (Q477806) (← links)
- Diameter and maximum degree in Eulerian digraphs (Q906483) (← links)
- Formally verified algorithms for upper-bounding state space diameters (Q1663245) (← links)
- The diameter of directed graphs (Q1775900) (← links)
- On average distance in tournaments and Eulerian digraphs (Q2026317) (← links)
- Size of graphs and digraphs with given diameter and connectivity constraints (Q2043684) (← links)
- Diameter of some monomial digraphs (Q2829804) (← links)
- Minimum algebraic connectivity and maximum diameter: Aldous-Fill and Guiduli-Mohar conjectures (Q6500102) (← links)