BIBLIOGRAPHY

Books

  • Book 1.
    (R.Z. Norman, D. Cartwright) Structural Models: An Introduction to the Theory of Directed Graphs. Wiley, New York (1965) 415 pp.
  • Edited Book 1.
    A Seminar on Graph Theory. Holt, Reinhart and Winston. New York (1967)
  • Edited Book 2.
    Graph Theory and Theoretical Physics. Academic Press, London (1967)
  • Book 1F.
    (R. Norman, D. Cartwright) Introduction a la Théorie des Graphes Orientés: Modèles Structuraux (French translation by A. Gibert) Dunod, Paris (1968).
  • Book 2.
    Graph Theory. Addison-Wesley, Reading (1969) 274 pp.
  • Edited Book 3.
    Proof Techniques in Graph Theory. Academic Press, New York (1969)
  • Book 2J.
    Graph Theory. (Japanese translation by S. Ikeda) Kyoritsu, Tokyo (1971)
  • Edited Book 4.
    (Edited with H.S. Wilf) Mathematical Aspects of Electrical Network Analysis. SIAM-AMS Proceedings 3 (1971)
  • Book 3.
    (E.M. Palmer) Graphical Enumeration. Academic Press, New York (1973) 271 pp.
  • Book 2R.
    Graph Theory. (Russian translation by V.P. Kozyrev) MIR, Moscow (1973) 300 pp.
  • Edited Book 5.
    New Directions in the Theory of Graphs. Academic Press, New York (1973)
  • Book 2G.
    Graphentheorie. (German translation by W. Mader) Oldenbourg, Munich (1974)
  • Edited Book 6.
    (Edited with R. Bari) Graphs and Combinatorics. Lecture Notes in Mathematics, Vol. 406, Springer, Berlin (1974)
  • Book 3R.
    (E.M. Palmer) Graphical Enumeration. (Russian translation by G. P. Gavrilov) MIR, Moscow (1977)
  • Book 4.
    (P. Hage) Structural Models in Anthropology. Cambridge Univ. Press, Cambridge (1983) 201 pp.
  • Edited Book 7.
    (Edited with J. Maybee) Graphs and Applications. Wiley, New York (1985)
  • Edited Book 8.
    (Edited with K. Phillips) Graph Theoretic Models in Computer Science I. Comput. Math. Appl. 15 (1988)
  • Book 5.
    (F. Buckley) Distance in Graphs. Addison-Wesley, Reading (1990)
  • Book 6
    (P. Hage) Exchange in Oceania Clarendon Press, Oxford (1991)
  • Edited Book 9.
    (Z. Tuza) Graph Theoretic Models in Computer Science II. Math. Comput. Modelling 17 (1993)
  • Book 7
    (P. Hage) Island Networks Cambridge Univ. Press, Cambridge (1996)

Chronological List

1949

  1. On the algebraic structure of knots. Amer. Math. Monthly 56 (1949) 466-468

1950

  1. Atomic boolean-like rings with finite radical. Duke Math. J. 17 (1950) 273-276
  2. On complete atomic proper relation algebras. J. Symbolic Logic 15 (1950) 197-198

1952

  1. (with I.C. Ross) On the determination of redundancies in sociometric chains. Psychometrika 17 (1952) 195-208

1953

  1. On the notion of balance of a signed graph. Michigan Math. J. 2 (1953) 143-146
  2. (A.H. Copeland) A characterization of implicative boolean rings. Canad. J. Math. 5 (1953) 465-469
  3. (A.H. Copeland) The extension of an arbitrary boolean algebra to an implicative boolean algebra. Proc. Amer. Math. Soc. 4 (1953) 751-758
  4. (I.M. Copi) Some properties of N-adic relations. Portugal. Math. 12 (1953) 143-152
  5. (R.Z. Norman) Graph Theory as a Mathematical Model in Social Science. Institute for Social Research, Ann Arbor (1953)
  6. (R.Z. Norman) The dissimilarity characteristic of Husimi trees. Ann. of Math. 58 (1953) 134-141
  7. (G.E. Uhlenbeck) On the number of Husimi trees I. Proc. Nat. Acad. Sci. USA 39 (1953) 315-322

1954

  1. (R.Z. Norman) The dissimilarity characteristic of linear graphs. Proc. Amer. Math. Soc. 75 (1954) 131-135
  2. (I.C. Ross) The number of complete cycles in a communication network. J. Social Psychology 40 (1954) 329-332

1955

  1. On local balance and N-balance in signed graphs. Michigan Math. J. 3 (1955) 37-41
  2. The number of linear, directed, rooted, and connected graphs. Trans. Amer. Math. Soc. 78 (1955) 445-463
  3. (I.C. Ross) Identification of the liaison persons of an organization using the structure matrix. Management Sci. 1 (1955) 251-258; 9 (1962) 157-161

1956

  1. Note on an enumeration theorem of Davis and Slepian. Michigan Math. J. 3 (1956) 149-153
  2. Note on the Polya and Otter formulas for enumerating trees. Michigan Math. J. 3 (1956) 109-112
  3. On the number of dissimilar line-subgraphs of a given graph. Pacific J. Math. 6 (1956) 57-64
  4. (D. Cartwright) Structural balance: A generalization of Heider's theory. Psychol. Review 63 (1956) 277-293

1957

  1. On arbitrarily traceable graphs and directed graphs. Scripta Math. 23 (1957) 37-41
  2. The number of dissimilar supergraphs of a linear graph. Pacific J. Math. 7 (1957) 903-911
  3. The number of oriented graphs. Michigan Math. J. 4 (1957) 221-224
  4. Structural duality. Behavioral Science 2 (1957) 255-265
  5. (H.H. Paper) Toward a general calculus of phonemic distribution. Language 33 (1957) 143-169
  6. (I.C. Ross) A procedure for clique detection using the group matrix. Sociometry 20 (1957) 205-215

1958

  1. On the group of a graph with respect to a subgraph. J. London Math. Soc. 33 (1958) 457-461
  2. Note on Carnap's relational asymptotic relative frequencies. J. Symbolic Logic 23 (1958)
  3. On the number of bicolored graphs. Pacific J. Math. 8 (1958) 743-755
  4. On the number of dissimilar graphs between a given graph-subgraph pair. Canad. J. Math. 10 (1958) 513-516

1959

  1. A criterion for unanimity in French's theory of social power. Studies in Social Power. (D. Cartwright, Ed.) Institute for Social Research, Ann Arbor (1959) 169-182
  2. An elementary theorem on graphs. Amer. Math. Monthly 66 (1959) 405-407
  3. Exponentiation of permutation groups. Amer. Math. Monthly 66 (1959) 572-575
  4. A graph theoretic methold for the complete reduction of a matrix with a view toward finding its eigenvalues. J. Math. Physics 38 (1959) 104-111
  5. Graph theoretic methods in the management sciences. Management Sci. 5 (1959) 387-403
  6. Graph theory and electric networks. Institute of Radio Engineers, Transactions on Circuit Theory CT-6 (1959) 95-109; Translations on Information Theory IT-6 (1959) 95-109
  7. On the group of the composition of two graphs. Duke Math. J. 26 (1959) 29-34
  8. On the line-group of two-terminal series-parallel networks. J. Math. Physics 38 (1959) 112-118
  9. On the measurement of structural balance. Behavioral Science 4 (1959) 316-323
  10. The number of functional digraphs. Math. Ann. 138 (1959) 203-210
  11. Status and contrastatus. Sociometry 22 (1959) 23-43
  12. (D. Cartwright) A note on Freud's "Instincts and their vicissitudes." International Journal of Psychoanalysis 40 (1959) 287-290
  13. (G. Prins) The number of homeomorphically irreducible trees, and other species. Acta Math. 101 (1959) 141-162
  14. (M. Richardson) A matrix algorithm for solutions and r-bases of a finite irreflexive relation. Naval Res. Logist. Quart. 6 (1959) 307-314
  15. (I.C. Ross) A description of strengthening and weakening group members. Sociometry 22 (1959) 139-147

1960

  1. On the consistency of precedence matrices. J. Assoc. Comput. Mach. 7 (1960) 255-259
  2. Graph theory. Encyclopedia of Science and Technology McGraw-Hill, New York 6 (1960) 253-256
  3. A matrix criterion for structural balance. Naval Res. Logist. Quart. 7 (1960) 195-199
  4. Some historical and intuitive aspects of graph theory. SIAM Review 2 (1960) 123-131
  5. Unsolved problems in the enumeration of graphs. Publ. Math. Inst. Hungar. Acad. Sci. 5 (1960) 63-95
  6. (R.Z. Norman) Dissimilarity characteristic theorems for graphs. Proc. Amer. Math. Soc. 11 (1960) 332-334
  7. (R.Z. Norman) Some properties of line digraphs. Rend. Circ. Mat. Palermo 9 (1960) 161-168
  8. (I.C. Ross) The square of a tree. Bell System Technical J. 39 (1960) 641-647
  9. (R.E. Williamson) A note on evaluating determinants. Amer. Math. Monthly 67 (1960) 660

1961

  1. A parity relation partitions its field distinctly. Amer. Math. Monthly 68 (1961) 215-217
  2. A structural analysis of the situation in the Middle East in 1956. J. Conflict Resolution 5 (1961) 167-178
  3. A very independent axiom system. Amer. Math. Monthly 68 (1961) 159-162
  4. Who eats whom? General Systems 6 (1961) 41-44
  5. (D. Cartwright) The number of lines in a digraph of each connectedness category. SIAM Review 3 (1961) 309-314
  6. (G.E. Peterson) Foundations of phonemic theory. Structure of Language and Its Mathematical Aspects. Proc. Symp. Appl. Math., Amer. Math. Soc. 12 (1961) 139-165

1962

  1. A complementary problem on nonplanar graphs. Math. Mag. 35 (1962) 301-303
  2. The determinant of the adjacency matrix of a graph. SIAM Review 4 (1962) 202-210
  3. A graph theoretic approach to matrix inversion by partitioning. Numer. Math. 4 (1962) 128-135
  4. The maximum connectivity of a graph. Proc. Nat. Acad. Sci. USA 48 (1962) 1142-1146
  5. Permutations with restricted position. Math. of Computation 16 (1962) 222-226
  6. Remark on the preceding note. Amer. Math. Monthly 69 (1962) 212-213
  7. (J. Battle, Y. Kodama) Every planar graph with nine points has a nonplanar complement. Bull. Amer. Math Soc. 68 (1962) 569-571
  8. (J. Battle, Y. Kodama, J.W.T. Youngs) Additivity of the genus of a graph. Bull. Amer. Math. Soc. 68 (1962) 565-568
  9. (B. Lipstein) The dynamics of brand loyalty: A markovian approach. Operations Research 10 (1962) 19-40
  10. (O.A. Oeser) A mathematical model for structural role theory, I. Human Relations 15 (1962) 89-109

