Orientations of digraphs almost preserving diameter

DOI10.1016/S0166-218X(01)00298-0zbMath1003.05049OpenAlexW1984850030MaRDI QIDQ1613394

Anders Yeo, Gregory Gutin

Publication date: 29 August 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00298-0

zbMATH Keywords

diameterdigraphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

Bounds for the oriented diameter of planar triangulations ⋮ Twin-distance-hereditary digraphs ⋮ Large girth and small oriented diameter graphs ⋮ A degree condition for diameter two orientability of graphs ⋮ Total restrained domination in graphs ⋮ On the total domination number of cross products of graphs ⋮ Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs ⋮ Locally Semicomplete Digraphs and Generalizations ⋮ Semicomplete Multipartite Digraphs ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ Diameter of orientations of graphs with given minimum degree

Cites Work

• Distances in orientations of graphs
• Methods and problems of communication in usual networks
• A classification of locally semicomplete digraphs
• Strongly connected orientations of mixed multigraphs
• A survey of gossiping and broadcasting in communication networks
• Robbins's Theorem for Mixed Multigraphs
• A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
• Generalizations of tournaments: A survey
• Quasi‐transitive digraphs
• Unnamed Item

This page was built for publication: Orientations of digraphs almost preserving diameter