Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set

Journal of Graph Theory

Volumn 45, Issue 1, 2004, Pages 28-47

  Isaak, Garth ^a   Narayan, Darren A ^b  

^a LEHIGH UNIVERSITY   (United States)

^b ROCHESTER INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Feedback arc sets; Linear ordering problem; Tournaments

Indexed keywords

BOUNDARY CONDITIONS; HAMILTONIANS; PROBABILITY; SET THEORY; THEOREM PROVING;

DIGRAPH; DIRECTED PATHS; FEEDBACK ARC SETS; LINEAR ORDERING PROBLEM; TOURNAMENTS;

GRAPH THEORY;

EID: 0345872258     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.10155     Document Type: Article

References (9)

1. J. L. Baldwin, W. C. Kronholm, and D. A. Narayan, Tournaments with a transitive subtournament as a feedback arc set, Congr Numer 158 (2002), 51-58.
2. J. P. Barthélemy, O. Hudry, G. Isaak, F. S. Roberts, and B. Tesman, The reversing number of a digraph, Discrete Appl Math 60 (1995), 39-76.
3. P. Erdös and J. W. Moon, On sets of consistent arcs in a tournament, Canad Math Bull 8 (1965), 269-271.
4. G. Isaak, Tournaments as feedback arc sets, Electron J Combin 20 (1995), 1-19.
5. D. A. Narayan, Tournaments with feedback path powers, Journal of Combinatorial Mathematics and Combinatorial Computing, to appear.
6. D. A. Narayan, The reversing number of a digraph; A disjoint union of directed stars, Congr Numer 145 (2000), 53-64.
7. P. Slater, Inconsistencies in a schedule of paired comparisons, Biometrika 48 (1961), 303-312.
8. D. B. West, Introduction to Graph Theory, 2nd edition, Prentice-Hall, New York, 2001.
9. D. H. Younger, Minimum feedback arc sets for a directed graph, IEEE Trans Circuit Theory 10 (1963), 238-245.