AT-free graphs: Linear bounds for the oriented diameter
From MaRDI portal
Publication:1827858
DOI10.1016/S0166-218X(03)00376-7zbMath1046.05025WikidataQ60488770 ScholiaQ60488770MaRDI QIDQ1827858
Ivan Rapaport, Erich Prisner, Fedor V. Fomin, Martin Matamala
Publication date: 6 August 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (16)
An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter ⋮ Improved bound on the oriented diameter of graphs with given minimum degree ⋮ Improved bounds for the oriented radius of mixed multigraphs ⋮ Bounds for the oriented diameter of planar triangulations ⋮ Series-parallel orientations preserving the cycle-radius ⋮ Oriented diameter of graphs with given girth and maximum degree ⋮ The oriented diameter of graphs with given connected domination number and distance domination number ⋮ Large girth and small oriented diameter graphs ⋮ Unnamed Item ⋮ A degree condition for diameter two orientability of graphs ⋮ An improvement to Chvátal and Thomassen's upper bound for oriented diameter ⋮ Oriented diameter of star graphs ⋮ Oriented diameter of graphs with diameter 3 ⋮ Diameter three orientability of bipartite graphs ⋮ Directing Road Networks by Listing Strong Orientations ⋮ Diameter of orientations of graphs with given minimum degree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tolerance graphs
- Distances in orientations of graphs
- On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
- Methods and problems of communication in usual networks
- Minimizing and maximizing the diameter in orientations of graphs
- On optimal orientations of Cartesian products with a bipartite graph
- On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles
- Representation of a finite graph by a set of intervals on the real line
- On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
- Strongly connected orientations of mixed multigraphs
- A survey of gossiping and broadcasting in communication networks
- On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
- On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
- Asteroidal Triple-Free Graphs
- Diameter-preserving orientations of the torus
- On optimal orientations of Cartesian products of even cycles
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
This page was built for publication: AT-free graphs: Linear bounds for the oriented diameter
