Diameter and maximum degree in Eulerian digraphs

DOI10.1016/j.disc.2015.11.021zbMath1329.05126OpenAlexW2214237916MaRDI QIDQ906483

Peter Dankelmann, Michael J. Dorfling

Publication date: 21 January 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.11.021

zbMATH Keywords

digraphdistancediametermaximum degreeEulerian digraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (4)

Formally verified algorithms for upper-bounding state space diameters ⋮ An improvement to Chvátal and Thomassen's upper bound for oriented diameter ⋮ On average distance in tournaments and Eulerian digraphs ⋮ Size of graphs and digraphs with given diameter and connectivity constraints

Cites Work

• Distance and size in digraphs
• The diameter of almost Eulerian digraphs
• Diameter of 4-colourable graphs
• Radius, diameter, and minimum degree
• The diameter of directed graphs
• Diameter of orientations of graphs with given minimum degree
• On the diameter of a graph
• Ordre Minimum D'un Graphe Simple De Diametre, Degre Minimum Et Connexite Donnes
• Maximum diameter of regular digraphs
• Diameters in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Diameter and maximum degree in Eulerian digraphs