The diameter of directed graphs

DOI10.1016/j.jctb.2004.11.005zbMath1064.05050OpenAlexW1998859964MaRDI QIDQ1775900

Peter Dankelmann

Publication date: 4 May 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.11.005

zbMATH Keywords

DistanceEulerianMinimum degreeOriented graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Formally verified algorithms for upper-bounding state space diameters ⋮ Diameter and maximum degree in Eulerian digraphs ⋮ Distance and size in digraphs ⋮ Minimum orders of Eulerian oriented digraphs with given diameter ⋮ On average distance in tournaments and Eulerian digraphs ⋮ Diameters of uniform subset graphs ⋮ APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION

Cites Work

• Unnamed Item
• Unnamed Item
• Radius, diameter, and minimum degree
• On the diameter of a graph
• Maximum diameter of regular digraphs

This page was built for publication: The diameter of directed graphs