On the oriented diameter of planar triangulations
From MaRDI portal
Publication:6645167
DOI10.1007/s10878-024-01177-zMaRDI QIDQ6645167
Indra Rajasingh, Debajyoti Mondal, N. Parthiban
Publication date: 28 November 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Series-parallel orientations preserving the cycle-radius
- Orientations of the n-cube with minimum diameter
- Oriented diameter of graphs with diameter 3
- Finding small simple cycle separators for 2-connected planar graphs
- Distances in orientations of graphs
- Methods and problems of communication in usual networks
- Orientations of digraphs almost preserving diameter
- Canonical ordering trees and their applications in graph drawing
- AT-free graphs: Linear bounds for the oriented diameter
- Optimal orientations of graphs and digraphs: A survey
- The diameter of an orientation of a complete multipartite graph
- Reduced constants for simple cycle graph separation
- On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles
- On optimal orientation of cycle vertex multiplications
- Minimizing the Oriented Diameter of a Planar Graph
- 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
- Fast Gossiping for the Hypercube
- Diameter-preserving orientations of the torus
- Oriented diameter of graphs with given maximum degree
- Bounds for the minimum oriented diameter
- Oriented diameter of star graphs
- Improved bounds for the oriented radius of mixed multigraphs
- Oriented diameter of maximal outerplanar graphs
- The oriented diameter of graphs with given connected domination number and distance domination number
This page was built for publication: On the oriented diameter of planar triangulations
