@article{Barthlemy1995TheRN,
title={The Reversing Number of a Digraph},
author={Jean-Pierre Barth{\'e}lemy and Olivier Hudry and Garth Isaak and Fred S. Roberts and Barry A. Tesman},
journal={Discrete Applied Mathematics},
year={1995},
volume={60},
pages={39-76}
}

A minimum reversing set of a digraph is a smallest sized set of arcs which when reversed makes the digraph acyclic. We investigate a related issue: Given an acyclic digraph D, what is the size of a smallest tournataent T which has the arc set of D as a minimum reversing set? We show that such a T always exists and define the reversing number ofan acyclic digraph to be the number of vertices in T minus the number of vertices in D. We also derive bounds and exact values of the reversing number… CONTINUE READING

The cireuit-hypergraph of a tournament, in: A. Hajnal et al., ¢ds., Infinite and Finite Sets, Colloquia Matbematicas Societatis Jan6s Bolyai I 0 (North-Holland

J. C. Bermond

1975

View 8 Excerpts

Highly Influenced

Ordres a distance minimum d ' un tournoi et graphes partiels sans circuits maximaux