1963

  1. A characterization of block-graphs. Canad. Math. Bull. 6 (1963) 1-6
  2. `Cosi fan Tutte' - A structural study. Psychological Reports 13 (1963) 466
  3. A measure of axiomatic independence. Mind 72 (1963) 143-144
  4. (D.E. Cohen, Y. Kodama) On the embedding of complete graphs in orientable surfaces. Mathematika 10 (1963) 79-83
  5. (A. Hill) On the number of crossings in a complete graph. Proc. Edinburgh Math. Soc. 13 (1963) 333-338
  6. (G. Prins) Enumeration of bicolourable graphs. Canad. J. Math. 15 (1963) 237-248

1964

  1. Combinatorial problems in graphical enumeration. Applied Combinatorial Mathematics (E.F. Beckenbach, Ed.) Wiley, New York (1964) 185-217
  2. A graph theoretic approach to similarity relations. Psychometrika 29 (1964) 143-151
  3. Recent results in topological graph theory. Acta Math. Acad. Sci. Hungar. 15 (1964) 405-412
  4. On the reconstruction of a graph from a collection of subgraphs. Theory of Graphs and Its Applications (M. Fielder, Ed.) Academic, New York (1964) 47-52
  5. (L.W. Beineke) On the thickness of the complete graph. Bull. Amer. Math. Soc. 70 (1964) 618-620
  6. (L.W. Beineke, J.W. Moon) On the thickness of the complete bipartite graph. Proc. Cambridge Philos. Soc. 60 (1964) 1-5
  7. (Y. Kodama) On the genus of an n-connected graph. Fund. Math. 54 (1964) 7-13
  8. (O.A. Oeser) A mathematical model for structural role theory, II. Human Relations 17 (1964) 3-17
  9. (G. Prins, W.T. Tutte) The number of plane trees. Indag. Math. 26 (1964) 319-329
  10. (W.T. Tutte) The number of plane trees with a given partition. Mathematika 11 (1964) 99-101

1965

  1. Graph theory and group structure. Readings in Mathematical Psychology. (R.C. Luce, Ed.) Wiley, New York (1965) 225-241
  2. On minimally nonplanar graphs. Ann. Univ. Sci. Budapest, Eotvos Sect. Math. 8 (1965) 13-15
  3. (L.W. Beineke) The genus of the n-cube. Canad. J. Math. 17 (1965) 494-496
  4. (L.W. Beineke) Local restrictions for various classes of directed graphs. J. London Math. Soc. 40 (1965) 87-95
  5. (L.W. Beineke) Inequalities involving the genus of a graph and its thicknesses. Proc. Glasgow Math. Assoc. 7 (1965) 19-21
  6. (L.W. Beineke) The maximum number of strongly connected subtournaments. Canad. Math. Bull. 8 (1965) 491-498
  7. (L.W. Beineke) The thickness of the complete graph. Canad. J. Math. 7 (1965) 850-859
  8. (P. Erdos, W.T. Tutte) On the dimension of a graph. Mathematika 12 (1965) 118-122
  9. (N. Jessop, J. Luckman, J. Stringer) Analysis of interconnected decision areas: An algorithm for project development. Nature 206 (1965) 118
  10. (C.St.J.A. Nash-Williams) On eulerian and hamiltonian graphs and line-graphs. Canad. Math. Bull. 8 (1965) 701-709
  11. (E.M. Palmer) A note on similar points and similar lines of a graph. Rev. Roumaine Math. Pures Appl. 10 (1965) 1489-1492.
  12. (E.M. Palmer) The number of graphs rooted at an oriented line. ICC Bull. 4 (1965) 91-98
  13. (E.M. Palmer) The power group of two permutation groups. Proc. Nat. Acad. Sci. USA 54 (1965) 680-682
  14. (W.T. Tutte) A dual form of Kuratowski's theorem. Bull. Amer. Math. Soc. 71 (1965) 168; Canad. Math. Bull. 8 (1965) 17-20, 373
  15. (R.Z. Norman, D. Cartwright) Structural Models: An Introduction to the Theory of Directed Graphs. Wiley, New York (1965) 415 pp.

1966

  1. Merton revisited: A new classification for deviant behavior. American Sociological Review 31 (1966) 693-693
  2. Structural study of `A Severed Head.' Psychological Reports 19 (1966) 473-474
  3. The theory of tournaments: A miniature mathematical system. Colloq. Math. 15 (1966) 149-155
  4. (L.W. Beineke) Binary matrices with equal determinant and permanent. Studia Sci. Math. Hungar. 1 (1966) 179-183
  5. (L. Moser) The theory of round-robin tournaments. Amer. Math. Monthly 73 (1966) 231-246
  6. (O.A. Oeser) Role structures: A description in terms of graph theory. Role Theory: Concepts and Research (D. Biddle, E. Thomas, Eds.) Wiley, New York, (1966) 92-102
  7. (E.M. Palmer) Enumeration of locally restricted digraphs. Canad J. Math. 18 (1966) 853-860
  8. Enumeration of mixed graphs. Proc. Amer. Math. Soc. 17 (1966) 682-687
  9. (E.M. Palmer) Enumeration of self-converse digraphs. Mathematika 13 (1966) 151-157
  10. (E.M. Palmer) The groups of the small digraphs. J. Indian Statist Assoc. 4 (1966) 155-169
  11. (E.M. Palmer) On the number of orientations of a given graph. Bull. Acad. Polon. Sci. Ser. Sci. Math. Astronom. Phys. 14 (1966) 125-128
  12. (E.M. Palmer) The power group enumeration theorem. J. Combin. Theory 1 (1966) 157-173
  13. (E.M. Palmer) The reconstruction of a tree from its maximal subtrees. Canad. J. Math. 18 (1966) 803-810
  14. (E.M. Palmer) On similar points of a graph. J. Math. Mech. 15 (1966) 623-630
  15. (E.M. Palmer) The smallest graph whose group is cyclic. Czech. Math. J. 16 (1966) 70-71; 22 (1972) 180
  16. (M. Plummer) On the point-core of a graph. Math. Z. 94 (1966) 382-386
  17. (G. Prins) The block-cutpoint tree of a graph. Publ. Math Debrecen 13 (1966) 103-107
  18. (R. Read) The probability of a given 1-choice structure. Psychometrika 31 (1966) 271-278
  19. (C. Trauth) Connectedness of products of two directed graphs. SIAM J. Appl. Math. 14 (1966) 250-254
  20. (W.T. Tutte) On the order of the group of a planar map. J. Combin. Theory 1 (1966) 394-395

1967

  1. Applications of Polya's theorem to permutation groups. A Seminar on Graph Theory Holt, Rinehart and Winston, New York (1967) 25-33
  2. Enumeration of graphs and digraphs. A Seminar on Graph Theory Holt, Rinehart and Winston, New York (1967) 34-41
  3. Graphical enumeration problems. Graph Theory and Theoretical Physics (F. Harary, Ed.) Academic Press, London (1967) 1-41
  4. Graphical enumeration problems. (Russian Math. Surveys) Uspehi Mat. Nauk 24 (1967) 179-214 (translated by S.A. Sirokova)
  5. Graphical reconstruction. A Seminar on Graph Theory Holt, Rinehart and Winston, New York (1967) 18-20
  6. Graphs and matrices. SIAM Review 9 (1967) 83-90
  7. A proof of Polya's enumeration theorem. A Seminar on Graph Theory Holt, Rinehart and Winston, New York (1967) 21-24
  8. Some theorems and concepts of graph theory. A Seminar on Graph Theory Holt, Rinehart and Winston, New York (1967) 1-12
  9. Topological concepts in graph theory. A Seminar on Graph Theory Holt, Rinehart and Winston, New York (1967) 13-17
  10. (S.S. Anderson) Trees and unicyclic graphs. Math. Teacher 60 (1967) 305-314
  11. (A.T. Balaban) Chemical graphs IV: Dihedral groups and monocyclic aromatic compounds. Rev. Roumaine Chim. 12 (1967) 1511-1515
  12. (L.W. Beineke) The connectivity function of a graph. Mathematika 14 (1967) 197-202
  13. (L.W. Beineke, M.D. Plummer) On the critical lines of a graph. Pacific J. Math. 22 (1967) 205-212
  14. (G. Chartrand) Planar permutation graphs. Ann. Inst. H. Poincare 3B (1967) 433-438
  15. (J.W. Evans, M.S. Lynn) On the computer enumeration of fimite topologies. Comm. ACM 10 (1967) 295-298
  16. (R.K. Guy) On the mobius ladders. Canad. Math. Bull. 10 (1967) 493-496 .IP 15H. (R.K. Guy) Mobius letrakrol. Mat. Lapok 18 (1967) 59-60 (in Hungarian)
  17. (S.T. Hedetniemi, G. Prins) An interpolation theorem for graphical homomorphisms. Portugal. Math. 26 (1967) 453-462
  18. (R.M. Karp, W.T. Tutte) A criterion for planarity of the square of a graph. J. Combin. Theory 2 (1967) 395-405
  19. (E.M. Palmer) Enumeration of finite automata. Information and Control 10 (1967) 499-508
  20. (E.M. Palmer) The enumeration methods of Redfield. Amer. J. Math. 89 (1967) 373-384
  21. (E.M. Palmer) On the number of balanced signed graphs. Bull. Math. Biophysics 29 (1967) 759-765
  22. (E.M. Palmer) On the problem of reconstructing a tournament from subtournaments. Montash Math. 71 (1967) 14-23
  23. (E.M. Palmer, R.C. Read) The number of ways to label a structure. Psychometrika 32 (1967) 155-156
  24. (E.M. Palmer, C.A.B. Smith) Which graphs have only self-converse orientations? Canad. Math. Bull. 10 (1967) 425-429
  25. (M.D. Plummer) On the core of a graph. Proc. London Math. Soc. 17 (1967) 305-314
  26. (M.D. Plummer) On indecomposable graphs. Canad. J. Math. 19 (1967) 800-809
  27. (G. Wilcox) Boolean operations on graphs. Math. Scand. 20 (1967) 41-51

1968

  1. The cell growth problem and its attempted solutions. Beitrage zur Graphentheorie (H. Sachs, Ed.) Teubner, Leipzig (1968) 49-60
  2. (A.T. Balaban) Chemical graphs V: Enumeration and proposed nomenclature of benzenoid cata-condensed polycyclic aromatic compounds. Tetrahedron 24 (1968) 2505-2516
  3. (D. Cartwright) On colorings of signed graphs. Elem. Math. 23 (1968) 85-89
  4. (G.T. Chartrand) Graphs with prescribed connectivities. Theory of Graphs. (P.Erdos and G.Katona, Eds.) Academic Press, New York (1968) 61-63
  5. (D.P. Geller) Arrow diagrams are line digraphs. SIAM J. Appl. Math. 16 (1968) 1141-1145
  6. (E.M. Palmer) On acyclic simplicial complexes. Mathematika 15 (1968) 115-122
  7. (E.M. Palmer) On the automorphism group of a composite graph. Studia Sci. Math. Hungar. 3 (1968) 263-270
  8. (E.M. Palmer) On the point-group and line-group of a graph. Acta Math. Acad. Sci. Hungar. 19 (1968) 263-269

1969

  1. Determinants, permanents, and bipartite graphs. Math. Mag. 42 (1969) 146-148
  2. The four color conjecture and other graphical diseases. Proof Techniques in Graph Theory (F. Harary, Ed.) Academic Press, New York (1969) 1-9
  3. The Greek alphabet of "Graph Theory". Recent Progress in Combinatorics. (W.T. Tutte, Ed.) Academic Press, New York (1969) 13-20
  4. On the intersection number of a graph. Proof Techniques in Graph Theory (F. Harary, Ed.) Academic Press, New York (1969) 109-110
  5. (S.T. Hedetniemi, R.W Robinson) Uniquely colorable graphs. J. Combin. Theory 6 (1969) 264-270; 9 (1970) 221
  6. (B. Manvel) Trees. Scripta Math. 28 (1969) 327-333
  7. (A. Mowshowitz, J. Riordan) Labeled trees with unlabeled end-points. J. Combin. Theory 6 (1969) 60-64
  8. (E.M. Palmer) On the number of forests. Mat. Casopis Sloven. Akad. Vied. 19 (1969) 110-112
  9. (D.J.A. Welsh) Matroids versus graphs. Springer Lecture Notes Math. 110 (1969) 155-170

