# Minimal Oriented Graphs of Diameter 2

```@article{Fredi1998MinimalOG,
title={Minimal Oriented Graphs of Diameter 2},
author={Zolt{\'a}n F{\"u}redi and Peter Hor{\'a}k and Chandra M. Pareek and Xuding Zhu},
journal={Graphs and Combinatorics},
year={1998},
volume={14},
pages={345-350}
}```
Let f n be the minimum number of arcs among oriented graphs of order n and diameter 2. Here it is shown for n > 8 that 1ÿ o1n log nU f nU n log nÿ 3=2n. 1. Oriented chromatic number An oriented graph is a digraph without opposite arcs, i.e., every pair of vertices is connected by at most one arc. An oriented colouring of an oriented graph D is a colouring of its vertices so that every colour class is an independent set, moreover for any two colour classes U and V , all the arcs… CONTINUE READING

#### Citations

##### Publications citing this paper.
Showing 1-8 of 8 extracted citations

## Complete oriented colourings and the oriented achromatic number

Discrete Applied Mathematics • 2014
View 4 Excerpts
Highly Influenced

## Theory , Algorithms and Applications

Jørgen Bang-Jensen, Gregory Gutin Digraphs
2007
View 6 Excerpts
Highly Influenced

## Outerplanar and planar oriented cliques

Journal of Graph Theory • 2016
View 2 Excerpts

## The complexity of deciding whether a graph admits an orientation with fixed weak diameter

Discrete Mathematics & Theoretical Computer Science • 2016
View 1 Excerpt

ArXiv • 2014
View 2 Excerpts

## Distance in Graphs

View 1 Excerpt

#### References

##### Publications referenced by this paper.
Showing 1-10 of 13 references

1998
View 1 Excerpt

## Acyclic and oriented chromatic numbers of graphs

Journal of Graph Theory • 1997
View 1 Excerpt

## The Monadic Second order Logic of Graphs VI: on Several Representations of Graphs By Relational Structures

Discrete Applied Mathematics • 1994
View 1 Excerpt

## Hajnal's triangle-free game and extremal graph problems

Z. FuÈredi, D. Reimer, Seress, . AÂ
Congressus Numerantium 82, 123±128 • 1991

## Matchings and covers in hypergraphs

Z. FuÈredi
Graphs Comb. 4, 115±206 • 1988

## Arc-minimal digraphs of speci®ed diameter

R. Dawes, H. Meijer
J. Comb. Math. and Comb. Comput. 1, 85±96 • 1987
View 3 Excerpts

## Inequalities for two set systems with prescribed intersections

Graphs and Combinatorics • 1987

## Mutually disjoint families of 0-1 sequences

Discrete Mathematics • 1975
View 2 Excerpts

C. Berge
1973

## The minimal number of edges of a directed graph with given diameter

ZnaÂm, . SÏ
Acta Fac. Rerum Natur. Univ. Comenian. Math. Publ. 24, 181±185 • 1970
View 3 Excerpts