39 search results - page 1 / 8 » Oriented diameter of graphs with diameter 3 |
JCT
2010
13 years 3 months ago
2010
In 1978, Chv´atal and Thomassen proved that every 2-edge-connected graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest...
DM
2010
13 years 5 months ago
2010
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a given ...
GC
2002
Springer
13 years 4 months ago
2002
Springer
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x = y of vertices such that both xy and yx a...
JCT
2007
13 years 4 months ago
2007
We prove results on the size of weakly and strongly separating set systems and matrices, and on cross-intersecting systems. As a consequence, we improve on a result of Katona and ...
DM
2007
13 years 4 months ago
2007
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...