Diameter and maximum degree in Eulerian digraphs

DOI10.1016/J.DISC.2015.11.021MaRDI QIDQ906483zbMATH OpenOpenAlexFDO

Authors 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

distancediameterdigraphmaximum degreeEulerian digraph

Mathematics Subject Classification ID

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

Recommendations

• The diameter of almost Eulerian digraphs
• Distance and size in digraphs
• The diameter of directed graphs
• Supereulerian digraphs with given diameter
• Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs

Cites work

• scientific article; zbMATH DE number 4144019 (Why is no real title available?)
• scientific article; zbMATH DE number 3763971 (Why is no real title available?)
• scientific article; zbMATH DE number 3334009 (Why is no real title available?)
• Diameter of 4-colourable graphs
• Diameter of orientations of graphs with given minimum degree
• Diameters in graphs
• Distance and size in digraphs
• Estimating the Wiener index by means of number of vertices, number of edges, and diameter
• Maximum diameter of regular digraphs
• On the diameter of a graph
• Ordre Minimum D'un Graphe Simple De Diametre, Degre Minimum Et Connexite Donnes
• Radius, diameter, and minimum degree
• The diameter of almost Eulerian digraphs
• The diameter of directed graphs

Cited in

(15)

• The diameter of almost Eulerian digraphs
• scientific article; zbMATH DE number 426169 (Why is no real title available?)
• Size of graphs and digraphs with given diameter and connectivity constraints
• Formally verified algorithms for upper-bounding state space diameters
• Note on long paths in Eulerian digraphs
• A note on the number of edges guaranteeing a \(C_4\) in Eulerian bipartite digraphs
• Bounds on the fault-diameter of graphs
• On average distance in tournaments and Eulerian digraphs
• Delta invariant for Eulerian digraphs
• The diameter of directed graphs
• Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
• An improvement to Chvátal and Thomassen's upper bound for oriented diameter
• Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs
• Distance and size in digraphs
• Minimum orders of Eulerian oriented digraphs with given diameter

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906483)