The minimum number of dependent arcs in С³₃k

The minimum number of dependent arcs in С³₃k

Let D be an acyclic orientation of a simple graph G. An arc is called depenedent if its reversal creates a directed cycle. Let d (D) denote the number of dependent arcs in D. Define d min (G) to be the minimum number of d (D) over all acyclic orientations D of G. Let Cn denote the cycle on n vertice...

Full description

Bibliographic Details
Published in:Tamsui Oxford Journal of Mathematical Sciences 27, 4 (2011(N)).
Other Authors: Xu, Fengwei, Wang, Weifan, Lih, Ko-Wei
Format: Article
Language:English
Subjects:
Acyclic orientation.
Dependent arc.
Cycle.
Cube.