1970

  1. Covering and packing in graphs I. Annals N.Y. Acad. Sci. 175 (1970) 198-205
  2. Enumeration under group action: Unsolved problems in graphical enumeration IV. J. Combin. Theory 8 (1970) 1-11; 9 (1970) 221
  3. Graph theory as a structural model in the social sciences. Graph Theory and Its Applications. (B. Harris, Ed.) Academic Press, New York (1970) 1-16
  4. Problems involving graphical numbers. Combinatorial Mathematics and Its Applications. (P. Erdos et al., Eds.) North-Holland, Amsterdam 2 (1970) 625-635
  5. Variations on a theorem by Menger. SIAM Studies in Applied Mathematics 4 (1970) 112-121
  6. (A.T. Balaban, R.O. Davies, A. Hill, R. Westwick) Cubic identity graphs and planar graphs derived from trees. J. Austral. Math. Soc. 11 (1970) 207-215
  7. (A.T. Balaban, D. Farcasiu) Chemical graphs IX. Isotope-isomerism of multiply-labelled compounds. J. Labelled Compounds 6 (1970) 211-223
  8. (W.G. Brown) Extremal digraphs. Combinatorial Mathematics and Its Applications. (P. Erd\*"os et al., Eds.) North-Holland, Amsterdam (1970) 135-198
  9. (D. Cartwright) Ambivalence and indifference in generalizations of structural balance. Behavioral Sci. 15 (1970) 497-513
  10. (R. Frucht) On the corona of two graphs. Aequationes Math. 4 (1970) 322-325
  11. (R. Frucht) La corona de dos grafos. Scientia (Valparaiso) 36 (1970) 42-49 (in Spanish)
  12. (S.T. Hedetniemi) The achromatic number of a graph. J. Combin. Theory 8 (1970) 154-161
  13. (D. Hsiao) A formal system for information retrieval from files. Comm. Assoc. Comput. Mach. 13 (1970) 67-73
  14. (B. Lipstein, G. Styan) A matrix approach to nonstationary chains. Operations Research 18 (1970) 1168-1181
  15. (B. Manvel) The reconstruction conjecture for labeled graphs. Combinatorial Structures and Their Applications. (R.K. Guy, Ed.) Gordon and Breach, New York (1970) 131-146
  16. (A.H. Miller) A graph-theoretic approach to the analysis of international relations. J. Conflict Resolution 14 (1970) 57-63; 15 (1971) 122
  17. (A.H. Miller) On the measure of connectedness in a social group. General Systems 15 (1970) 1-13.
  18. (P.A. Ostrand) How cutting is a cutpoint? Combinatorial Structures and Their Applications. (R.K. Guy, Ed.) Gordon and Breach, New York (1970) 147-150
  19. (R.C. Read) The enumeration of tree-like polyhexes. Proc. Edinburgh Math. Soc. 17 (1970) 1-13

1971

  1. Aesthetic tree patterns in graph theory. Leonardo 4 (1971) 227-231
  2. The collaboration graph of mathematicians and a conjecture of Erdos. J. Recreational Math. 4 (1971) 212-213
  3. Demiarcs: An atomistic approach to relational systems and group dynamics. J. Mathematical Sociology 1 (1971) 195-205
  4. A graphical exposition of the Ising problem. J. Austral. Math. Soc. 12 (1971) 227-231
  5. Sparse matrices and graph theory. Large Sparse Sets of Linear Equations
  6. Two-couple transportation typology. General Systems 16 (1971) 213
  7. What are mathematical models and what should they be? Biometrie-Praximetrie 12 (1971) 1-16
  8. (A.T. Balaban) The characteristic polynomial does not uniquely determine the topology of a molecule. J. Chemical Documentation 11 (1971) 138-140
  9. (D.P. Geller) Connectivity in digraphs. Springer Lecture Notes Math. 186 (1971) 105-115
  10. (C. King, A. Mowshowitz, R.C. Read) Cospectral graphs and digraphs. Bull. London Math. Soc. 3 (1971) 321-328.
  11. (B. Manvel) On the number of cycles in a graph. Mat. Casopis Sloven. Akad. Vied. 21 (1971) 55-63
  12. (P.A. Ostrand) The cutting center theorem for trees. Discrete Math. 1 (1971) 7-18
  13. (A.J. Schwenk) Trees with hamiltonian square. Mathematika 18 (1971) 138-140
  14. (P. Stockmeyer) Planar composite graphs. An. Acad. Brasil. Ci. 43 (1971) 325-329

1972

  1. Recent results on generalized ramsey theory for graphs. Springer Lecture Notes Math. 303 (1972) 125-138
  2. The two-triangle case of the acquaintance graph. Math. Mag. 45 (1972) 130-135
  3. What are mathematical models and what should they be? Biometrie-Praximetrie 12 (1972) 3-18; reprinted Solstice 3 (1992)
  4. (V. Chvatal) Generalized ramsey theory for graphs. Bull. Amer. Math. Soc. 78 (1972) 423-426
  5. (V. Chvatal) Generalized ramsey theory for graphs II: Small diagonal numbers. Proc. Amer. Math. Soc. 32 (1972) 389-394
  6. (V. Chvatal) Generalized Ramsey theory for graphs III: Small off-diagonal numbers. Pacific J. Math. 41 (1972) 335-345
  7. (J. Fisher, R.L. Graham) A simpler counterexample to the reconstruction conjecture for denumerable graphs. J. Combin. Theory 12B (1972) 203-204
  8. (R. Havelock) Anatomy of a communication arc. Human Relations 25 (1972) 413-426
  9. (C. Holzmann) On the tree graph of a matroid. SIAM J. Appl. Math. 22 (1972) 187-193.
  10. (J. Krarup, A.J. Schwenk) Graphs suppressible to an edge. Canad. Math. Bull. 15 (1972) 201-204
  11. (B. Manvel) Reconstruction of square-celled animals. Bull. Soc. Math. Belg. 24 (1972) 375-379
  12. (P. O'Neil, R.C. Read, A.J. Schwenk) The number of trees in a wheel. Combinatorics. Institute for Mathematics and its Applications, Southend-on-Sea (1972) 155-163
  13. (P.F. Pickel) Two conjectures on finitely generated nilpotent groups. Glasnik Mat. 7 (1972) 31-33
  14. (M.J. Piff, D.J.A. Welsh) On the automorphism group of a matroid. Discrete Math. 2 (1972) 163-171
  15. (A.J. Schwenk) A new crossing number for bipartite graphs. Utilitas Math. 1 (1972) 203-209
  16. (A.J. Schwenk) Covering and packing in graphs II: Evolution of the path number of a graph. Graph Theory and Computing. (R.C. Read, Ed.) Academic Press, New York (1972) 39-45
  17. (A.J. Schwenk, R.L. Scott) On the reconstruction of countable forests. Publ. Inst. Math. (Beograd Press) 13 (1972) 39-42

1973

  1. On the history of the theory of graphs. New Directions in the Theory of Graphs. (F. Harary, Ed.) Academic Press, New York (1973) 1-17
  2. Typographs. Visible Language 7 (1973) 199-208
  3. (V. Chvatal) Generalized ramsey theory for graphs I: Diagonal numbers. Periodica Math. Hungar. 3 (1973) 115-124
  4. (P.C. Kainen, A.J. Schwenk) Toroidal graphs with arbitrarily high crossing numbers. Nanta Math. 6 (1973) 58-67
  5. (P.C. Kainen, A.J. Schwenk, A.T. White) A maximal toroidal graph which is not a triangulation. Math. Scand. 33 (1973) 108-112
  6. (J. Krarup) A class of planar graphs related to nonserial dynamic programming. J. Mgmt. Sci. Appl. Cybernetics 2 (1973) 17-34
  7. (E.M. Palmer) A survey of graphical enumeration problems. A Survey of Combinatorial Theory. (J. Srivastava, Ed.) North-Holland, Amsterdam (1973) 259-275
  8. (A.J. Schwenk) On the number of unique subgraphs. J. Combin. Theory. 15B (1973) 156-160
  9. (A.J. Schwenk) The no-touch puzzle and graphical complementation. J. Recreational Math. 6 (1973) 284-286
  10. (A.J. Schwenk) The number of caterpillars. Discrete Math. 6 (1973) 359-365
  11. (E.M. Palmer) Graphical Enumeration. Academic Press, New York (1973) 271 pp.

1974

  1. Graphs as designs. Basic Questions of Design Theory (W. Spillers, Ed.) North-Holland, Amsterdam (1974) 395-404
  2. New directions in graph theory. Proc. Conf. Mathematical Education and New Areas in Math. South East Asian Math. Soc., Penang (1974) 25-33
  3. Recent results on graphical enumeration. Springer Lecture Notes Math. 406 (1974) 29-36
  4. Recent results on trees. Springer Lecture Notes Math. 406 (1974) 1-9
  5. A survey of generalized ramsey theory. Springer Lecture Notes Math. 406 (1974) 10-17
  6. A survey of the reconstruction conjecture. Springer Lecture Notes Math. 406 (1974) 18-28
  7. (H.J. Fleischner, D.P. Geller) Outerplanar graphs and weak duals. J. Indian Math. Soc. 38 (1974) 215-219
  8. (R. Frucht) Self-complementary generalized orbits of a permutation group. Canad. Math. Bull. 17 (1974) 203-208, 427
  9. (P. Hell) Generalized ramsey theory for graphs V: The ramsey number of a digraph. Bull. London Math. Soc. 6 (1974) 175-182; 7 (1975) 87-88
  10. (C. Holzmann) Line graphs of bipartite graphs. Revista de la Sociedad Matematica de Chile 1 (1974) 19-22
  11. (A. Lempel) On clique-extremal (p,q)-graphs. Networks 4 (1974) 371-378
  12. (R.B. Mallion) An elementary necessary condition for hamiltonian graphs involving connectivity. Nanta Math. 7 (1974) 96-101; 8 (1975) 104
  13. (G. Prins) Generalized ramsey theory for graphs IV: The ramsey multiplicity of a graph. Networks 4 (1974) 163-173
  14. (R.C. Read) Is the null graph a pointless concept? Springer Lecture Notes Math. 406 (1974) 37-44
  15. (R.W. Robinson) Tapeworms. Rev. Belge Stat. Rech. Op. Inform. 14 (1974) 1-4
  16. (A.J. Schwenk) Efficiency of dissemination of information in one-way and two-way communication networks. Behavioral Sci. 19 (1974) 133-135
  17. (A.J. Schwenk) The communication problem on graphs and digraphs. J. Franklin Institute 297 (1974) 491-495
  18. (A.J. Schwenk) Which graphs have integral spectra? Springer Lecture Notes Math. 406 (1974) 45-51

1975

  1. The foremost open problems in generalized ramsey theory. Congressus Numerantium 15 (1975) 269-282
  2. Four difficult unsolved problems in graph theory. Recent Advances in Graph Theory. (M. Fiedler, Ed.) Academia, Prague (1975) 249-256
  3. Le graphe de `La Nuit des Rois'. Math. Sci. Humaines 51 (1975) 77-80
  4. On minimal feedback vertex sets of a digraph. IEEE Trans. Circuits and Systems CAS-22 (1975) 839-840
  5. (M. Behzad) On the problem of characterizing digraphs with solutions and kernels. Bull. Iranian Math. Soc. 3 (1975) 3-13
  6. (B. Bollobas) Point arboricity critical graphs exist. J. London Math. Soc. 12 (1975) 97-102
  7. (A. Goldner) Note on a smallest nonhamiltonian maximal planar graph. Bull Malaysian Math. Soc. 6.1 (1975) 41-42; 6.2 (1975) 33; 8 (1977) 104-106.
  8. (A. Mowshowitz) Enumeration of end-labeled trees. Fibonacci Quart. 13 (1975) 252-254
  9. (E.M. Palmer, R.C. Read) On the cell-growth problem for arbitrary polygons. Discrete Math. 11 (1975) 371-389
  10. (R.W. Robinson) The number of achiral trees. J. reine angew. Math. 278 (1975) 322-335
  11. (R.W. Robinson, A.J. Schwenk) Twenty-step algorithm for determining the asymptotic number of trees of various species. J. Austral. Math. Soc. 20A (1975) 483-503; 41A (1986) 325

1976

  1. Comments on Rosengren's paper "Malinowski's Magic." Current Anthropology 17 (1976) 677
  2. An exposition of graph theory. Chemical Applications of Graph Theory. (A.T. Balaban, Ed.) Academic Press, London (1976) 5-9
  3. An exposition of the reconstruction conjecture for graphs. Bull. Malaysian Math. Soc. 7 (1976) 1-7
  4. The foremost open problems in generalized ramsey theory. Congressus Numerantium 15 (1976) 269-282
  5. A mathematical approach to nonfigurative modular pictures. Leonardo 9 (1976) 215-216
  6. (A.T. Balaban) Early history of the interplay between graph theory and chemistry. Chemical Applications of Graph Theory. (A.T. Balaban, Ed.) Academic, London (1976) 1-4
  7. (A.T. Balaban, R.W. Robinson) The numbers of chiral and achiral alkanes and monosubstituted alkanes. Tetrahedron 32 (1976) 355-361
  8. (F. Boesch) Line removal algorithms for graphs and their degree lists. IEEE Trans. Circuits and Systems CAS-23 (1976) 778-782
  9. (B. Bollobas) Extremal graphs with given diameter and connectivity. Ars Combinatoria 1 (1976) 281-296
  10. (G. Chartrand, D.R. Lick) Maximal point-arboritic graphs. Utilitas Math. 9 (1976) 259-262
  11. (A.K. Dewdney) The adjacency graphs of a complex. Czechoslovak Math. J. 26 (1976) 137-144
  12. (R.A. Duke) Generalized ramsey theory VI: Ramsey numbers for small plexes. J. Austral. Math. Soc. 22A (1976) 400-410
  13. (H. Harborth) Extremal animals. J. Combin. Inform. System Sci. 1 (1976) 1-8
  14. (R.A. Melter) On the metric dimension of a graph. Ars Combinatoria 2 (1976) 191-195; 4 (1977) 318
  15. (H. Minc) Which nonnegative matrices are self-inverse? Math. Mag. 49 (1976) 91-92
  16. (E.M. Palmer, R.C. Read, R.W. Robinson) Polya's contributions to chemical enumeration. Chemical Applications of Graph Theory. (A.T. Balaban, Ed.) Academic Press, London (1976) 11-24
  17. (D.F. Robinson) Using digraphs in planning lessons. New Zealand Math. Mag. 13 (1976) 106-112
  18. (J. Rockey) The city is not a semilattice either. Environment and Planning 8B (1976) 375-384
  19. (R.H. Rosen) On the planarity of 2-complexes. Colloq. Math. 36 (1976) 101-108
  20. (A.J. Schwenk) On tactical configurations with no four-cycles. J. Combin. Theory 20A (1976) 371-374
  21. (C. Thomassen) Anticritical graphs. Math. Proc. Cambridge Philos. Soc. 79 (1976) 11-18

1977

  1. Graphing conflict in international relations. Papers Peace Sci. Soc. Intl. 27 (1977) 1-9
  2. Homage to George Polya. J. Graph Theory 1 (1977) 289-290
  3. A note of welcome. South East Asian Bull. Math. 1 (1977) 1-2
  4. On `The Tantalizer' and `Instant Insanity." Historia Math. 4 (1977) 205-206
  5. (A.T. Balaban, E.M. Palmer) Chemical graphs XXIX: Numbers of isomers with naphthalene and adamantane skeletons. Revue Roumaine de Chimie 22 (1977) 517-523
  6. (M. Behzad) Which directed graphs have a solution? Math. Slovaca 27 (1977) 37-42
  7. (S.A. Burr) The ramsey number of many stars and one triangle. Ars Combinatoria 4 (1977) 119-122
  8. (D. Cartwright) A graph theoretic approach to the investigation of system-environment relationships. J. Math. Sociology 5 (1977) 87-111
  9. (A.K. Dewdney) On the chromatic numbers of a simplicial complex. J. Combin. Inform. System Sci. 2 (1977) 28-35
  10. (D. Hsu, Z. Miller) The bichromaticity of a lattice graph J. Austral. Math. Soc. 23A (1977) 354-359
  11. (D. Hsu, Z. Miller) The biparticity of a graph. J. Graph Theory 1 (1977) 131-133
  12. (P. Kainen) On triangular colorings of a planar graph. Bull. Calcutta Math. Soc. 69 (1977) 393-395
  13. (Z. Miller) On point-symmetric and arc-symmetric digraphs. Nanta Math. 10 (1977) 50-52
  14. (A. Mowshowitz, A.J. Schwenk) Line minimal boolean forests. Colloq. Math. 37 (1977) 167-173
  15. (G.E. O'Brien) Measurement of the interactive effects of leadership style and group structure upon group performance. Austral. J. Psychol. 29 (1977) 59-71
  16. (E.M. Palmer, R.W. Robinson, A.J. Schwenk) Enumeration of graphs with signed points and lines. J. Graph Theory 1 (1977) 295-308
  17. (R.W. Robinson) Exposition of the enumeration of point-line-signed graphs. Proceedings of the Second Caribbean Conference in Combinatorics and Computing. (R.C. Read, Ed.) University of the West Indies, Bridgetown, Barbados (1977) 19-33
  18. (R.W. Robinson, M.C. Wormald) The divisibility theorem for isomorphic factorizations of complete graphs. J. Graph Theory 1 (1977) 187-188
  19. (W.D. Wallis) Isomorphic factorizations II: Combinatorial designs. Congressus Numerantium 19 (1977) 13-28

1978

  1. From Euler's partitions to Cayley's rooted trees via P\*'olya's picture - writing. Bull. Malaysian Math. Soc. 1 (1978) 17-24
  2. (M.F. Batell) The concept of negative information. Behavioral Sci. 23 (1978) 264-270.
  3. (L.W. Beineke) Consistency in marked digraphs. J. Math. Psych. 18 (1978) 260-269.
  4. (L.W. Beineke) Consistent graphs with signed points. Riv. Mat. Sci. Econom. Social. 1 (1978) 81-88
  5. (F.T. Boesch) Unicyclic realizability of a degree list. Networks 8 (1978) 93-96
  6. (P. Hafner) Cutpoints in the conjunction of two graphs. Archiv. Math. (Basel) 31 (1978) 177-181
  7. (K. Heinrich, W.D. Wallis) Decomposition of complete symmetric digraphs into the four oriented quadilaterals. Springer Lecture Notes Math. 686 (1978) 165-173
  8. (D. Hsu, Z. Miller) The bichromaticity of a tree. Springer Lecture Notes Math. 642 (1978) 236-246
  9. (J.A. Kabell) Extremal graphs with given connectivities. South East Asian Bull. Math. 2 (1978) 101-102
  10. (H. Kommel) Matrix measures for transitivity and balance. J. Math. Sociology 6 (1978) 199-210
  11. (L. March, R.W. Robinson) On enumerating certain design problems in terms of bicoloured graphs with no isolates. Environment and Planning 5 B (1978) 31-43
  12. (R.W. Robinson, N.C. Wormald) Isomorphic factorizations I: Complete graphs. Trans. Amer. Math. Soc. 242 (1978) 243-260
  13. (R.W. Robinson, N.C. Wormald) Isomorphic factorizations III: Complete multipartite graphs. Springer Lecture Notes Math. 686 (1978) 47-54
  14. (R.W. Robinson, N.C. Wormald) Isomorphic factorizations V: Directed graphs. Mathematika 25 (1978) 279-285
  15. (A.J. Schwenk) Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks. Networks 8 (1978) 209-216
  16. (W.D. Wallis) Isomorphic factorizations II: Combinatorial designs. Congressus Numerantium 19 (1978) 13-28

1979

  1. The explosive growth of graph theory. Ann. New York Acad. Sci. 328 (1979) 5-11
  2. Generalized ramsey theory for graphs XI: Which numbers are graphical? Nanta Math. 12 (1979) 117-124
  3. Independent discoveries in graph theory. Ann. New York Acad. Sci. 328 (1979) 1-4
  4. Some theorems about graphs from social sciences. Congressus Numerantium 26 (1979) 41-47
  5. The structure of threshold graphs. Riv. Mat. Sci. Econom. Social. 2 (1979) 169-172
  6. (J. Akiyama) A graph and its complement with specified properties I: Connectivity. Internat. J. Math. Math. Sci. 2 (1979) 223-228
  7. (J. Akiyama) A graph and its complement with specified properties II: Unary operations. Nanta Math. 12 (1979) 110-116
  8. (J. Akiyama) A graph and its complement with specified properties III: Girth and circumference. Internat. J. Math. Math. Sci. 2 (1979) 685-692
  9. (J. Akiyama, G. Exoo) The graphs with all induced subgraphs isomorphic. Bull. Malaysian Math. Soc. 2 (1979) 43-44
  10. (A. Blass) Properties of almost all graphs and complexes. J. Graph Theory 3 (1979) 225-240
  11. (D. Cartwright) Balance and clusterability: An overview. Perspectives on Social Network Research. (J. Holland, S. Leinhardt, Eds.) Academic Press, New York (1979) 25-50
  12. (G. Exoo) The smallest regular graphs with irregular square. South East Asian Bull. Math. 3 (1979) 44-48
  13. (O. Frank) Balance in stochastic signed graphs. Social Networks 2 (1979) 155-163
  14. (J.W. Grossman, M. Klawe) Generalized ramsey theory for graphs X: Double stars. Discrete Math. 28 (1979) 247-254
  15. (M. Grotschel) The graphs for which all strong orientations are hamiltonian. J. Graph Theory 3 (1979) 221-223
  16. (J.A. Kabell) Graphical conflict I: A new class of extremal problems. Ann. New York Acad. Sci. 319 (1979) 265-269
  17. (H.J. Kommel) The graphs with only self-dual signings. Discrete Math. 26 (1979) 235-241
  18. (J.M. Kornprobst) Theorie des graphes et terpenes: Enumeration des terpenes monocycliques regulieres. Match 5 (1979) 177-195
  19. (E.M. Palmer) Orbits in random trees. Annals N.Y. Acad. Sci. 319 (1979) 574-575
  20. (E.M. Palmer) The probability that a point of a tree is fixed. Math. Proc. Cambridge Philos. Soc. 85 (1979) 407-415
  21. (R.W. Robinson) Generalized ramsey theory IX: Isomorphic factorizations IV: Isomorphic ramsey numbers. Pacific J. Math. 80 (1979) 435-441
  22. (R.W. Robinson) Labeled bipartite blocks. Canad. J. Math. 31 (1979) 60-68
  23. (A.J. Schwenk) The spectral approach to determining the number of walks in a graph. Pacific J. Math. 80 (1979) 443-449
  24. (W.T. Trotter) On double and multiple interval graphs. J. Graph Theory 3 (1979) 205-211
  25. (M. Truzzi) The graph of the zodiac: On the persistence of the quasiscientific paradigm of astrology. J. Combin. Inform. System Sci. 4 (1979) 147-160

1980

  1. Adventures with ramsey theory. Graph and Combinatorics III. (M. Iri, Ed.) Kyoto University, Kyoto (1980) 234-248
  2. Graph theoretic models. Theoret. Comput. Sci. 11 (1980) 117-121
  3. (J. Akiyama, G. Exoo) Covering and packing in graphs III: Cyclic and acyclic invariants. Math. Slovaca 30 (1980) 405-417
  4. (J. Akiyama, G. Exoo) A graph and its complement with specified properties V: The self-complement index. Mathematika 27 (1980) 64-68
  5. (A. Blass, Z. Miller) Which trees are link graphs? J. Combin. Theory 29B (1980) 277-292
  6. (W. Bouwsma) On the color partitions of a graph. Elem. Math. 35 (1980) 49-55
  7. (R.A. Brualdi, Z. Miller) Bigraphs versus digraphs via matrices. J. Graph Theory 4 (1980) 51-73
  8. (W. Dorfler, G. Malle) Covers of digraphs. Math. Slovaca 30 (1980) 269-280
  9. (P. Erdos, M. Klawe) Residually complete graphs. Ann. Discrete Math 6 (1980) 117-123
  10. (F. Esser) Digraphs with real and gaussian spectra. Discrete Appl. Math 2 (1980) 113-124
  11. (F. Esser) On the spectrum of a complete multipartite graph. European J. Combin. 1 (1980) 211-218
  12. (G. Exoo) Step graphs. J. Combin. Inform. System. Sci. 5 (1980) 52-53
  13. (G. Exoo) The smallest graphs with certain adjacency properties. Discrete Math 29 (1980) 25-32
  14. (O. Frank) Maximum triad counts in graphs and digraphs. J. Combin. Inform. System Sci. 5 (1980) 1-9
  15. (J.L. Gross) Some problems in topological graph theory. J. Graph Theory 4 (1980) 253-263
  16. (J.A. Kabell) A simple algorithm to detect balance in signed graphs. Math. Social Sci. 1 (1980) 131-136
  17. (J.A. Kabell) An intuitive approach to interval numbers of graphs. Math. Mag. 53 (1980) 39-44
  18. (J.A. Kabell) Monotone sequences of graphical invariants. Networks 10 (1980) 273-275
  19. (G. McNulty) The orbital partition of a graph. J. Combin. Inform. System Sci. 5 (1980) 131-133
  20. (R.W. Robinson, N.C. Wormald) Clarification of a tripartite conjecture. Graph Theory Newsletter 9 (1980) 14.
  21. (D. Sumner) The dichromatic number of an oriented tree. J. Combin. Inform. System Sci. 5 (1980) 184-187
  22. (A. Vince) Graphical completions of a sequence. SIAM J. Appl. Math. 38 (1980) 402 .bp

1981

  1. Achievement and avoidance games designed from theorems. Rend. Sem. Mat. Fis. Milano 51 (1981) 163-172
  2. Generalized ramsey theory I to XIII. The Theory and Applications of Graphs. (G. Chartrand et al., Eds.) Wiley, New York (1981) 373-390
  3. Homage to the memory of Kazimierz Kuratowski. J. Graph Theory 5 (1981) 217-219
  4. Structural models and graph theory. Computer-Assisted Analysis and Model Simplification. (J. Maybee, Ed.) Academic Press, New York (1981) 31-58
  5. (J. Akiyama) A graph and its complement with specified properties IV: Counting self-complementary blocks. J. Graph Theory 5 (1981) 103-107
  6. (J. Akiyama) A graph and its complement with specified properties VII: A survey. The Theory and Applications of Graphs. (G. Chartrand et al, Eds.) Wiley, New York (1981) 1-12
  7. (J. Akiyama, F. Boesch, H. Era, R. Tindell) The cohesiveness of a point of a graph. Networks 11 (1981) 65-68
  8. (J. Akiyama, G. Exoo) Covering and packing in graphs IV: Linear arboricity. Networks 11 (1981) 69-72
  9. (M.F. Batell) Communication conflict. Human Relations 34 (1981) 633-641
  10. (M.F. Batell) What is a system? Social Networks 3 (1981) 29-40
  11. (A. Blass) Degree sequences of infinite graphs. J. London Math. Soc. 23 (1981) 10-16
  12. (A. Blass, G. Exoo) Paley graphs satisfy all first-order adjacency axioms. J. Graph Theory 5 (1981) 435-439
  13. (F. Boesch, J.A. Kabell) Graphs as models of communication network vulnerability: Connectivity and persistence. Networks 11 (1981) 57-63
  14. (R. Bosserman) Demiarcs, creaons and genons. J. Theoret. Biology 92 (1981) 241-254
  15. (A.K. Dewdney) Oriented two-dimensional circuits. Discrete Math. 33 (1981) 149-162
  16. (P.G. Eitner) The number of bridges and cutpoints in a cubic graph. Pi Mu Epsilon J. 7 (1981) 242-247
  17. (F. Esser) The pairing theorem for digraph spectra. Bull. Malaysian Math. Soc. 4 (1981) 17-19
  18. (G. Exoo, J. Kabell) The crossing numbers of some generalized Petersen graphs. Math. Scand. 48 (1981) 184-188
  19. (M. Gardner) Characterization of (r,s)-adjacency graphs of complexes. Proc. Amer. Math. Soc. 83 (1981) 211-214; 86 (1982) 188
  20. (P. Hage) Mediation and power in Melanesia. Oceania 52 (1981) 124-135
  21. (P. Hage) Pollution beliefs in Highland New Guinea. Man 16 (1981) 367-375
  22. (H. Harborth, I. Mengersen) Generalized ramsey theory for graphs XII: Bipartite ramsey sets. Glasgow Math. J. 22 (1981) 31-41
  23. (J.A. Kabell) Counting balanced signed graphs using marked graphs. Proc. Edinburgh Math. Soc. 24 (1981) 99-104
  24. (D.B. Leep) Angles in graphs. Two-Year College Math. Readings. Math. Assoc. Amer., Washington (1981) 62-74
  25. (B. Lindstrom) On balance in signed matroids. J. Combin. Inform. System Sci. 6 (1981) 123-128
  26. (J. Nieminen) Convexity in graphs. J. Differential Geometry 16 (1981) 185-190
  27. (R. Tindell) Every forest can be obtained from a minimal block. J. reine angew. Math. 323 (1981) 88-100
  28. (M.S. Weisbach) Dots avoidance. J. Recreational Math. 13 (1981) 177-180

1982

  1. Achievement and avoidance games for graphs. Annals Discrete Math. 13 (1982) 111-119
  2. Achieving the Skinny animal. Eureka 42 (1982) 8-14; 43 (1983) 1-2
  3. Changing and unchanging invariants for graphs. Bull. Malaysian Math. Soc. 5 (1982) 73-78
  4. Homage to Roberto Frucht. J. Graph Theory 6 (1982) 97-99
  5. Oedipus loves his mother. Behavioral Science 27 (1982) 162-163
  6. Variations on the Golden Rule. Behavioral Science 27 (1982) 155-161
  7. (T. Asano, G. Exoo, N. Saito) The smallest 2-connected cubic bipartite planar nonhamiltonian graph. Discrete Math. 38 (1982) 1-6
  8. (A. Blass) Deletion versus alteration in finite structures. J. Combin. Inform. System Sci. 7 (1982) 139-142
  9. (B. Bollobas) The trail number of a graph. Annals Discrete Math. 13 (1982) 51-60
  10. (G. Chartrand, J. Cooper, F. Saba, C. Wall) Smallest cubic and quartic graphs with a given number of cutpoints and bridges. International J. Math. Sci. 5 (1982) 41-48
  11. (G. Exoo) The forcibly-tree and forcibly-unicyclic degree sequences. Elem. Math. 37 (1982) 41-43
  12. (G. Exoo) The smallest cubic multigraphs with prescribed bipartite, block, hamiltonian and planar properties. Indian J. Pure Appl. Math. 13 (1982) 309-312
  13. (O. Frank) Cluster inference by using transitivity indices in empirical graphs. J. Amer. Statist. Asoc. 77 (1982) 835-840
  14. (O. Frank, M. Plantholt) The line-distinguishing chromatic number of a graph. Ars Combin. 14 (1982) 241-252
  15. (G. Gati, R. Robinson) Line colored trees with extendable automorphisms. Acta Math. Sci.(China) 2 (1982) 105-110
  16. (P. Hage) On reciprocity in kinship relations. Cambridge Anthropology 9 (1982) 39-43
  17. (C. Hoede, D. Kadlecek) Graph valued functions related to step graphs. J. Combin. Inform. System Sci. 7 (1982) 231-245
  18. (J. Kabell, F. McMorris) Bipartite intersection graphs. Comment. Math. Univ. Carolin. 23 (1982) 739-745
  19. (P. Kovacs) The smallest graphs with prescribed odd and even girth. Caribbean J. Math. 1 (1982) 24-26
  20. (B. Lindstrom, H.O. Zetterstrom) On balance in group graphs. Networks 12 (1982) 317-321
  21. (V. Malyshko) Methods and programs for solving optimization problems on graphs and networks. Siberian Branch Acad. Sci. USSR, Novosibirsk (1982)
  22. (R.A. Melter) The graphs with all triangles equilateral. Gazeta Mat. 11 (1982) 182-183; Math. Student 43 (1975) 425-427 (1982)
  23. (R.A. Melter, U.N. Peled, I. Tomescu) Boolean distance for graphs. Discrete Math. 39 (1982) 123-127
  24. (M. Plantholt, R. Statman) The graph isomorphism problem is polynomially equivalent to the legitimate deck problem for regular graphs. Carribbean J. Math. 1 (1982) 15-23
  25. (A. Vince, D. Worley) A point-symmetric graph that is nowhere reversible. SIAM J. Algebraic Discrete Methods 3 (1982) 285-287
  26. (M. Weisbach) Polycube achievement games. J. Recreational Math. 15 (1982) 254-259

1983

  1. Achievement and avoidance games on finite configurations. J. Recreational Math. 16 (1983) 182-187
  2. An achievement game on a toroidal board. Springer Lecture Notes Math. 1018 (1983) 55-59
  3. Conditional connectivity. Networks 13 (1983) 347-357
  4. Consistency theory is alive and well. Personality and Social Psychology Bulletin 9 (1983) 60-64
  5. From dots and boxes to maps and regions, and beyond. J. Recreational Math. 6 (1983) 22-32
  6. Maximum versus minimum invariants for graphs. J. Graph Theory 7 (1983)275-284
  7. In praise of Paul Erdos on his seventieth. J. Graph Theory 7 (1983) 385-390
  8. A tribute to Frank P. Ramsey, 1903-1930. J. Graph Theory 7 (1983) 1-7
  9. (J. Akiyama) The regulation number of a graph. Publ. Math. Inst. (Beograd) 34 (1983) 3-5
  10. (J. Akiyama, H. Era) Regular graphs containing a given graph. Elem. Math. 38 (1983) 15-17
  11. (J. Akiyama, P. Ostrand) A graph and its complement with specified properties VI: Chromatic and achromatic numbers. Pacific J. Math. 104 (1983) 15-27
  12. (J. Barnes) Graph theory in network analysis. Social Networks 5 (1983) 235-244
  13. (D. Bauer, J. Nieminen, C.L. Suffel) Domination alteration sets in graphs. Discrete Math. 47 (1983) 153-161
  14. (L. Eggan) On the structure of a triangle-free infinite-chromatic graph of Gyarfas. Internat. J. Math. & Math. Sci. 6 (1983) 279-283
  15. (M. Erickson) Picasso animal achievement games. Bull. Malaysian Math. Soc. 6 (1983) 37-44
  16. (G. Exoo) Extremal graphs of small girth with an adjacency property. Utilitas Math. 23 (1983) 245-252
  17. (I. Gutman) Generalizations of the matching polynomial. Utilitas Math. 24 (1983) 97-106
  18. (P. Hage) Arapesh sexual symbolism, primitive thought and boolean groups. L'Homme 23 (1983) 57-77
  19. (E. Harzheim) The degree sets of connected infinite graphs. Fund. Math. 118 (1983) 233-236
  20. (P. Kov\*'acs) Regular graphs with given girth pair. J. Graph Theory 7 (1983) 209-218
  21. (C. Leary) Latin square achievement games. J. Recreational Math. 16 (1983) 241-246
  22. (V. Malyshko) Placement methods: A survey of recent results. Automation of Computer and System Projection Erevan, USSR (1983)
  23. (V. Malyshko) Mathematical methods in operational research. Inst. Math. Bulgar. Acad. Sci. Sofia (1983)
  24. (Z. Miller) Generalized ramsey theory VIII: The size ramsey number of small graphs. Studies in Pure Mathematics: To the Memory of Paul Turan. (P. Erdos et al, Eds.) Akademiai Kiado, Budapest (1983) 271-283
  25. (R.J. Mokken, M. Plantholt) Interpolation theorem for diameters of spanning trees. IEEE Trans. Circuits and Systems CT-30 (1983) 429-432
  26. (J. Nesetril, V. Rodl) Generalized ramsey theory for graphs XIV: Induced ramsey numbers. Graphs and Other Combinatorial Topics. (M. Fiedler, Ed.) Teubner, Leipzig (1983) 90-100
  27. (M. Plantholt) The derived signed graph of a digraph. Exposition Math. 1 (1983) 343-347
  28. (M. Plantholt) Extremal values for chromatic invariants. Matematiche (Catania) 38 (1983) 65-72
  29. (M. Plantholt) Graphs with the line-distinguishing chromatic number equal to the usual one. Utilitas Math. 23 (1983) 201-207
  30. (B. Sagan, D. West) Computer-aided analysis of monotonic sequence games. Atti. Accad. Peloritana Pericolanto Cl. Sci. Fis. Mat. Natur. 61 (1983) 67-78
  31. (P. Hage) Structural Models in Anthropology. Cambridge University Press, Cambridge (1983) 201 pp.

1984

  1. Achievement and avoidance games on finite configurations with one color. J. Recreational Math. 17 (1984) 253-260
  2. Convexity in graphs: Achievement and avoidance games. Annals Discrete Math. 20 (1984) 323
  3. Four unresolved graph theoretic games. New York Graph Theory Day VII. New York Acad. Sci. (12 May 1984) 10-13
  4. General connectivity. Springer Lecture Notes Math. 1073 (1984) 83-92
  5. On the structure of international disdain. Psychological Reports 5 (1984) 672
  6. (J. Akiyama, K. Ando) A graph and its complement with specified properties VIII: Interval graphs. Math. Japon. 29 (1984) 659-670
  7. (F. Buckley) Diameter avoidance games for graphs. Bull. Malaysian Math. Soc. 7 (1984) 29-33
  8. (D. DeTemple, J. Robertson) Existential partition graphs. J. Combin. Inform. System Sci. 9 (1984) 193-196
  9. (M. Erickson) A game from Sperner's lemma. J. Recreational Math. 17 (1984) 42-48
  10. (M. Erickson) Generalized ramsey theory XV: Achievement and avoidance games for bipartite graphs. Springer Lecture Notes Math. 1073 (1984) 212-216
  11. (G. Exoo) Smallest cubic graphs with prescribed properties. South East Asian Bull. Math. 8 (1984) 1-4
  12. (M. Iri) Generalized ramsey theory for graphs XVI: Reduced ramsey numbers. Boll. Un. Mat. Ital. A3 (1984) 1-6
  13. (J. Kabell) Infinite-interval graphs. Calcutta Math. Soc. Diamond-cum-platinum jubilee commemoration volume (1908-1983), (1984) 27-31
  14. (R. Karabed) Regular digraphs containing a given digraph. Canad. Math. Bull. 27 (1984) 129-133
  15. (R.A. Melter, I. Tomescu) Digital metrics: A graph theoretical approach. Pattern Recognition Letters 2 (1984) 159-163
  16. (R.W. Robinson) Connect-it games. College Math. J. 15 (1984) 411-419
  17. (R.W. Robinson) Isomorphic factorizations VIII: Bisectable trees. Combinatorica 4 (1984) 169-179
  18. (R.W. Robinson) The rediscovery of Redfield's papers. J. Graph Theory 8 (1984) 191-193
  19. (B. Sagan) Signed posets. Calcutta Math. Soc. Diamond-cum-platinum jubilee commemoration volume (1908-1983), (1984) 3-10
  20. (R. Schmidt) Realization of graph regulation numbers. Proceedings Fourth Yugoslav Seminar on Graph Theory. University of Novi Sad (1984) 161-166

1985

  1. Academic roots. Math. Intelligencer 7 (1985) 77-79
  2. Arithmetic progression achievement and avoidance games. Menemui Mat. 7 (1985) 105-113
  3. Conditional colorability in graphs. Graphs and Applications. (F. Harary, J. Maybee, Eds.) Wiley, New York (1985) 127-136
  4. Graph theoretic approaches to finite mathematical structures. Graph Theory with Applications to Algorithms and Computer Science. (Y. Allavi, Ed.?) Wiley, New York (1985) 401-411
  5. The knots and links of Albrecht Durer. Atti Accad. Pontaniana 34 (1985) 97-106
  6. The love-hate structure of Dangerous Corner. Semiotica 54 (1985) 387-393
  7. Petersen's graph and its unique properties. Normat (Translated by B. Toft into Danish) 33 (1985) 113-118
  8. The reconstruction conjecture for balanced signed graphs. Annals Discrete Math. 115 (1985) 439-442
  9. Which unicycles are interval graphs? Bull. Bombay Math. Colloq. 3 (1985) 1-5
  10. (D. Archdeacon, J. Dinitz) Orthogonal edge colorings of graphs. Congressus Numerantium 47 (1985) 49-67
  11. (A. Blass, G. Exoo) Outlinks and inlinks in digraphs. Riv. Mat. Univ. Parma 11 (1985) 181-186
  12. (F. Buckley) Closed geodetic games for graphs. Congressus Numerantium 47 (1985) 131-138
  13. (G. Chartrand, O. Oellermann) On the regulation number of a multigraph. Graphs Combin. 1 (1985) 137-144
  14. (D.A. Diny, F.R. McMorris) A survey of results on a graph and its complement with specified hereditary properties. Ars. Combin. 20B (1985) 193-205
  15. (K. Gustafson) The curl of graphs and networks. Math. Modelling 6 (1985) 145-155
  16. (P. Hage) Graph theory. The Social Science Encyclopedia Routledge & Kegan Paul, London (1985) 342-343
  17. (H. Harborth) Achievement and avoidance games with triangular animals. J. Recreational Math. 8 (1985) 110-115
  18. (M. Iri) Generalized ramsey theory for graphs XVI: Reduced ramsey numbers. Boll. Un. Mat. Ital. 4A (1985) 13-18
  19. (K.F. Jones) Conditional colorability II: Bipartite variations. Congressus Numerantium 50 (1985) 205-218
  20. (J. Joyce) Some graph theoretic models in literary and linguistic research. Assoc. Literary & Linguistics Comput. Journal 5 (1985) 36-39
  21. (E. Kolasinska, M. Syslo) Cycle basis interpolation theorems. Annals Discrete Math. (1985) 369-379
  22. (J. Lundgren, J. Maybee) On signed digraphs with all cycles negative. Discrete Appl. Math. 12 (1985) 155-164
  23. (F.R. McMorris) Some impossibility theorems and the consensus problem for graphs. Graphs and Applications. (F. Harary, J. Maybee, Eds.) Wiley, New York (1985) 137-145
  24. (M. Plantholt) The graph reconstruction number. J. Graph Theory 9 (1985) 451-454
  25. (M. Plantholt) Minimum maximal graphs with forbidden subgraphs. Math. Slovaca 35 (1985) 83-89
  26. (M. Plantholt) The point-distinguishing chromatic index. Graphs and Applications. (F. Harary, J. Maybee, Eds.) Wiley, New York (1985) 147-162
  27. (R.W. Robinson) Isomorphic factorizations X: Unsolved problems. J. Graph Theory. 9 (1985) 67-86
  28. (R.W. Robinson) The diameter of a graph and its complement. Amer. Math. Monthly 92 (1985) 211-212
  29. (R. Tindell) The minimal blocks of diameter two and three. Graphs and Applications. (F. Harary, J. Maybee, Eds.) Wiley, New York (1985) 163-181

1986

  1. Graph theory as applied mathematics. J. Graph Theory 10 (1986) iii-iv
  2. Variations on the Ising problem. Physica 138 A (1986) 359-363
  3. (F. Buckley) Geodetic games for graphs. Quaestiones Math. 8 (1986) 321-334
  4. (P. Hage) Some genuine graph models in anthropology. J. Graph Theory 10 (1986) 353-361
  5. (P. Hage, B. James) Wealth and hierarchy in the Kula ring. Amer. Anthropologist 88 (1986) 108-115
  6. (K.F. Jones) Degree conditional bipartition numbers in graphs. Congressus Numeratium 55 (1986) 39-50
  7. (Y. Koda, M. Plantholt) Graphs suppressible to a star. Indian J. Math. 28 (1986) 37-41
  8. (J. Lauri) The class reconstruction number of maximal planar graphs. Graphs Combin. 2 (1986) 199-207
  9. (M. Livingston) Characterization of trees with equal domination and independent domination numbers. Congressus Numerantium 55 (1986) 121-150
  10. (V. Malyshko) A problem on the minimum blocking flow in a network. Kibernetika (Kiev) 133 (1986) 44-48
  11. (M. Plantholt) Minimum and maximum, minimal and maximal: Connectivity. Bull. Bombay Math. Colloq. 4 (1986) 1-5
  12. (P.J. Slater) A linear algorithm for the cutting center of a tree. Inform. Process. Lett. 23 (1986) 317-319
  13. The knots and links of Albrecht Durer. Atti dell'Accad. Pont. 34 (1986) 97-106

1987

  1. Conditional graph theory III: Independence numbers. Bull. Greek Math. Soc. 28 (1987) 1-7
  2. (M. Anderson) Achievement and avoidance games for generating abelian groups. Internat. J. Game Theory 16 (1987) 321-325
  3. (W.C. Arlinghaus) The digraph number of a finite abelian group. Wiss. Z. Tech. Hochsch. Ilmenau 33 (1987) 25-31 (W.C. Arlinghaus) El numero digrafico de un grupo abeliano finito. Scientia 1A (1988) 5-9
  4. (D. DeTemple, J. Robertson) Partition graphs. Soochow J. Math. 13 (1987) 121-129
  5. (G. Exoo) Animal-trees and caterpillars are equivalent. Nat. Acad. Sci. Letters (India) 10 (1987) 67-69
  6. (F. Glover) A simple criterion for a graph to have a perfect matching. J. Inform. Optim. Sci. 8 (1987) 271-273
  7. (J. Lauri) The class reconstruction number of maximal planar graphs. Graphs Combin. 3 (1987) 45-53
  8. (M. Lewinter) Hypercubes and other recursively defined Hamilton laceable graphs. Congressus Numerantium 60 (1987) 81-84
  9. (B. Manvel) Nearly acyclic graphs. Chinese Quart. J. Math. 2 (1987) 31-33
  10. (F. McMorris) Graphs and bigraphs with interval and co-interval properties. Congressus Numerantium 59 (1987) 101-106
  11. (U. Peled) Hamiltonian threshold graphs. Discrete Appl. Math. 16 (1987) 11-15
  12. (K. Plochinski) On degree achievement and avoidance games for graphs. Math. Mag. 60 (1987) 316-321
  13. (S. Schuster, P. Vestergaard) Interpolation theorems for the invariants of spanning trees of a given graph: Edge-covering. Congressus Numerantium 59 (1987) 107-114
  14. (H.S. Yan) On the maximum value of the maximum degree of kinematic chains. Trans. ASME J. of Mechanisms, Transmissions, and Automation in Design. 109 (1987) 487-490

1988

  1. Cubical graphs and cubical dimensions. Comput. Math. Appl. 15 (1988) 271-275
  2. The graph of a boolean function. J. Experimental Theoret. Artif. Intell. 2 (1988) 163-169
  3. The integral of a tree. J. Inform. Sci. Eng. 4 (1988) 87-92
  4. Kingmaker, Kingbreaker and the other games played on a tournament. J. Inst. Math. & Comput. Sci. 1 (1988) 77-85
  5. In memory of Torrence Parsons, 1941-1987. J. Graph Theory 12 (1988) iii
  6. Some collaborative experiences in graph theory research. Congressus Numerantium 63 (1988) 90-118
  7. (F. Buckley) On the euclidean dimension of a wheel. Graphs Combin. 4 (1988) 23-30
  8. (F. Buckley) On longest induced paths in graphs. Chinese Quart. J. Math. 3 (1988) 61-65
  9. (F. Buckley, L. Doty) On graphs with signed inverses. Networks 18 (1988) 151-157
  10. (F. Buckley, L.V. Quintas) Extremal results on the geodetic number of a graph. Scientia (Chile) 2A (1988) 17-26
  11. (C. Clark, T. Storer) Ultimately economical graphs. Congressus Numerantium 64 (1988) 81-88
  12. (G. Exoo) Animal-trees and caterpillars are equivalent. Nat. Acad. Sci. Letters (India) 10 (1988) 67-69
  13. (M. Fellows, M. Hoover) On the galactic number of a hypercube. Math. Comput. Modelling 11 (1988) 212-215
  14. (Martin Gardner) The propositional calculus with directed graphs. Eureka 48 (1988) 34-40
  15. (N. Graham) Covering and packing in graphs V: Mispacking subcubes in hypercubes. Comput. Math. Appl. 15 (1988) 267-270
  16. (N. Graham) Edge sums of hypercubes. Irish Math. Soc. Bull. 21 (1988) 8-12
  17. (N. Graham) The number of perfect matchings in a hypercube. Appl. Math. Lett. 1 (1988) 45-48
  18. (J.P. Hayes, H-J Wu) A survey of the theory of hypercube graphs. Comput. Math. Appl. 15 (1988) 277-289
  19. (D.F. Hsu) Node-graceful graphs. Comput. Math. Appl. 15 (1988) 291-298
  20. (J. Lauri) On the class reconstruction number of trees. Quart. J. Math. Oxford 39 (1988) 47-60
  21. (M. Lewinter) Spanning subgraphs of a hypercube II: Double starlike trees. Math. Comput. Modelling 11 (1988) 216-217
  22. (M. Lewinter) Spanning subgraphs of a hypercube III: Meshes. Internat. J. Computer Math. 25 (1988) 1-4
  23. (M. Lewinter) The starlike trees which span a hypercube. Comput. Math. Appl. 15 (1988) 299-302
  24. (M. Lewinter, W. Widulski) On two-legged caterpillars which span hypercubes. Congr. Numer. 66 (1988) 103-108
  25. (P.G. Mezey) Embedding and characterization of quantum chemical reaction graphs on two dimensional orientable surfaces. Discrete Applied Math. 19 (1988) 205-214
  26. (P. G. Mezey) Graphical shapes: Seeing graphs of chemical curves and molecular surfaces. J. Math. Chemistry 2 (1988) 377-389
  27. (M. Plantholt) Class reconstruction numbers of unicyclic graphs. Zastos. Matematyki (Applicationes Mathematicae) 20 (1988) 117-123
  28. (S. Schuster) Interpolation theorems for invariants of spanning trees of a given graph: Covering numbers. Congressus Numerantium 64 (1988) 215-219
  29. (D.. Walba, J. Simon) Topicity of vertices and edges in the mobius ladders: A topological result with chemical implications. Tetrahedron Letters 29 (1988) 731-734

1989

  1. On the allocation of resources for the future. Epistimoniki Epetirida Thessaloniki. 10 (1989) 91-97
  2. The geometric dual of a graph. Ann. New York Acad. Sci. 555 (1989) 216-219
  3. The graph of a boolean function. J. Experimental Theoretical Artificial Intelligence 2 (1989) 163-169
  4. Review of The Polya Picture Album - Encounters of a Mathematician, edited by G.L. Alexanderson. Amer. Math. Monthly 96 (1989) 750-753
  5. (K. Al-Wahabi, R. Bari, D. Ullman) The edge-distinguishing chromatic number of paths and cycles. Annals Discrete Math. 41 (1989) 17-22
  6. (D. Bergstrand, K. Hodges, G. Jenning, L. Kuklinski, J. Wiener) The sum number of a complete graph. Bull. Malaysian Math. Soc. 12 (1989) 25-28
  7. (F. Buckley, L.V. Quintas) Extremal results on the geodetic number of a graph. Scientia (Chile) A2 (1989) 17-26
  8. (J. Denes) Finite group table achievement games. J. Engin. Math. (China) 6 (1989) 43-47
  9. (N. Deo, A.J. Schwenk) An eigenvector characterization of cospectral graphs having cospectral joins. Ann. N. Y. Acad. Sci. 555 (1989) 159-166
  10. (R.J. Faudree) The zero-sum property for finite groups. J. Combin. Inform. Systems Sci. 14 (1989) 5-12
  11. (A. Fraenkel) Geodetic contraction games on graphs. Internat. J. Game Theory 18 (1989) 327-338
  12. (J.P. Hayes) On meshy trees. Internat. J. Comput. Math. 29 (1989) 131-138
  13. (M. Lewinter) Spanning subgraphs of a hypercube V: Spanned subcubes. Ann. NY Acad. Sci. 576 (1989) 219-225
  14. (M. Livingston) Caterpillars with equal domination and independent domination numbers. Studies in Graph Theory. Vishwa Gulbarga, (1989) 149-154
  15. (R. Maddox, W. Stanton) On the point linear arboricity of a graph. Mathematiche (Catania) 44 (1989) 281-285
  16. (M. Plantholt) Classification of interpolation theorems for spanning trees and other families of spanning subgraphs. J. Graph Theory 13 (1989) 703-712
  17. (S. Schuster) Interpolation theorems for the independence and domination numbers of spanning trees. Ann. Discrete Math. 41 (1989) 221-227
  18. (Z. Tuza) An exact value for the path-chromatic index of a complete graph. Mathematiche (Catania) 44 (1989) 345-350 (1990).

1990

  1. On the ABC of graph applications. Mathematiche (Catania). 45 (1990) 75-82
  2. The chromatic number of a finite group. Contemporary Methods in Graph Theory (R. Bodendiek, Ed.) Bibliographisches Inst., Mannheim (1990) 651-656
  3. The multi-intersection number of a graph. J. Xidian University 17 (1990) 22-25
  4. Sum graphs and difference graphs. Congressus Numerantium 72 (1990) 101-108
  5. (R. Brigham, R. Dutton, T. Haynes) Characterization of the caterpillars obtained from a unique animal. J. Combin. Inform. System Sci. 15 (1990) 247-255.
  6. (J.A. Kabell, F.R. McMorris) Interval acyclic digraphs. Ars Combin. 29A (1990) 59-64
  7. (S. Kim, F.S. Roberts) Extremal competition numbers as a generalization of Turan's theorem. J. Ramanujan Math. Soc. 5 (1990) 33-43
  8. (H.S. Yan) Logical foundations of kinematic chains: Graphs, line graphs, and hypergraphs. J. Mechanical Design 112 (1990) 79-83

1991

  1. Recent results and unsolved problems on hypercube theory. Graph Theory, Combinatorics, and Applications (Y. Alavi et al, Eds.) Wiley, New York 2 (1991) 621-632
  2. Some types of sum graphs. Proceedings of the 6th Caribbean Conference on Combinatorics & Computing (1991) 1-8
  3. (C. Barefoot, K.F. Jones) What is the difference between the domination and independent domination numbers of a cubic graph? Graphs Combin. 7 (1991) 205-208
  4. (D. Bergstrand, K. Hodges, G. Jennings, L. Kuklinski, J. Wiener) Product graphs are sum graphs. Math. Mag. (1991)
  5. (J. Carrington, T. Haynes) Changing and unchanging the domination number of a graph. J. Combin. Math. Combin. Comput. 9 (1991) 57-63
  6. (I.R. Hentzel, D.P. Jacobs) Digitizing sum graphs over the reals. Caribb. J. Math. Comput. Sci. 1 (1991) 1-4
  7. (L-H. Hsu) Conditional chromatic number and graph operations. Bull. Inst. Math. Acad. Sinica 19 (1991) 125-134
  8. (D. Klein, T. Zivkovic) Graphical properties of polyhexes: Perfect matching vector and forcing. J. Math. Chemistry 6 (1991) 295-306
  9. (M. Lewinter) Spanning subgraphs of a hypercube VI: Survey and unsolved problems. Graph Theory, Combinatorics, and Applications (Y. Alavi et al., Eds.) Wiley, New York 2 (1991) 633-637
  10. (P. Mezey) Chiral and achiral square-cell configurations; The degree of chirality. New Developments in Molecular Chirality (P.Mezey, Ed.) Kluwer, Dordrecht (1991) 241-256
  11. (P. Mezey) Similarity and complexity of the shapes of square-cell configurations. Theoretica Chimica Acta 79 (1991) 379-387

1992

  1. Welcome to the beautiful world of graph theory. Vishwa Internat. J. Graph Theory 1 (1992) 1-5
  2. (K.S. Bagga, L.W. Beineke) Two problems on coloring tournaments. Internat. J. Graph Theory 1 (1992) 85-90
  3. (S. Banerjee) The minimum detour number of a connected graph. Menemui Matematik 14 (1992) 38-43
  4. (D. Bergstrand, K. Hodges, G. Jennings, L. Kuklinski, J. Wiener) Product graphs are sum graphs. Math. Mag. 65 (1992) 262-264
  5. (G. Chartrand, H. Hevia, K. McKeon) On signed graphs with positive and negative graphs. Vishwa Internat. J. Graph Theory 1 (1992) 9-18
  6. (N. Graham) Changing and unchanging the diameter of a hypercube. Discrete Applied Math. 37 (1992) 265-274
  7. (J. Kabell, F.R. McMorris) Subtree acyclic digraphs. Ars Combin. 34 (1992) 93-95
  8. (E.M. Palmer, R.W. Robinson) Counting free binary trees admitting a given height. J. Combin. Inform. System Sci. 17 (1992) 175-181

1993

  1. Is Snaky a winner? Geombinatorics 2 (1993) 79-82
  2. Parallel concepts in graph theory. Math. Comput. Modelling 17 (1993) 101-105
  3. Three new directions in graph theory. Proceedings of the First Estonian Conference on Graphs and applications: Dedicated to the 70th Birthday of Professor Frank Harary (M.Kilp and U. Nummert, Eds.) University of Tartu, Tartu(1993) 15-19
  4. (S.L. and W.A. Arlinghaus) Sum graphs and geographic information. Solstice 4 (1993) 44-69
  5. (W.A. Arlinghaus) The graph, digraph and multigraph numbers of an abelian group. Vishwa Internat. J. Graph Theory 2 (1993) 101-105
  6. (F. Boesch, C. Suffel, R. Tindell) The neighborhood inclusion structure of a graph. Math. Comput. Modelling 17 (1993) 25-28
  7. (G. Exoo, C-D. Xu) Vulnerability in graphs of diameter four. Math. Comput. Modelling 17 (1993) 65-68
  8. (N. Graham) Hypercubes, shuffle-exchange graphs and de Bruijn digraphs. Math. Comput. Modelling 17 (1993) 69-74
  9. (N. Graham, M. Livingston, Q.F. Stout) Subcube fault-tolerance in hypercubes. Information and Computation 102 (1993) 280-314
  10. (J.P. Hayes) Edge fault tolerance in graphs. Networks 23 (1993) 135-142
  11. (T.W. Haynes, M. Lewinter) On the codomination number of a graph. Proyecciones 12 (1993) 149-153
  12. (H. Hosoya) On the matching properties of three fence graphs. J. Math. Chemistry 12 (1993) 211-218
  13. (M.S. Jacobson, E. Kubicka, G. Kubicki, O. Oellermann) The irregularity cost or sum of a graph. Applied Math. Letters 6 (1993) 79-80
  14. (M.S. Jacobson, M.J. Lipman, F.R. McMorris) Abstract sphere- of-influence graphs. Math. Comput. Modelling 17 (1993) 77-83
  15. (P.C. Kainen) The cube of a path is maximal planar. Bull. Inst. Combin. Applics. 7 (1993) 55-56
  16. (S. Lawrencenko, V. Korzhik) Realizing the chromatic numbers of triangulations of surfaces. Discrete Math. 122 (1993) 197-204
  17. (M. Lewinter) All hypercubes are pluperfect. Bull. Malaysian Math. Soc. 16 (1993) 21-23
  18. (M. Lewinter) Spanning subgraphs of a hypercube IV: Rooted trees. Math. Comput. Modelling 17 (1993) 85-88
  19. (M. Lewinter) Which graphs are pluperfect?. Australasian J. Combin. 7 (1993) 81-86
  20. (M. Livingston) Independent domination in hypercubes. Applied Math. Lett. 6 (1993) 27-28
  21. (E. Loukakis, C. Tsouros) The geodetic number of a graph. Math. Comput. Modelling 17 (1993) 89-95
  22. (M. Malek) Quantifying fault recovery in multiprocessor systems. Math. Comput. Modelling 17 (1993) 97-104
  23. (M. Malek) Variations on a hypercube: Embellishments of parallel architectures. Math. Comput. Modelling 17 (1993) 105-111
  24. (Z. Tuza) Two graph-colouring games. Bull. Austral. Math. Soc. 48 (1993) 141-149

1994

  1. Sum graphs over all the integers. Discrete Math. 124 (1994) 99-105
  2. (R.C. Brigham, J.R. Carrington, R.D. Dutton) Unicyclic graphs derived from square-cell animals. Bull. Malaysian Math. Soc. 17 (1994) 75-80
  3. (G. Chartrand, H. Gavlas, M. Schultz) On signed degrees in signed graphs. Czech. Math. J. 44 (1994) 677-690
  4. (G.Chartrand, M.Schultz, C.E.Wall) Forced orientation numbers of a graph. Congressus Numerantium 100 (1994) 183-191
  5. (D.M. Gordon, R.W. Robinson) Minimum degree games for graphs. Discrete Math. 128 (1994) 151-163
  6. (P. Hage) Sex in bipartite graphs. Connections 17 (1994) 23-25
  7. (M.S.Jacobson, M.J. Lipman, F.R. McMorris) Sphere-of-influence graphs defined on a prescribed graph. J. Combin. Inform. System Sci. 19 (1994) 5-10
  8. (T.A. McKee) The square of a chordal graph. Discrete Math. 124 (1994) 197-203
  9. (R.C. Read) The enumeration of polyhexes with caterpillar shape. Croatica Chemica Acta 67 (1994) 481-492

1995

  1. Counting circular caterpillars. Proyecciones 14 (1995) 21-26
  2. From graphs to matroids: Generating research questions. Internat. J. Operations and Quantitative MAnagement 1 (1995) 15-19
  3. (C. Barefoot, K. Casey, D. Fisher, K. Fraughnaugh) Size in maximal triangle-free graphs and minimal graphs of diameter 2. Discrete Math. 138 (1995) 93-99
  4. (G.Chartrand,M.Hossain, K.Schultz) Exact 2-step domination in graphs. Math. Bohemica 120 (1995) 125-134
  5. (P.Hage) Close-Proximity Analysis: Another variation on the Minimum-Spanning-Tree problem, Current Anthropology 36(1995)677-683
  6. (P.Hage) Eccentricity and centrality in networks. Social Networks 17 (1995) 57-63
  7. (P.Hage, B.Milicic) Hierarchical opposition. Oceania 65 (1995) 347-354
  8. (J.P.Hayes) Survey of fault tolerance for graphs. Graph Theory, Combinatorics, and Applications (Eds. Y.Alavi and A. Schwenk) vol.1 (1995) 477-483
  9. (M.Khurrum) One node fault tolerance for caterpillars and starlike trees. Internat. J. Computer Math. 56 (1995) 135-143

1996

  1. The biparticity of a graph and the Four Color Theorem. Bull. Inst. Combin. Applics. 16 (1996) 92-93
  2. Embedding platonic graphs in meshes. Graph Theory Notes of New York, New York Academy of Sciences 30 (1996) 26-29
  3. (R.Brigham, R.Dutton, T.W.Haynes) On graphs having equal domination and codomination numbers. Utilitas Math. 50 (1996) 53-64
  4. (D.Gagliardi, M.Lewinter) A lower bound for the number of irregular multigraphs. Graph Theory Notes of New York, New York Academy of Sciences 31 (1996) 6-8
  5. (P.Hage) The logical structure of asymmetric marriage systems. L'Homme 139 (1996) 1-16
  6. (P.Hage, B.James) The minimum spanning tree problem in archeology. American Antiquity 61 (1996) 149-155
  7. (P.Hage, B.Milicic) Tattooing, gender, and social stratification in Micro-Polynesia. J. Royal Anthropological Inst. 2 (1996) 235-250
  8. (P.Hage, B.Milicic) Hierarchical Opposition: Reply to Gregory. Oceania 67 (1996) 156-159
  9. (H.Harborth, R. Heidelberg, S. Jager) Smallest nonmeshy trees. Congressus Numerantium 117 (1996) 5-14
  10. (J.P. Hayes) Node fault tolerance in graphs. Networks 27 (1996) 19-23
  11. (T.W.Haynes) Nordhaus-Gaddum inequalities for domination in graphs. Discrete Math. 155 (1996) 99-105
  12. (T.W. Haynes, L.M. Lawson) A note on changing and unchanging the color cost of a graph. Congressus Numerantium 119 (1996) 185-191
  13. (P.C.Kainen) On the dichromatic index of a digraph. Quaestiones Math. 19 (1996) 325-329
  14. (P.G.Mezey, W.Randolph) On maximum unit-circle caterpillars--Tools for the study of adsorption patterns. Discrete Applied Math. 67 (1996) 127-136

1997

  1. Metaslide. Bull. Inst. Combin. Applics. 19 (1997) 103-108

Accepted for Publication

  • Designs from graph invariants. J. Combin., Inform. and System Sciences
  • The unique 2-edge-coloring of K6 which produces exactly two monochromatic quadrilaterals. Compte Rendus de l'Academie Bulgare des Sciences
  • The construction, personality and evolution of square-cell animals. Papua New Guinea J. of Math., Comput. & Educ.
  • Methods of destroying the symmetries of a graph. Graphs, Combinatorics, and Algorithms (Y.Alavi, A.J.Schwenk, eds.)
  • (D.Aingworth, R.Motwani) The difference between a graph and its square. Utilitas Math.
  • (C.M.Campbell, E.DeLaVina) The maximum induced circumference of a graph. PanAmerican Math. J. 7 (1997)
  • (G.Chartrand, H.Gavlas, R.C.Vandell) The forcing domination number of a graph. J. Combin. Math. Combin. Comput.
  • (M.Gionfriddo, Z.Tuza) The color cost of a caterpillar. Discrete Math.
  • (N.Graham) Some small sized spanning subgraphs of a hypercube. Math. Comput. Modelling
  • (G.Gupta) On dynamic graph models. Math. Comput. Modelling
  • (T.W.Haynes) Conditional graph theory IV: Dominating sets. Utilitas Math.
  • (T.W.Haynes) The k-tuple domatic number of a graph. Math. Slovaca
  • (T.W.Haynes, P.Slater) Efficient and excess domination in graphs. J. Combin. Math. Combin. Computing
  • (P.Hage) Applications of the minimum spanning tree problem to network Kinship, Networks and Exchange (T. Schweitzer and D.White, editors) Cambridge University Press, Cambridge
  • (P.G. Mezey) Cell-shedding transformations, equivalence relations, and similarity measures for square-cell configurations, Internat. J. Quantum Chemistry
  • (A.Morgana, B.Simeone) Filling the missing names of towns in a map: A graph theoretic approach. J. Combin. Math. Combin. Comput.
  • ((R.Naserasr, E.S.Mahmoodian, M.Mahdian) On defining sets of vertex colorings of the cartesian product of a cycle and a completa graph. Graphs, Combinatorics and Algorithms. (Y.Alavi and A.J.Schwenk, eds.) Wiley, New York (1997)
  • (O.Oellermann) The irregularity cost of a graph. Math. Comput. Modelling
  • (B.Raghavachari) The e-mail gossip number and the connected domination number. Applied Math. Letters