AT-free graphs: Linear bounds for the oriented diameter
From MaRDI portal
Recommendations
Cites work
- A survey of gossiping and broadcasting in communication networks
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- Asteroidal Triple-Free Graphs
- Diameter-preserving orientations of the torus
- Distances in orientations of graphs
- Graph theory
- scientific article; zbMATH DE number 3924692 (Why is no real title available?)
- scientific article; zbMATH DE number 3991541 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- Methods and problems of communication in usual networks
- Minimizing and maximizing the diameter in orientations of graphs
- On optimal orientations of Cartesian products of even cycles
- On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles
- On optimal orientations of Cartesian products with a bipartite graph
- On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
- On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
- On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
- On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
- Representation of a finite graph by a set of intervals on the real line
- Strongly connected orientations of mixed multigraphs
- Tolerance graphs
Cited in
(31)- A degree condition for diameter two orientability of graphs
- Diameter three orientability of bipartite graphs
- An improvement to Chvátal and Thomassen's upper bound for oriented diameter
- Diameter of orientations of graphs with given minimum degree
- Oriented diameter of graphs with given girth and maximum degree
- Bilateral orientations and domination
- Directing Road Networks by Listing Strong Orientations
- Improved bound on the oriented diameter of graphs with given minimum degree
- Series-parallel orientations preserving the cycle-radius
- On subfamilies of AT-free graphs
- An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter
- Improved bounds for the oriented radius of mixed multigraphs
- Bounds for the oriented diameter of planar triangulations
- The oriented diameter of graphs with given connected domination number and distance domination number
- The oriented diameter of a bridgeless graph with given \(P_3\)
- Large girth and small oriented diameter graphs
- On the oriented diameter of planar triangulations
- On oriented diameter of power graphs
- A diameter bound for 4-edge-connected C₄-free graphs
- Diameter two orientability of mixed graphs
- Using the minimum and maximum degrees to bound the diameter of orientations of bridgeless graphs
- Diameter three orientability of mixed bipartite graphs
- Diameter of orientations of graphs with given order and number of blocks
- Obstructions to faster diameter computation: asteroidal sets
- The oriented diameter of a bridgeless graph with the given path P_k
- The oriented diameter of graphs derived from other graphs
- On the oriented diameter of near planar triangulations
- The oriented diameter of mixed multigraphs with diameter 2
- Oriented diameter of graphs with diameter 4 and given edge girth
- Oriented diameter and radius of triangulations
- Oriented diameter of graphs with diameter 3
This page was built for publication: AT-free graphs: Linear bounds for the oriented diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827858)
