Diameter and maximum degree in Eulerian digraphs

DOI10.1016/J.DISC.2015.11.021zbMATH Open1329.05126OpenAlexW2214237916MaRDI QIDQ906483FDOQ906483

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

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

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)

Cites Work

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

Cited In (15)

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

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)