References

1. Akiyama, J. and Kano, M., Factors and factorization of graphs, J. Graph Theory 9
(1985) 142.
2. Alavi, A. and Behzad, M., Complementary graphs and edge-chromatic numbers,
SIAM J. Apl. Math. 20 (1971) 161163.
3. Alspach, B. and Reid, K. B., Degree frequencies in digraphs and tournaments, J.
Graph Theory 2 (1978) 241249.
4. Anderson, I., Perfect matching of a graph, J. Combin. Theory Ser. B 10 (1971)
183186.
5. Appel, K. and Haken, W., Every planar map is four colorable, Bull. Amer. Math.
Soc. 82 (1976) 711712.
6. Appel, K. and Haken, W., Every planar map is four colorable, Part I, Discharging,
Illinois J. Math. 21 (1977) 429490.
7. Appel, K. and Haken, W., Every planar map is four colorable, Part II, Reducibility,
Illinois J. Math. 21 (1977) 491567.
8. Avery, P., Condition for a tournament score sequence to be simple, J. Graph Theory
4 (1980) 157164.
9. Avery, P., Score sequences in oriented graphs, J. Graph Theory 15, 3 (1991) 251257.
10. Babler, F., Uber die Zerlegung regularer streckenkomplexe ungerader Ordnung, Com-
ment. Math. Helve. 10 (1938) 275287.
11. Bagga, K. S. and Beineke, L.W., Uniquely realizable score lists in bipartite tourna-
ments, Czech. Math. Journal 37, 112 (1987) 323333.
12. Balakrishnan, R. and Paulraja, P., Chordal graphs and some of their derived graphs,
Congressus Numerantium 53 (1986) 3335.
13. Balakrishnan, R. and Ranganathan, K., ATextbook of Graph Theory, Springer-Verlag,
New York (2000).
Graph Theory 443
14. Barnette, D. W. and Grunbaum, B., On Steinitzs theorem concerning convex 3-
polytopes and on some properties of planar graphs, Lecture Notes in Math. 110
(1969) 2740.
15. Behzad, M. and Chartrand, G., Introduction to the Theory of Graphs, Allyn and
Bacon, Inc., Boston (1971).
16. Behzad, M. and Simpson, J. E., Eccentric sequences and eccentric sets in graphs,
Discrete Math. 16 (1976) 187193.
17. Behzad, M., Chartrand, M. G. and Lesniak, L., Foster, Graphs and Digraphs, Pindle,
Weber and Schmidt Int. Series, Boston Mass. (1979).
18. Beineke, L. W., Derived graphs and digraphs, in H. Sachs, H. Voss and H. Walther
(eds), Beitrage zur Graphentheorie Teubner, Leipzig (1968) 1733.
19. Beineke, L. W., A tour through tournaments, or bipartite and ordinary tournaments,
A comparative survey, Combinatorics, London Math. Soc. Lecture Note Series 52,
Cambridge University Press (1981) 4155.
20. Beineke, L. W. and Moon, J. W., On bipartite tournaments and scores, in G. Chartrand
(ed.), The Theory of Applications of Graphs (1981) 5571.
21. Berge, C., Two theorems in graph theory, Proc. Nat. Acad. Sci. U. S. A. 43 (1957)
842844.
22. Berge, C., The Theory of Graphs and its Applications, Methuen, London (1962).
23. Berge, C., Graphs and Hypergraphs, North-Holland, Amsterdam (1973).
24. Bermond, J. C. and Thomassen, C., Cycles in digraphsa survey, J. Graph Theory
5, 1 (1981) 143.
25. Biggs, N. L., Algebraic Graph Theory, Cambridge University Press (1974).
26. Bjelica, M. and Lakic, S., Criteria for scores sequences, Novi Sad J. Math. 30, 2
(2000) 1114.
27. Bjelica, M. and Lakic, S., Criteria for sets of scores with prescribed positions, IMC
Filomat (2001) 2630.
28. Boesch, F. T., Suffel, C. and Tindell, R., The spanning subgraphs of Eulerian graphs,
J. Graph Theory 1 (1977) 7984.
29. Bollabas, B., External Graph Theory, Acad. Press, New York (1978).
30. Bollobas, B., Uniquely colorable graphs, J. Combin. Theory Ser. B 24 (1978).
31. Bollobas, B. and Catlin, P. A., Topological cliques of random graphs, J. Comb. The-
ory Ser. B 30 (1981) 224227.
444 References
32. Bondy, J. A., Bounds on the chromatic number of a graph, J. Combin. Theory 7
(1969) 9698.
33. Bondy, J. A., Properties of graphs with constraints on degrees, Studia Sci. Math.
Hungar. 4 (1969) 473475.
34. Bondy, J. A., Pancyclic graphs, J. Combin. Theory Ser. B11 (1971) 8084.
35. Bondy, J. A., Short proofs of classical theorems, J. Graph Theory, 44 (2003) 159165.
36. Bondy, J. A. and Chvatal, V., A method in graph theory, Discrete Math. 15 (1976)
111135.
37. Bondy, J. A. and Halberstam, F. Y., Parity theorems for paths and cycles in graphs, J.
Graph Theory 10 (1986) 107115.
38. Bondy, J. A. and Thomassen, C., A short proof of Meyniels theorem, Discrete Math.
19 (1977) 195197.
39. Brooks, R. L., On coloring the nodes of a network, Proc. Cambridge Phil. Soc. 37
(1941) 194197.
40. Brualdi, R. A. and Shen, J., Landaus inequalities for tournament scores and a short
proof of a theoremon transitive sub-tournaments, J. Graph Theory 38 (2001) 244254.
41. de Bruijn, N.G., A combinatorial problem, Proc. Kon. Ned. Akad. V. Wetensch. 49
(1946) 758764.
42. Buckley, F. and Harary, F., Distance in Graphs, Addison-Wesley (1990).
43. Buckley, F., Miller, Z. and Slater, P. J., On graphs containing a given graph as center,
J. Graph Theory 5 (1981) 427434.
44. Camion, P., Chemins et circuits Hamiltoniens des graphs complets, C. R. Acad. Sci.
Paris 249 (1959) 21512152.
45. Cartwright, D. and Harary, F., On colorings of signed graphs, Elem. Math. 23 (1968)
8589.
46. Cayley, A., Atheoremon trees, Quart. J. Math. 23 (1989) 376378; collected papers,
Cambridge 13 (1877) 2628.
47. Chang, L. C., The uniqueness and non uniqueness of the triangular association scheme,
Sci. Record 3 (1959) 604613.
48. Chartrand, G., On Hamiltonian line graphs, Trans. Amer. Math. Soc. 134 (1968)
559566.
49. Chartrand, G. and Geller, D., Uniquely colorable graphs, J. Combin. Theory 6 (1969)
271278.
Graph Theory 445
50. Chartrand, G., Gavlas, H., Harary F. and Schultz, M., On signed degrees in signed
graphs, Czech. Math. Journal 44 (1994) 111117.
51. Chartrand, G. and Kronck, H. V., Randomly traceable graphs, SIAM J. Appl. Math.
16 (1968) 696700.
52. Chartrand, G. and Stewart, M. J., Isometric graphs, in Capobianco et. al., Recent
Trends in Graph Theory, Springer-Verlag, Berlin, Lecture Notes in Math. 186 (1971)
6367.
53. Chartrand, G. and Stewart, M. J., The connectivity of line graphs, Math. Ann. 182
(1969) 170174.
54. Chartrand, G. and Schuster, S., Which graphs have unique distance trees, Amer.
Math. Monthly 81 (1974) 5356.
55. Chartrand, G. and Wall, C. E., On the Hamiltonian index of a graph, Studia Sci.
Math. Hungar. 8 (1973) 4348.
56. Chartrand, G. and White, A. T., Randomly traversable graphs, Elem. Math. 25 (1970)
101107.
57. Chen, Y. L., A short proof of Kundus f-factor theorem, Discrete Math. 71 (1988)
177179.
58. Choudam, S. A., A simple proof of the Erdos-Gallai theorem on graphic sequences,
Bull. Austral. Math. Soc. 36 (1986) 6770.
59. Chvatal, V., On Hamiltons ideals, J. Combin. Theory Ser. B 12 (1972) 163168.
60. Clark, J. and Holton, D. A., A First Look at Graph Theory, World Scientic (1991).
61. Courant, R. and Robbins, H. E., What is Mathematics? Oxford Univ. Press, London
(1941).
62. Cunningham, W. H., Matchings, matroids and extensions, Math. Programming B91
(2002) 515542.
63. Deo, N., Graph Theory with Applications to Engineering and Computer Science,
PHI, New Delhi (1974).
64. Dharwadkar, A., A new proof of the four color theorem, http: //www.geocities.com/
(2002).
65. Dijkstra, E. W., A note on two problems in connexion with graphs, Numer. Math. 1
(1959) 26971.
66. Dirac, G. A., Aproperty of 4-chromatic graphs with some remarks on critical graphs,
J. London Math. Soc 27 (1952) 8592.
67. Dirac, G. A., Short proof of Mengers graph theorem, Mathematika 13 (1966) 4244.
446 References
68. Dirac, G.A., Some theorems on abstract graphs, Proc. London Math. Soc. 2 (1976)
111135.
69. Dirac, G. A. and Schuster, S., A theorem of Kuratowski, Nederl. Akad. Wetensch.
Proc. Ser. A 57 (1954) 343348.
70. Edmonds, J. and Johnson, E. L., Matching, Euler tours and the Chinese postman,
Math. Programming 5 (1973) 88124.
71. Eplett, W. J. R., Self-converse tournaments, Canad. Math. Bull. 22 (1979) 2327.
72. Erdos, P. and Fajtlowicz, S., On the conjecture of Hajos, Combinatorica 1 (1981)
141143.
73. Erdos, P. and Gallai, T. G., Graphs with prescribed degrees of vertices, Mat. Lapok
11 (1960) 264274.
74. Euler, L., Solutio problematics ad geometriamsitus pertinents, Comment. Academiae
Sci. I Petropolitanae 8 (1736) 128140.
75. Euler, L., Demonstratio Nonnullarum Insignium Proprietatum QuibusSolida Hedris
Planis Inclusa Sunt Praedita, Novi Comm. Acad. Sci. Imp. Petropol 4 (1758)
140160.
76. Euler, L., The Konigsberg bridges, Sci. Amer. 189 (1853) 6670.
77. Fary, I., On straight line representation of planar graphs, Acta Sci. Math. 11 (1948)
229233.
78. Finck, H. J. and Sachs, H., Uber eine von H. S. Wilf angegebene Schranke fur die
chromatische Zahl endlicher Graphe, Math. Nachr. 39 (1969) 373386.
79. Fleischner, H., Elementary proofs of (relatively) recent characterizations of Eulerian
graphs, Discrete Applied Math. 24 (1989) 115119.
80. Fleischner, H., Eulerian graphs and related topics, Annals of Discrete Math. 45,
North-Holland, New York (1990).
81. Ford, L. R. and Fulkerson, D. R., Flows in Networks, Princeton University Press,
Princeton (1962).
82. Foulds, L. R., Graph Theory Applications, Springer-Verlag, New York (1992).
83. Fulkerson, D. R., Hofman, A. J. and Mc Andrew, M. H., Some properties of graphs
with multiple edges, Can. J. Math. 17 (1965) 166177.
84. Gale, D., A theorem on ows in networks, Pacic J. Math. 7 (1957) 10731082.
85. Gervacio, S. V., Score sequences: lexicographic enumeration and tournament con-
struction, Discrete Math. 72 (1988) 151155.
Graph Theory 447
86. Grinberg, E. Ja., Plane homogenous graphs of degree three without Hamiltonian cir-
cuits (Russian), Latvian Math. Yearbook 4 (1968) 5158.
87. Ghouila-Houri, A., Une condition sufciante d, existence d un circuit Hamiltonian,
C. R. Acad. Sci. Paris 25 (1960) 495497.
88. Graver, J. E. and Jurkat, W. R., f -factors and related decompositions of graphs, J.
Combin. Theory Ser. B 28 (1980) 6684.
89. Griggs, J. R. and Reid, K.B., Landaus Theorem revisited, Australasian J. Combina-
torics 20 (1999) 1924.
90. Grotzsch, H., Ein Oreifarbensatz fur dreikreisfreie Netze auf der Kugel, Wiss. Z.
Martin-Luther Univ. Halle-Wittenberg Math. Naturwiss. Reihe 8 (1958) 109120.
91. Grunbaum, B., Grotzschs Theorem on 3-colorings, Michigan Math. J. 10 (1963)
303310.
92. Grunbaum, B., Graphs and Complex, Report of the University of Washington, Seat-
tle, Math., 572B, 1969.
93. Grunbaum, B., Problem 2 in combinatorial structures and their applications, Proc.
Calgory International Conference, (1969), Gordon and Breach, New York.
94. Gupta, R. P., Bounds on the chromatic and achromatic numbers of complementary
graphs, in W. T. Tutte (ed.), Recent Progress in Combinatorics, Acad. Press, New
York 1969 (229235).
95. Hadwiger, H., Uber eine Klassication der Streckenkomplexe, Vierteljschr Natur-
forsch Ges Zurich 88 (1943) 133142.
96. Hager, M., On score sets for tournaments, Discrete Math. 58 (1986) 2534.
97. Hajos, G., Uber eine Konstruktion nich n-farbarrer Graphen, Wiss. Z. Martin-Cuther
Univ. Halle-wittenberg Math. Nat. Reihe 10 (1961) 116117.
98. Hakimi, S. L., On realizability of a set of integers as degree of the vertices of a linear
graph II. Uniqueness, J. Soc. Indust. Apple. Math.11 (1963) 135147.
99. Hakimi, S., On the realizability of a set of integers as the degrees of the vertices of a
graph, SIAM J.Appl.Math.10 (1962) 496506.
100. Hall, M., Distinct representatives of subsets, Bull. Amer. Math. Soc. 3 (1952)
584587.
101. Hall, P., On representation of subsets, J. London Math. Soc. 10 (1935) 2030.
102. Hamilton, W.R., Memorandum respecting a new system of roots of unity, Philosoph-
ical Magazine, 12, 4 (1856), p.446. http://www.maths.tcd.ie/pub/Hist Math/People/
Hamilton/Icosian/
448 References
103. Harary, F., A characterization of block graphs, Canad. Math. Bull.6 (1963) 16.
104. Harary, F., Graph theory, Addison-Wesley, Reading, MA. (1969).
105. Harary, F. and Frisch, I. T., Communication, Transmission and Transportation Net-
works, Addison-Wesley, Reading MA. (1971).
106. Harary, F. and Hedetniemi, S., The achromatic number of a graph, J. Combin. Theory
B (1970) 154161.
107. Harary, F., Hedetniemi, S. and Robinson, R. W., Uniquely colorable graphs, J. Com-
bin. Theory 6 (1969) 264270.
108. Harary, F. and Nash-Williams, C. St. J. A., On Eulerian and Hamiltonian graphs and
line graphs, Canad. Math. Bull. 8 (1965) 701710.
109. Harary, F. and Norman, R. Z., The dissimilarity characteristic of Husimi trees, Ann.
of Math. 58 (1953) 131141.
110. Harary, F., Norman, R. Z. and Cartwright, D., Structural Models: An Introduction to
the Theory of Directed Graphs, Wiley, New York (1965).
111. Hasselbarth, W., Die verzweightheit von graphen, Match 16 (1984) 317.
112. Havel, M., A remark on the existence of nite graphs, Casopis Pest. Mat. 80 (1955)
477480.
113. Heawood, P. J., Map color theorem, Qurat. J. Pure Appl. Math. 24 (1890) 332338.
114. Hedetniemi, S., On hereditary properties of graphs, Studia Sci. Math. Hungarica.
115. Heirholzer, C., Ueber die Moglickkeit, Einen Linienzug ohne Wiederholung and
ohne Unterrechung zu umfahren, Math. Ann. 6 (1893) 3032.
116. Hoffman, A. J., On the exceptional case in a characterization of the arcs of complete
graphs, IBM J. Res. Develop. 4 (1960) 487496.
117. Hoffman, A. J., On the uniqueness of the triangular association scheme, Ann. Math.
Statist. 31 (1960) 492497.
118. Hoffman, A. J., On the line graph of the complete bipartite graph, Ann. Math. Statist.
35 (1964) 883885.
119. Ivanyi, A., Reconstruction of complete interval tournaments, Acta Univ. Sapientiae,
Informatica, 1, 1 (2009) 7188.
120. Ivanyi, A., Reconstruction of complete interval tournaments II, Acta Univ. Sapien-
tiae, Mathematica, 2, 1 (2010) 4771.
121. Jaeger, F., A note on sub-Eulerian graphs, J. Graph Theory 3 (1979) 9193.
122. Jordan, C., Sur les assemblages de lignes, J. Reine Angew Math. 70 (1969) 185190.
Graph Theory 449
123. Jung, H. A., Zu einem isomorphiesatz von Whitney fur Graphen, Math. Ann. 164
(1966) 270271.
124. Kano, M. and Saito, A., [a, b]-factors of graphs, Discrete math. 47 (1983) 113116.
125. Kano, M. and Saito, A., [a, b]-factorization of a graph, J. Graph Theory 9 (1985)
129146.
126. Kapoor, S. F., Polimeni, A. O. and Wall, C. E., Degree sets for graphs, Fund. Math.
95 (1977) 189194.
127. Kasteleyn, P. W., Graph theory and crystal physics, in F. Harary (ed.) Chapter 2 in
Graph Theory and Theoretical Physics, Acad. Press (1967) 44110.
128. Kempe, A. B., On the geographical problem of the four colors, Amer. J. Math. 2
(1879) 193200.
129. Kleitman, D. J. and Wang, D. L., Algorithms for constructing graphs and digraphs
with given valencies and factors, Discrete Math. 6 (1973) 7888.
130. Koh, K. M. and Tan, B. P., The set and number of kings in a multipartite tournament,
Bull. Inst. Combin. Appl. 13 (1995) 1522.
131. Koh, K. M. and Tan, B. P., Kings in multipartite tournaments, Discrete Mathematics
147 (1995) 171183.
132. Koh, K. M. and Tan, B. P., Number of 4-kings in bipartite tournaments with no 3-
kings, Discrete Math. 154 (1996) 281287.
133. Koh, K. M. and Tan, B.P., The number of kings in multipartite tournaments, Discrete
Math., 167 (1997) 411418.
134. Kotzig, A., Cycles in a complete graph oriented in equilibrium, Mat. Fyz. Casopis
SAV 16 (1966) 175182.
135. Kotzig, A., The decomposition of a directed graph into quadratic factors consisting
of cycles, Acta F. R. N. Univ. Comen. Math. 22 (1969) 2729.
136. Konig, D., Graphen and Matrizen, Math. Fiz. Lapok 38 (1931) 116119.
137. Konig, D., Theorie der endlichen and unendlichen Graphen, Leipzig.
138. Konig, D., Uber Graphen und ihre Anwendung auf determinantentheorie und Men-
genlehre, Math. Ann. 77 (1916) 453465.
139. Kouider, M. and Zbigniew Long, Stability number and [a, b]-factors in Graphs, J.
Graph Theory 46 (2004) 254264.
140. Krausz, J., Demonstration nouvelle d un theoreme de Whitney sur les reseaux, Mat.
Fiz. Lapok 50 (1943) 7589.
450 References
141. Kundu, S., Generalizations of the k-factor theorem, Discrete Math. 9 (1974) 173179.
142. Kundu, S., The Chartrand-Schuster Conjecture: Graphs with unique distance trees
are regular, J. Combin, Theory Ser. B 22 (1977) 233245.
143. Kundu, S., The k-factor conjecture is true, Discrete Math. 6 (1973) 367376.
144. Kuratowski, C., Sur le probleme des courbes gauches en topologie, Fund. Math. 15
(1930) 271283.
145. Landau, H. G., On dominance relations and the structure of animal socities: III. The
condition for a score structure, Bull. Math. Biophys. 15 (1953) 143148.
146. Lesniak, L., Eccentric sequences in graphs, Period Math. Hungar. 6 (1975) 287293.
147. Lesniak-Foster and Williams, J. E., On spanning and dominating circuits in graphs,
Canad. Math. Bull.20 (1977).
148. Lovasz, L., Subgraphs with prescribed valencies, J. Combin. Theory 8 (1970) 391416.
149. Lovasz, L., Valencies of graphs with 1-factors, Period. Math. Hungar. 5 (1974)
149151.
150. Lovasz, L., A remark on Mengers theorem, Acta Math. Acad. Sci. Hungar. 6 (1975)
287293.
151. Lovasz, L., Three short proofs in graph theroy, J. Combin Theory Ser. B 19 (1975)
111113.
152. Lovasz, L., Combinatorial Problems and Exercises, North-Holland, Amsterdam(1979).
153. Lucas, E., Rcrations Mathmatiques, Gauthier-Villares Paris (1891).
154. Mathematisch Centrum, This Weeks Citation Classic, CC/Number 7, February 14,
1983, http://www.gareld.library.upenn.edu/.
155. Maurer, S. B., The king chicken theorems, Math. Mag. 53 (1980) 6780.
156. McCuaig, W., Asimple proof of Mengers theorem, J. Graph Theory 8 (1984) 427429.
157. Mckee, T. A., Recharacterizing Eulerian: Intimations of new duality, Discrete Math.
51 (1984) 237242.
158. Menger, K., Zur allgemeinen Kurventheoril, Fund. Math. 10 (1927) 96115.
159. Menon, V., On repeated interchange graphs, Amer. Math. Monthly 13 (1966) 986989.
160. Meyniel, M., Une condition sufciante dexistance dun circuit Hamiltonian dans un
graphe oriente, J. Combin. Theory Ser. B 14 (1973) 137147.
161. Mirsky, L., Transversal Theroy, Acad. Press, New York (1971).
Graph Theory 451
162. Moon, J. W., On some combinatorial and probabilistic aspects of bipartite graphs,
Ph.D Thesis, University of Alberta, Edmonton (1962).
163. Moon, J. W., On the line graph of the complete bigraph, Ann. Math. Statist. 34
(1963) 664667.
164. Moon, J. W., Various proofs of Cayleys formula for counting trees, in F. Harary and
L. Beineke (eds), A seminar on Graph Theory, Holt, Rinehart and Winston (1967)
7078.
165. Moon, J. W., Topics on Tournaments, Holt, Rinehart and Winsten, New York (1968).
166. Muhammad A., Khan, K. K. Kayibi and S. Pirzada, Some results on tournaments,
Annales Computatorica, To appear.
167. Nash-Williams, C. St. J. A., Edge-disjoint spanning trees of nite graphs, J. London
Math. Soc. 36 (1961) 445450.
168. Nash-Williams, C. St. J. A., Edge-disjoint Hamiltonian circuits in graphs with ver-
tices of large valency, in Studies in Pure Mathematics, Acad. Press, London (1971).
169. Nash-Williams, C. St. J. A. and Tutte, W. T., More proofs of Mengers theorem, J.
Graph Theory I (1977) 1317.
170. Nebesky, L., On the line graph of the square and the square of the line graph of a
connected graph, Casopis. Pset. Mat. 98 (1973) 285287.
171. Newman, D. J., A Problem in Graph Theory, Amer. Math. Monthly, 65 (1958) 611.
172. Nordhaus, E. A. and Gaddam, J. W., On complementary graphs, Amer. Math. Monthly
63 (1956) 175177.
173. O Neil, P. V., A new proof of Mengers theorem, J. Graph Theory 2 (1978) 257259.
174. Ore, O., A problem regarding the tracing of graphs, Elem. Math. 6 (1951) 4953.
175. Ore, O., Graphs and matching theorems, Duke Math. J. 22 (1955) 625639.
176. Ore, O., Note on Hamilton circuits, Amer. Math. Monthly 67 (1960) 55.
177. Ore, O., The Four Color Problem, Acad. Press, New York (1967).
178. Ore, O., Theory of Graphs, Amer. Math. Soc. Colloq. Publ. 38, Providence (1962).
179. Ore, O. and Stemple, G. J., Numerical methods in the four color problem, in W. T.
Tutte (ed.) Recent Progress in Combinatorics, Acad. Press, New York (1969).
180. Parthasarathy, K. R., Basic Graph Theory, Tata McGraw-Hill, New Delhi (1994).
181. Peterson, J., Die Theories der regularen graphen, Acta Math. 15 (1891) 193220.
452 References
182. Petrovic, V. and Thomassen, C., Kings in k-partite tournaments, Discrete Mathemat-
ics 98 (1991) 237238.
183. Petrovic, V., Decomposition of some planar graphs into trees, Discrete Mathematics
150 (1996) 449451.
184. Petrovic, V., Kings in bipartite tournaments, Discrete Mathematics 173 (1997) 187196.
185. Pirzada, S., Self converse score lists in oriented graphs, J. China Univ. of Science
and Tech. 26, 3 (1996) 392394.
186. Pirzada, S., Simple score sequences in oriented graphs, Novi Sad J. Math. 33, 1
(2003) 2529.
187. Pirzada, S., Construction of oriented graphs, in Balakrishnan, Wilson and Sethura-
man (eds) Proc. National Conf. Graph Theory and Applications, Narosa, (2004)
146149.
188. Pirzada, S., Mark sequences in multidigraphs, Discrete Mathematics and Applica-
tions 17, 1 (2007) 7176.
189. Pirzada, S., Imbalances in digraphs, Kragujevic J. Mathematics 31 (2008) 14314
190. Pirzada, S. and Merajuddin, Score lists in oriented tripartite graphs, Novi Sad J. Math
26, 2 (1996) 19.
191. Pirzada, S. and Samee, U., Seminare Loth. de Comb. 55 Art B.(2006).
192. Pirzada, S., Merajuddin and Samee, U., On oriented graph scores, Matematicki Ves-
nik 60 (2008) 187191.
193. Pirzada, S., Merajuddin and Samee, U., Inequalities in oriented graph scores, Bull.
Allahabad Mathematical Society 23, 2 (2008) 389395.
194. Pirzada, S., Merajuddin and Yin Jianhua, On the scores of oriented bipartite graphs,
J. Math. Study 33, 4 (2000) 245359.
195. Pirzada, S. and Naikoo, T. A., Degree frequencies in oriented graphs, Thai J. Maths.
2 (2004) 8596.
196. Pirzada, S. and Naikoo, T. A., Inequalities on marks in digraphs, J. Mathematical
Inequalities and Applications 9, 2 (2006) 189198.
197. Pirzada, S. and Naikoo, T. A., Score sets in tournaments, VietnamJ. Mathematics 34,
2 (2006) 157161.
198. Pirzada, S. and Naikoo, T. A., Score sets in k-partite tournaments, J. Applied Mathe-
matics and Computing 22, 1-2 (2006) 237245.
199. Pirzada, S. and Naikoo, T. A., Score sets in oriented k-partite graphs, AKCE Inter-
national J. Graphs and Combinatorics 3, 2 (2006).
Graph Theory 453
200. Pirzada, S. and Naikoo, T. A., Score sets for oriented graphs, Applicable Analysis
and Discrete Mathematics 2, No. 1 (2008) 107113.
201. Pirzada, S., Naikoo, T. A. and Chishti, T. A., Score sets in oriented bipartite graphs,
Novi Sad J. Mathematics 36, 1 (2006) 3545.
202. Pirzada, S., Naikoo, T. A. and Dar, F. A., Signed degree sets in signed graphs, Czech.
Mathematical Journal 57, 3 (2007) 843848.
203. Pirzada, S., Naikoo, T. A. and Shah, N. A., Score sequences in oriented graphs, J.
Applied Mathematics and Computing 22, 12 (2007) 257268.
204. Pirzada, S., Naikoo, T. A. and Dar, F. A., Degree sets in bipartite and 3-partite graphs,
Oriental Journal of Mathematical Sciences 1, 1 (2007) 4753.
205. Pirzada, S., Naikoo, T. A. and Dar, F. A., Signed degree sequences in signed bipartite
graphs, AKCE International J. Graphs and Combinatorics 4, 2 (2007) 112.
206. Pirzada, S. Naikoo, T. A. and Dar, F. A., A note on signed degree sets in signed
bipartite graphs, Applicable Analysis and Discrete Mathematics 2, 1 (2008) 114117.
207. Pirzada, S. and Shah, N. A., Kings and serfs in oriented graphs, Mathematica Slovaca
58, 3 (2008) 277288.
208. Pirzada, S. and Yin Jian Hua, Degree sequences in graphs, J. Math. Study 39, No. 1
(2006) 2531.
209. Plesnik, J., Connectivity of regular graphs and the existence of 1-factors, Math. Ca-
sopis 22 (1972) 310318.
210. Posa, L., A theorem concerning Hamiltonian lines, Magyar Tud. Akad. Math. Kutato
Int. Kozl 7 (1962) 225226.
211. Prim, R. C., Shortest connection networks and some generalizations, Bell System
Techn. J. 36 (1957) 13891401.
212. Prufer, H., Beweis eines Satzes uber Permutationen, Arch-Math Physics 27 (1918)
742744.
213. Pym, J. S., A proof of Mengers theorem, Monatsh. Math. 73 (1969) 8183.
214. Randic, M., Characterization of atoms, molecules and classes of molecules based on
path enumerations, Proc. Bremen Konferenz zur Chemie, Univ. Bremen (1978) Part
II, Match No. 7 (1979) 564.
215. Rao, A. R. and Rao, S. B., On factorable degree sequences, J. Combin, Ser. B 13
(1972) 185191.
216. Redei, L., Ein Kombinatorischer Satz, Acta. Litt. Szeged, 7 (1934) 3943.
217. Reid, K. B., Score sets for tournaments, Congressus Num. 21 (1978) 607618.
454 References
218. Reid, K. B. and Beineke, L.W., Tournaments, in L. W. Beineke and R. J. Wilson
(eds), Chapter 7 in Selected Topics in Graph Theory, Acad. Press, London (1979)
169204.
219. Reid, K. B., Tournaments with prescribed number of kings and serfs, Congressus
Numerantium 29 (1980) 809826.
220. Reid, K. B., Every vertex a king, Discrete Mathematics 38 (1982) 9398.
221. Reid, K. B., Tournaments: Scores, kings, generalizations and special topics-a survey,
Congressus Num. 115 (1996) 171211.
222. Reid, K. B. and Zhang, C. Q., Score sequences of semi complete digraphs, Bulletin
of the ICA 24 (1998) 2732.
223. Ringel, G. and Youngs, J. W. T., Solution of the Heawood map coloring problem,
Proc. Nat. Acad. Sci. USA 60 (1968) 438445.
224. Rizzi, R., A short proof of Konigs matching theorem, J. Graph Theory 33 (2000)
138139.
225. Robertson, N., Sanders, D. P., Seymour, P. D. and Thomas, R., The four color theo-
rem, J. Combin. Theory Ser. B. 70 (1997) 244.
226. Rooij, V. A. and Wilf, H., The interchange graphs of a nite graph, Acta. Math.
Acad. Sci. Hungar. 16 (1965) 263269.
227. Ryser, H. J., Combinatorial properties of matrices of zeros and ones, Canad. J. Math.
9 (1957) 371377.
228. Ryser, H. J., Matrices of zeros and ones in combinatorial mathematics, in Recent
Advances in Matrix Theory, Univ. Wisconsin Press (1964) 103124.
229. Saaty, T. L., Thirteen colorful variations on Guthries four color conjecture, Amer.
Math. Monthly 79 (1972) 243.
230. Saaty, T. L. and Kainen, P. C., The Four Color Problem, McGraw Hill, New York
(1977).
231. Sabidussi, G., Graph derivatives, Math. 2. 76 (1961) 385401.
232. Schnyder, W., Planar graphs and poset dimension, Order 5 (1989) a. 323343.
233. Seshu, S. and Reed, M., Linear Graphs and Electrical Networks, F. Harary(ed.),
Addison-Wesley, Reading (1961) Acad Press, London (1967) 44110.
234. Slater, P. J., A counter-example to Randics conjecture on distance degree-sequences
for trees, J. Graph Theory 6 (1982) 8992.
235. Sierksma, G. and Hoogeveen, H., Seven criteria for integer sequences being graphic,
J. Graph Theory 15 (1991) 223231.
Graph Theory 455
236. Sumner, D. P., 1-factors and antifactor sets, J. London Math. Soc. 2 (13) (1976)
351359.
237. Szekeres, G. and Wilf, H. S., An inequality for the chromatic number of a graph, J.
Combin. Theory 4 (1968) 13.
238. Tait, P. G., Remarks on the coloring of maps, Proc. Roy. Soc. Edinburgh Sect. A 10
(1880) 501503, 729.
239. Tanenbaum, A. S., Computer Networks, Prentice Hall Inc., Upper Saddle River, NJ,
1988.
240. The Mathematics Center at Bell Labs, History of Mathematics at Bell Labs,
http://cm.bell-labs.com/cm/ms/center/history.html
241. Thomassen, C., Kuratowskis theorem, J. Graph Theory 5 (1981) 225241.
242. Thomassen, C., Landaus characterization of tournament score sequences, in The The-
ory and Applications of Graphs, John Wiley (1981) 589591.
243. Titov, V. K., A constructive description of some classes of graphs, Ph.D. Thesis,
Moscow (1975).
244. Toida, S., Properties of an Euler graph, J. Franklin Inst. 295 (1973) 343345.
245. Tripathi, A. and Vijay, S., A note on a theorem of Erdos and Galai, Discrete Mathe-
matics 265 (13) (2003) 417420.
246. Tripathi, A., Venugopalan, S. and West, D. B., A short proof of the Erdos-Gallai
characterization of graphic lists, Discrete Math. 310 (2010) 843844.
247. Turan, P., Eine Extremalaufgabe aus der Grapheneorie, Mat. Fiz. Lapok 48 (1941)
436452 (1936), Reprinted Chelsea, New York (1950).
248. Tutte, W. T., A family of cubical graphs, Proc. Cambridge Phil. Soc. 21 (1946)
98101.
249. Tutte, W. T., The factorization of linear graphs, J. London Math. Soc. 22 (1947)
107111.
250. Tutte, W. T., The factors of graphs, Canad. J. Math. 4 (1952) 314328.
251. Tutte, W. T., A short proof of the factor theorem for nite graphs, Canad. J. Math. 6
(1954) 347352.
252. Tutte, W. T., On the problem of decomposing a graph into n connected factors, J.
London Math. Soc. 36 (1961) 221230.
253. Tutte, W. T., Graph factors, Combinatorica 1 (1981) 7997.
456 References
254. Veblen, O., An application of modular equations in analysis situs, Ann. of Math. 14
(191213) 8694.
255. Vergnas, M. L., An extension of Tuttes 1-factor theorem, Discrete Math. 23 (1978)
241255.
256. Vergnas, M. L., M. Thesis, University of Paris, v1 (1972).
257. van Aardenne-Ehrenfest, T. and de Bruijn, N. G., Circuits and trees in oriented
graphs, Simon Stevin 28 (1951) 203217.
258. Vizing, V. G., On an estimate of the chromatic class of a p-graph (Russian) Diskret.
Analiz. 3 (1964) 2530.
259. Vizing, V. G., The chromatic class of a multigraph, Cybernetics 3 (1965) 3241.
260. Wagner, K., Bemerkungen zumVierfarbenproblem, Jahresber Deutsch. Math. Verein
46 (1936) 2122.
261. Wang, D. L. and Kleitman, D. J., On the existence of n-connected graphs with pre-
scribed degrees (n >2), Networks 3 (1973) 225239.
262. Welsh, D. J. A. and Powell, M. B., An upper bound for the chromatic number of a
graph and its application to time-tabling problems, Comput. J. 10 (1967) 8586.
263. West, D. B., Introduction to Graph Theory, Prentice Hall Inc. (1996).
264. Whitney, H., A theorem on graphs, Annals Math. 32 (1931) 378390.
265. Whitney, H., Congruent graphs and the connectivity of graphs, Amer. J. Math. 54
(1932) 150168.
266. Whitney, H., 2-isomorphic graphs, Amer. J. Math. 55, (1933) 245254.
267. Whitney, H., Planar graphs, Fund. Math. 21 (1933) 7384.
268. Wiener, N., A simplication of logic of relations, Proc. Cambridge Phil. Soc. 17
(191214) 387390.
269. Wilson, R. J., Introduction to Graph Theory, Oliver and Boyd, Edindurgh (1972).
270. Woodall, D. R., Sufcient conditions for circuits in graphs, Proc. London Math.Soc.
24 (1972) 739755.
271. Yan, J., Lih, K., Kuo, D. and Chang, G. J., Signed degree sequences in signed graphs,
J. Graph Theory 26 (1997) 111117.
272. Zhou, G., Yao, T. and Zhang, K, On score sequences of k-hypertournaments, Euro-
pean J. Combin. 21 (8) (2000) 9931000.