Filters








2 Hits in 1.9 sec

Making a tournament k-arc-strong by reversing or deorienting arcs

Jørgen Bang-Jensen, Anders Yeo
2004 Discrete Applied Mathematics  
We prove that every tournament T = (V; A) on n ¿ 2k + 1 vertices can be made k-arc-strong by reversing no more than k(k + 1)=2 arcs.  ...  We show that the number of arcs we need to reverse in order to make a tournament k-arc-strong is closely related to the number of arcs we need to reverse just to achieve in-and out-degree at least k.  ...  Deorienting arcs of a tournament in order to achieve high in-and out-degree or high arc-strong connectivityLemma 5.1.  ... 
doi:10.1016/s0166-218x(03)00438-4 fatcat:fjbi3glukfdy5pbqz4ev57u7xq

Author index to volume

2004 Discrete Applied Mathematics  
Bang-Jensen, J. and A. Yeo, Making a tournament k-arc-strong by reversing or deorienting arcs (2-3) 161-171 Bonsma, P., Sparsest cuts and concurrent flows in product graphs (1) 1-1 Chen, S., see J.  ...  Oertel, Complexity results on a paint shop Liu, G. and W. Zang, f-Factors in bipartite ðmf Þ-graphs Lou, D. and Q. Yu, Connectivity of k-extendable graphs with large k Xu, K. and W.  ... 
doi:10.1016/s0166-218x(03)00669-3 fatcat:nplxrn6oxbdvpf2t3cyzo7wugu