
An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter
An orientation of an undirected graph G is an assignment of exactly one ...
read it

OneWay Trail Orientations
Given a graph, does there exist an orientation of the edges such that th...
read it

Colourings of (m, n)coloured mixed graphs
A mixed graph is, informally, an object obtained from a simple undirecte...
read it

Connectivity of orientations of 3edgeconnected graphs
We attempt to generalize a theorem of NashWilliams stating that a graph...
read it

Pushable chromatic number of graphs with degree constraints
Pushable homomorphisms and the pushable chromatic number χ_p of oriented...
read it

Triangles and Girth in Disk Graphs and Transmission Graphs
Let S ⊂R^2 be a set of n sites, where each s ∈ S has an associated radiu...
read it

A study of cops and robbers in oriented graphs
We consider the wellstudied cops and robbers game in the context of ori...
read it
Improved Bounds for the Oriented Radius of Mixed Multigraphs
A mixed multigraph is a multigraph which may contain both undirected and directed edges. An orientation of a mixed multigraph G is an assignment of exactly one direction to each undirected edge of G. A mixed multigraph G can be oriented to a strongly connected digraph if and only if G is bridgeless and strongly connected [Boesch and Tindell, Am. Math. Mon., 1980]. For each r ∈ℕ, let f(r) denote the smallest number such that any strongly connected bridgeless mixed multigraph with radius r can be oriented to a digraph of radius at most f(r). We improve the current best upper bound of 4r^2+4r on f(r) [Chung, Garey and Tarjan, Networks, 1985] to 1.5 r^2 + r + 1. Our upper bound is tight upto a multiplicative factor of 1.5 since, ∀ r ∈ℕ, there exists an undirected bridgeless graph of radius r such that every orientation of it has radius at least r^2 + r [Chvátal and Thomassen, J. Comb. Theory. Ser. B., 1978]. We prove a marginally better lower bound, f(r) ≥ r^2 + 3r + 1, for mixed multigraphs. While this marginal improvement does not help with asymptotic estimates, it clears a natural suspicion that, like undirected graphs, f(r) may be equal to r^2 + r even for mixed multigraphs. En route, we show that if each edge of G lies in a cycle of length at most η, then the oriented radius of G is at most 1.5 r η. All our proofs are constructive and lend themselves to polynomial time algorithms.
READ FULL TEXT
Comments
There are no comments yet.