Tournaments, oriented graphs and football sequences

[1] N. Achutan, S. B. Rao, A. Ramachandra-Rao, The number of symmetric edges in a digraph with prescribed out-degrees. Combinatorics and Applications (Calcutta, 1982), Indian Statist. Inst., (1984), 8–20.Search in Google Scholar

[2] M. Aigner, Uses of diagram lattice, Mittel. Mathem. Sem. Gissen (Coxeter-Festschrrift), 163 (1984), 61–77.Search in Google Scholar

[3] G. G. Alway, Matrices and sequences, Math. Gazette, 46 (1962), 208–213.10.2307/3614018Search in Google Scholar

[4] P. Avery, Score sequences of oriented graphs, J. Graph Theory, 15, 3 (1991), 251–257.Search in Google Scholar

[5] C. M. Bang, H. Sharp, Score vectors of tournaments, J. Combin. Theory, Ser. B, 26, 1 (1979), 81–84.Search in Google Scholar

[6] M. Behzad, G. Chartrand, L. Lesniak, Graph and digraphs, Prindle, Weber and Schmidt, now Wadsworth, Boston, 1979.Search in Google Scholar

[7] C. Berge, The Theory of Graphs and its Applications, Methuen, London, 1962, Translation of Theorie des Graphs et ses Applications, Dunod, Paris 1960.Search in Google Scholar

[8] A. Brauer, I. C. Gentry, K. Shaw, A new proof of theorem by H. G. Landau on tournament matrices, J. comb. Theory A, 5 (1968), 289–292.10.1016/S0021-9800(68)80074-2Search in Google Scholar

[9] R. A. Brualdi, J. Shen, Landau’s inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments, J. Graph Theory, 38, 4 (2001), 244–254.Search in Google Scholar

[10] R. A. Brauldi, H. J. Ryser, Combinatorail Matrix Theory, Cambridge university Press, 1991.10.1017/CBO9781107325708Search in Google Scholar

[11] R. A. Brauldi, K. Kiernan, Landaus and Rados theorems and partial tournaments, Electron. J. Combin, 16, 1 (2009), p. N2.10.37236/240Search in Google Scholar

[12] V. W. Bryant, A tournament result deduced from harems, Elemente der Mathematik, 42 (1987), 153–156.Search in Google Scholar

[13] G. Chartrand, L. Lesniak, Graphs and Digraphs, Secound edition, Wadsworth and Brooks/Cole, Monterey, 1986.Search in Google Scholar

[14] T. A. Chishti, U. Samee, Mark sequences in bipartite multidigraphs and constructions, Acta Univ. Sapien. Math., 4, 1 (2012), 53–64.Search in Google Scholar

[15] D. R. Fulkerson, Zero-one matrices with zero trace, Pacific J. Math., 10 (1960), 831–835.10.2140/pjm.1960.10.831Search in Google Scholar

[16] D. R. Fulkerson, Upsets in round robin tournaments, Canad. J. Math. 17 (1965), 957–969.10.4153/CJM-1965-091-7Search in Google Scholar

[17] J. R. Griggs, K. B. Reid, Landau's Theorem revisited, Australasian J. Comb., 20 (1999), 19–24.Search in Google Scholar

[18] F. Harary, L. Moser, The Theory of round robin tournaments, Amer. Math. Monthly, 73 (1966), 231–246.10.1080/00029890.1966.11970749Search in Google Scholar

[19] A. Holshouser, H. Reiter, Win sequences for round-robin tournaments, Pi Mu Eplison J., 13 (2009), 37–44.Search in Google Scholar

[20] Antal Iványi, Jon E. Schoenfield, Deciding football sequences, Acta Univ. Sapientiae, Informatica, 4, 1 (2012), 130–183.Search in Google Scholar

[21] H. G. Landau, On dominance relations and the structure of animal societies: III, The condition for a score structure, Bull. Math. Biophysics, 15 (1953), 143–148.10.1007/BF02476378Search in Google Scholar

[22] Q. Li, Some results and problems in graph theory, pp 336-343 in Graph theory and its applications: East and West, Jinan, 1986, (New York Acad. Sci., New York, 1989).10.1111/j.1749-6632.1989.tb16416.xSearch in Google Scholar

[23] E. S. Mahmoodian, A critical case method of proof in combinatorical mathematics, Bull. Iranian Math. Soc., (1978), 1L–26L.Search in Google Scholar

[24] J. S. Maybee, N. J. Pullman, Tournament matrices and their generalizations I, Linear Multilinear Algebra, 28 (1990), 57–70.10.1080/03081089008818030Search in Google Scholar

[25] S. Pirzada, U. Samee, Mark sequences in digraphs, Seminare Loth. de Combinatorie, 55 Art. B (2006).Search in Google Scholar

[26] S. Pirzada, T. A. Naikoo, Inequalities for marks in digraphs, J. Mathematical Inequalities and Applications, 9, 2 (2006), 189–198.Search in Google Scholar

[27] S. Pirzada, Mark sequences in multidigraphs, Disc. Math. Appl., 17, 1 (2007), 71–76.Search in Google Scholar

[28] S. Pirzada, T. A. Naikoo, N. A. Shah, Score sequences in oriented graphs, J. Applied Mathematics and Computing, 23, 1-2 (2007), 257–268.Search in Google Scholar

[29] S. Pirzada, Merajuddin, U. Samee, Mark sequences in 2-digraphs, J. Applied Mathematics and Computing, 27 (2008), 379–391.10.1007/s12190-008-0071-2Search in Google Scholar

[30] S. Pirzada, U. Samee, T. A. Naikoo, Merajuddin, Inequalities for marks in multidigraphs, Italian J. Pure and Appl. Math., 28 (2011), 91–100.Search in Google Scholar

[31] K. B. Reid, Tournaments: Scores, kings, generalizations and special topics, In: Surveys on Graph Theory (edited by G. Chartrand and M. Jacobson), Congressus Numerantium, 115 (1996) 171–211.Search in Google Scholar

[32] M. Santana, K. B. Reid, Landau’s theorem revisited again, JCMCC, 80 (2012), 171–191.Search in Google Scholar

[33] C. Thomassen, Landau’s characterization of tournament score sequences in The Theory and Application of Graphs, Wiley, New York (1981), 589–591.Search in Google Scholar