Abstract
This is an edited list of articles concerned with the role of graphs in the theory of ordered sets and its applications. The list is not a cumulative record of the bibliographies of the fifteen expository articles of this volume, although the bibliographies do, hopefully, complement this list.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Abbott, H.L.; Katchalski, M. (1978) “Linear orderings satisfying certain constraints.” Ars Combin. 6, 19–26. MR 81e:05005.
Abbott, Harvey; Katchalski, Meir (1979) “A Turan type problem for interval graphs. ” Discrete Math. 25, no. 1, 85-88. MR 80b:05038.
Abdul-Kader, I. (1978) “Caracterisation et proprietes des tournois reguliers.” Rev. Roumaine Math. Pures Appl. 23, no. 9, 1283–1288. MR 80b:05031.
Abdul-Kader, I. (1978) “Path decompositions of digraphs.” Bull. Austral. Math. Soc. 19, no. 2, 205–216. MR 80f:05056.
Abian, Alexander (1973) “Rado’s theorem and solvability of systems of equations.” Notre Dame J. Formal Logic 14, 145–150. MR 48.1 5866.
Adam, A.; Culik, K.; Pollak, G. (1963) “Ein Satz uber teilweise gerichtete Graphen.” (Russian summary) Czechoslovak Math. J. 13 (88), 619-621. MR 29.1 2792.
Adam, Andras (1971) “Graphs and cycles.” (Hungarian. Russian and English summaries) Mat. Lapok 22, 269-282. MR 49.1 118.
Adam, A. (1976/77) “On graphs satisfying some conditions for cycles. I.” (Russian summary) Acta Cybernet. 3, no. 1, 3-13. MR 56.1 2866.
Adamek, Jiri (1970) “Some generalizations of the notions limit and colimit.” Comment. Math. Univ. Carolinae II, 823-827. MR 43.1 138.
Adamek, Jiri; Koubek, Vaclav (1974) “Products of graphs as a representation of semigroups.” Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague), pp. 13-16. Academia, Prague, 1975. MR 53.1 2748.
Adams, M.E.; Nesetril, J.; Sichler, J. (1981) “Quotients of rigid graphs.” J. Combin. Theory Ser. B30, no. 3, 351–359. MR 83a:05115.
Adler, Andrew (1973) “F-planar graphs.” J. Combinatorial Theory Ser. B15, 207–210. MR 48.1 174.
Adolphson, D.; Hu, T.C. (1973) “Optimal linear ordering.” SIAM J. Appl. Math. 25, 403–423. MR 49.2 10349.
Aguado-Munoz Prada, Ricardo (1975) “Graphical representation of finite groups.” (Spanish), Gac. Mat. (Madrid) (1) 27, 3–15. MR 51.1 5379.
Ahlswede, Rudolf; Daykin, David E. (1979) “Inequalities for a pair of maps S x S → S with S a finite set.” Math. Z. 165, no. 3, 267–289. MR 80b:05009.
Ahlswede, Rudolf; Daykin, David E. (1979) “The number of values of combinational functions.” Bull. London Math. Soc. 11, no. 1, 49–51. MR 81a:05012.
Ahlswede, Rudolf (1980) “Simple hypergraphs with maximal number of adjacent pairs of edges.” J. Combin. Theory Ser. B 28, no. 2, 164–167. MR 81h:05104.
Aho, A.V.; Garey, M.R.; Ullman, J.D. (1972) “The transitive reduction of a directed graph.” SIAM J. Comput. 1, no. 2, 131–137. MR 46.2 5159.
Ahrens, J.H. (1974) “Matrix reduction and strong components in digraphs.” Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 173–177. Congressus Numerantium, No. X, Utilitas Math., Winnipeg, Man. MR 51.1 546.
Aigner, Martin (1967) “On the linegraph of a directed graph.” Math. Z. 102, 56–61. MR 36.1 76.
Aigner, Martin (1969) “Graphs and partial orderings.” Monatsh. Math. 73, 385–396. MR 41.1 1561.
Aigner, Martin (1969) “Graphs whose complement and line graph are isomorphic.” J. Combinatorial Theory 7, 273–275. MR 39.2 6765.
Aigner, Martin; Dowling, Thomas A. (1970) “Matching theorems for combinatorial geometries.” Bull. Amer. Math. Soc. 76, 57–60. MR 43.1 1864.
Aigner, Martin; Prins, Geert (1971) “Uniquely partially orderable graphs.” J. London Math. Soc. (2) 3, 260–266. MR 43.1 1866.
Aigner, Martin; Dowling, Thomas A. (1971) “Matching theory for combinatorial geometries.” Trans. Amer. Math. Soc. 158, 231–245. MR 44.2 3898.
Aigner, M.; Dowling, T.A. (1972) “A geometric characterization of the line graph of a symmetric balanced incomplete block design.” Studia Sci. Math. Hungar. 7, 137–145. MR. 48.1 116.
Aigner, Martin (1972) “Vertauschbarkeit von Partitionen.” Math Z. 127, 281–292. MR 47. 1 1691.
Aigner, Martin (1973) “Lexicographic matching in Boolean algebras.” J. Combinatorial Theory Ser. B 14, 187–194. MR 47.2 8314.
Aigner, Martin (1974) “Uniformitat des Verbandes der Partitionen.” Math. Ann. 207, 1–22. MR 53.2 7872.
Aigner, Martin (1975) “Symmetrische Zerlegung von Kettenprodukten.” (English summary), Monatsh. Math. 79, 177–189. MR 52.1 2899.
Aigner, Martin (1976) “Kombinatorik. II.” Matroide und Transversaltheorie. Hochschultext. Springer-Verlag, xviii+324 pp. MR 57.1 123.
Ajtai, Miklos; Komlos, Janos; Szemeredi, Endre (1981) “The longest path in a random graph.” Combinatorica 1, no. 1, 1–12. MR 82d:05074.
Ajtai, M.; Komlos, J.; Szemeredi, E. (1982) “Largest random component of a k-cube.” Combinatorica 2, no. 1, 1–7. MR 83k:05070.
Akiyama, Jin; Hamada, Takashi; Yoshimura, Izumi (1974) “Miscellaneous properties of middle graphs.” TRU Math. 10, 41–53. MR 54.1 157.
Akiyama, Jin; Hamada, Takashi; Yoshimura, Izumi (1975) “On characterizations of the middle graphs.” TRU Math. 11, 35–39. MR 54.1 2538.
Akiyama, Jin (1978) “Forbidden subgraphs for planar total graphs, middle graphs and iterated line graphs.” J. Combin. Inform. System Sci. 3, no. 4, 255–260. MR 80h:05022.
Akiyama, Jin; Exoo, Geoffrey; Harary, Frank (1980) “Covering and packing in graphs. III. Cyclic and acyclic invariants.” (Russian summary), Math. Slovaca 30, no. 4, 405-417. MR 82k:05085a.
Akiyama, Jin; Hamada, Takashi (1979) “The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests.” Discrete Math. 26, no. 3, 203–208. MR 80h:05020.
Akiyama, Jin; Hamada, Takashi; Yoshimura, Izumi (1976) “Graph equations for line graphs, total graphs and middle graphs.” TRU Math. 12, no. 2, 31–34. MR 57.1 177a.
Akiyama, Jin; Sato, Iwao (1981) “On the connectivity of n-trees.” TRU Math. 17, no. 1, 117–121. MR 83b:05052.
Alameddine, A.F. (1980) “Directed graphs and convergence.” The theory and applications of graphs (Kalamazoo, Mich.), pp. 13–25, Wiley, New York. MR 82m:05048.
Alavi, Yousef; Lick, Don R. (Editors) (1976) “Theory and applications of graphs.” Proceedings of the International Conference held at Western Michigan University, Kalamazoo, Mich., May 11–15, 1976. MR 57 #12273.
Albrecht, R . (1968) “Bestimmung minimaler Wege in endlichen, gerichteten, bewerteten Graphen.” (English summary), Computing (Arch. Elektron. Rechnen) 3, 184–193. MR 38.2 3178.
Alekseev, V.B . (1973) “The number of k-valued monotone functions.” (Russian), Dokl. Akad. Nauk SSSR, 208, 505–508. MR 47.2 4810.
Aleksic, Tihomir Z. (1968) “Quelques operations sur les substitutions d’application uniforme de l’ensemble fini en lui-meme.” Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz. No. 230–241, 49–53. MR 39.1 1339.
Al-Fulaij, E.Y.; Mulla, F.S. (1979) “Construction of trees.” (Arabic summary), J. Univ. Kuwait Sci. 6, 9–21. MR 83k:05040.
Allan, Robert B.; Laskar, Renu (1978) “On domination and independent domination numbers of a graph.” Discrete Math$123, no$12, 73–76. MR 80c: 05086.
Allan, Robert B.; Laskar, Renu (1978) “On domination and somt related concepts in graph theory.” Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 43–56, Congress. Numer., XXI, Utilitas Math., Winnipeg, Man. MR 81i:05086.
Alpert, Seth R. (1973) “The genera of amalgamations of graphs.” Trans. Amer. Math. Soc. 178, 1–39. MR 51. 1 7915.
Alpert, Seth R.; Gross, Jonathan L. (1976) “Components of branched coverings of current graphs.” J. Combinatorial Theory Ser. B 20, no. 3, 283–303. MR 54. 2 7301.
Alspach, Brian (1967) “Cycles of each length in regular tournaments.” Canad. Math. Bull. 10, 283–286. MR 35. 2 4125.
Alspach, Brian (1970) “On point-symmetric tournaments.” Canad. Math. Bull. 13, 317–323. MR 42. 2 7558.
Alspach, Brian (1972) “The groups of point-symmetric graphs and digraphs of prime order.” Proceedings of the Third Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp$123–26. MR 50. 1 175.
Alspach, B.; Berggren, J.L. (1973) “On the determination of the maximum order of the group of a tournament.” Canad. Math. Bull. 16, 11–14. MR 1969.
Alspach, Brian (1973) “Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree.” J. Combinatorial Theory Ser. B 15, 12–17. MR 48. 2 10880.
Alspach, Brian; Reid, K.B.; Roselle, D.P. (1974) “Bypasses in asymmetric digraphs.” J. Combinatorial Theory Ser. B 17, 11–18. MR 52. 1 168.
Alspach, Brian R.; Pullman, Norman J. (1974) “Path decompositions of digraphs.”Bull. Austral. Math. Soc. 10, 421–427. MR 50.1 169.
Alspach, Brian; Mason, David W.; Pullman, Norman J. (1976) “Path numbers of tournaments” J. Combinatorial Theory Ser. B 20, no. 3, 222–228. MR 10065.
Alspach, Brian (1977) “Graphs and permutation groups whose transitive constituents have prime degree.” Topics in gi;aph theory (New York), pp. 12–20, Ann. New York Acad. Sci., 328, New York Acad. Sci., New York. MR 81j:05065.
Alspach, Brian; Reid, K.B. (1978) “Degree frequencies in digraphs and tournaments.” J. Graph Theory 2, no. 3, 241–249. MR 80a: 05100.
Alspach, Brian; Heinrich, Katherine; Varma, Badri N. (1979) “Decompositions of complete symmetric digraphs into the oriented pentagons.” J. Austral. Hath. Soc. Ser. A 28, no. 3, 353–361. MR81g:05087
Alspach, Brian; Parsons, T.D. (1979) “Isomorphism of circulant graphs and digraphs.” Discrete Math. 25, no. 2, 97–108. MR80e:05064
Alspach, Brian; Heinrich, Katherine, Rosenfeld, Moshe (1981) “Edge partitions of the complete symmetric directed graph and related designs.” Israel J. Math. 40, no. 2, 118–128. MR 82k:05051
Alspach, Brian (1980) “The search for long paths and cycles in vertex-transitive graphs and digraphs.” Combinatorial mathematics, VIII (Geelong), pp. 14–22, Lecture Notes in Math., 884, Springer, Berlin. MR83b:05080
Tran Dinh Am; Tsukiyama, Shuji; Shirakawa, Isao; Ozaki, Hiroshi (1976) “An algorithm for generating all the directed paths and its application.” Information Processing in Japan 16, 31–35. MR 57.1 1964
Am, Tran Dinh [Tran Dinh Am]; Tsukiyama, Shuji; Shirakawa, Isao; Ozaka, Hiroshi (1976) “An algorithm for generating all the paths between two vertices in a diagraph and its application.” Tech. Rep. Osaka Univ. 26, no. 1308-1336, 411–418. MR 58 #9182
Ambrosimov, A.S.; Sarov, N.N. (1979) “Some asymptotic expansions for the number of functions with a nontrivial inertia group.” (Russian), Problemy Kibernet. No. 36 65–84, 279. MR 81j:05008.
Amson, J.C . (1971/72) “Representations of multilinear and polynomial operators on vector spaces.” J. London Math. Soc. (2) 4, 394–400. MR 45.1 3449.
Anderson, B.A. (1973) “Finite topologies and Hamiltonian paths.” J. Combinatorial Theory Ser. B 14, 87–93. MR 47. 1 1004.
Anderson, B.A. (1976) “Sequencings and starters.” Pacific J. Math. 64, no. 1, 17–24. MR 55. 1 161.
Anderson, B.A. (1977) “Symmetry groups of some perfect 1-factorizations of complete graphs.” Discrete Math$118, no$13, 227–234. MR 57. 1 2979.
Anderson, Ian (1971) “Perfect matchings of a graph.” J. Combinatorial Theory Ser. B. 10, 183–186. MR 43. 1 1853.
Anderson, Ian (1972/73) “Sufficient conditions for matchings.” Proc. Edinburgh Math. Soc. (2) 18, 129–136. MR 52.1 5479.
Anderson, Ian (1976) “Intersection theorems and a lemma of Kleitman.” Discrete Math$116, no$13, 181–185. MR 55. 2 10274.
Anderson, William N., Jr. (1974) “Maximum matching and the game of Slither.” J. Combinatorial Theory Ser. B. 17, 234–239. MR 51. 1 269.
Anderson, William N., Jr. (1975) “Maximum matching and the rank of a matrix.” SIAM J. Appl. Math. 28, 114–123. MR 541.2 12599
Anderson, Sabra Sullivan; Chartrand, Gary (1967) “The lattice-graph of the topology of a transitive directed graph.” Math. Scand. 21, 105–109. MR 38.2 5672
Andreae, Thomas (1978) “Matroidal families of finite connected nonhomeomorphic graphs exist.” J. Graph Theory 2, no. 2, 149–153. MR 80a: 05160.
Andresen, E.; Kjeldsen, K. (1976) “On certain subgraphs of a complete transitively directed graph.” Discrete Math. 14, no. 2, 103–119. MR 52.2 10478
Andress, W.R . (1960) “Basic properties of pandiagonal magic squares.” Amer. Math. Monthly 67, 143–152; correction, 658. MR 22.2 10916.
Andrews, George E. (1975) “Identities in combinatorics. I. On sorting two ordered sets.” Discrete Math. 11, 97–106. MR 52.2 10440
Anisimov, A.V. (1976) “Optimal packing of trees.” (Russian. English summary insert), Kibernetika (Kiev), no. 3, 89–91. MR 58 #19283.
Ansell, J.; Bendell, A.; Humble, S. (1981) “Generalisation of Dedekind’s problem of the enumeration of coherent structures.” Proc. Roy. Soc. Edinburgh Sect. A 89, no. 3–4, 239–248. MR 83a: 05014.
Antohe, St.,; Olaru, E. (1978) “Uber Homomorphismen und Kongruenzen von Graphen.” (Romanian and French summaries), Bui. Univ. Galati Fasc. II Mat.Fiz. Mec. Teoret. 1, 15–23. MR 81h:05107.
Aragno Marauta, Eziamaria (1979) “On the upper embeddability of some cubic Hamiltonian graphs.” (Italian. English summary), Istit. Lombardo Accad. Sci. Lett. Rend. A 113, 416–425. MR 82k:05046.
Arditti, J.C.; Cori, R. (1969) “Hamilton circuits in the comparability graph of a tree.” Combinatorial Theory and its Applications, I ( Proc. Colloq., Balatonfured ), pp. 41–53. MR 46.1 3361
Arditti, Jean-Claude (1970) “Cycles hamiltoniens dans les graphes de comparabilite d’arbres orientes.” C.R. Acad. Sci. Paris Ser. A–B 271, A711–A713. MR 42.2 7552
Arditti, J.-C. (1973) “Denombrement des arborescences dont le graphe de comparabilite est hamiltonien.” Discrete Math. 5, 189–200. MR 47.2 4848
Arditti, J.C . (1974) “Cheminements dans le graphe de comparabilite d’un arbre partition des sommets en cycles.” Colloque sur la Theorie des Graphes (Paris). Cahiers Centre Etudes Recherche Oper. 17, no. 2–3–4, 111–116. MR 53.1 5344.
Arditti, J.C.; Jung, H.A. (1980) “The dimension of finite and infinite comparability graphs.” J. London Math. Soc. (2) 21, no. 1, 31–38. MR 82b:05065
Arjomandi, Eshrat (1976/77) “On finding all unilaterally connected components of a digraph.” Information Processing Lett. 5, no. 1, 8–10. MR 53.1 4605.
Arlazarov, V.L.; Dinic, E.A.; Kronrod, M.A.; Faradzev, I.A. (1970) “The economical construction of the transitive closure of an oriented graph.” (Russian), Dokl. Akad. Nauk SSR 194, 487–488. MR 42.2 4441.
Arlazarov, V.L.; Uskov, A.V.; Faradzev, I.A. (1973) “An algorithm for finding all simple cycles in a directed graph.” (Russian), Studies in discrete mathematics (Russian), pp. 178–183. Izdat. “Nauka”, Moscow. MR 48.1 148.
Arrowsmith, D.K.; Essam, J.W. (1977) “Percolation theory on directed graphs.” J. Mathematical Phys. 18, no. 2, 235–238. MR 58 #5338
Assouad, Patrice; Delorme, Charles (1980) “Graphes plongeables dans L1.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 291, no. 6, A369–A372. MR 82h:05043.
Astie, Annie (1972) “Groupes d’automorphismes des tournois sommet-symmetriques d’ordre premier et denombrement de ces tournois.” C.R. Acad. Sci. Paris Ser. A–B 275, A167–A169. MR 46.2 8888
Astie, Annie (1974) “Vertex-symmetric tournaments of order n with the minimum number of arc orbits.” Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague), pp. 17–30. Academia, Prague. MR 52.2 10486
Astie, Annie [Astie-Vidal, Annie] (1978) “Groupes d’automorphismes des graphes d’intersection aux bases d’un matroide.” Colloque Mathematiques Discretes: Codes et Hypergraphes (Brussels). Cahiers Centre Etudes Rech. Oper. 20, no. 3–4, 235–242. MR 80k:05063.
Auray, Jean-Paul; Duru, Gerard; Mougeot, Michel (1978) “D’une analyse topologique a l’autre.” Document de Travail, 23. Departement de Sciences Economiques, Universite de Franche-Comte, Besancon, 18 pp. MR 80e:05052
Avdosin, S.M.; Belov, V.V. (1979) “A generalized “wave” method for solving extremal problems on graphs.” (Russian), Z. Vycisl. Mat. i Mat. Fiz. 19, no. 3, 739–755, 798–799. MR 81a:05075.
Avramesco, Andre (1975) “Sur une classe de problemes combinatoires.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 281, no. 11, Ai, A361–A362. MR 52.1 2908.
Ayel, Jacqueline (1982) “Longest paths in bipartite digraphs.” Discrete Math. 40, no. 1, 115–118. MR 83k:05065
Ayoub, J.N.; Frisch, I.T. (1970) “On the smallest-branch cuts in directed graphs.” IEEE Trans. Circuit Theory CT-17, 249–250. MR 42.1 1717.
Babai, L. (1973) “Groups of graphs on given surfaces.” Acta Math. Acad. Sci. Hungar. 24, 215–221. MR 47.2 4846
Babai, L. (1974) “A remark on contraction of graphs with given group.” Acta Math. Acad. Sci. Hungar. 25, 89–91. MR 52.2 10487
Babai, Laszlo (1974) “On the minimum order of graphs with given group.” Canad. Math. Bull. 17, no. 4, 467–470. MR 53.2 10641
Babai, L. (1978) “Infinite digraphs with given regular automorphism groups.” J. Combin. Theory Ser. B 25, no. 1, 26–46. MR 58 #16380
Babai, L.; Frankl, P. (1976) “Isomorphisms of Cayley graphs. I.” Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely), Vol. I, pp. 35–52, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 81g:05066b.
Babai, L.; Frankl, P. (1979) “Isomorphisms of Cayley graphs. II.” Acta Math. Acad. Sci. Hungary. 34, no. 1–2, 177–183. MR 81g:05066b.
Babai, Laszlo; Pultr, Ales (1980) “Endomorphism monoids and topological subgraphs of graphs.” J. Combin. Theory Ser. B 28, no. 3, 278–283. MR 82c:05052.
Babai, Laszlo (1981) “On the abstract group of automorphisms.” Combinatorics (Swansea), pp. 1–40, London Math. Soc. Lecture Note Ser., 52, Cambridge Univ. Press, Cambridge. MR 83a:05064.
Babat, L.G. (1975) “Linear functions on the n-dimensional unit cube.” (Russian), Dokl. Akad. Nauk SSSR 221, no. 4, 761–762. MR 52.1 7535.
Babikov, G.V . (1965) “On the application of graph theory to the solution of equations.” (Russian), Ural. Gos. Univ. Mat. Zap. 5, tetrad’ 1, 5–9. MR 35.1 2479.
Backawski, Kenneth (1976) “Homology and graphs.” (French summary), Problemes combinatoires et theorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay), pp. 17–18, Colloques Internat. CNRS, 260, CNRS, Paris, 1978. MR 80m:05032.
Bagaev, G.N. (1977) “Distribution of the number of vertices in a component of a random nonexpandable mapping.” (Russian), Dokl. Akad. Nauk BSSR 21, no. 12, 1061–1063, 1147. MR 58 #18653.
Bagaev, G.N . (1981) “Distribution of the number of vertices that are adjacent to the root in a multicolored tree.” (Russian. English summary), Dokl. Akad. Nauk BSSR 25, no. 12, 1061–1062, 1148. MR 83b:05053.
Bagrinovskii, K.A.; Rabinovic, I.B. (1964) “The statement of a problem in the analysis of a network diagram.” (Russian), Vycisl. Sistemy Vyp. 11, 71–93. MR 38.2 5520.
Bailey, C.K. (1982) “Distribution of points by degree and orbit size in a large random tree.” J. Graph Theory 6, no. 3, 283–293. MR 83i:05037.
Bajic, Branko (1969) “The explicit formula for change in variable in a differential expression.” Bui. Math. Soc. Sci. Math. R.S. Roumanie (N.S.) 13 (61), no. 4, 395–401 (1970). MR 45.1 471.
Baker, Kirby A.; Fishburn, Peter C.; Roberts, Fred S. (1970) “A new characterization of partial orders of dimension two.” International Conference on Combinatorial Mathematics. Ann. New York Acad. Sci. 175, 23–24. MR 42.1 140.
Baker, Ronald (1975) “Whist tournaments.” Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 89–100. Congressus Numerantium, No. XIV, Utilitas Math., Winnipeg, Man. MR 54.1 2513.
Balconi, Giorgio (1968) “Sui singrammi a commutato periodico.” 1st. Lombardo Accad. Sci. Lett. Rend. A 102, 427–436. MR 39.1 1361.
Balconi, Giorgio (1973) “Una caratterizzazione dei singrammi commutati.” 1st. Lombardo Accad. Sci. Lett. Rend. A 107, 685–698. MR 50.1 185.
Balconi, G.; Guglielmann Grieco, M.; Zucchetti, B. [Ricetti Zucchetti, Bianca] (1981) “Duality graphs of incidence structures.” (Italian. English summary), Boll. Un. Mat. Ital. B (5) 18, no. 3, 799–810. MR 83c:05062.
Balinski, M.L. (1967) “Labelling to obtain a maximum matching.” (With discussion). Combinatorial Mathematics and its Applications (Proc. Conf., Univ. North Carolina, Chapel Hill, N.C.), pp. 585–602. Univ. North Carolina Press, Chapel Hill, N.C., 1969. MR 41.2 8270.
Balinski, M.L. (1970) “On perfect matchings.” SIAM Rev. 12, 570–572. MR 44.1 2037.
Balinski, M.L. (1967) “On maximum matching, minimum covering and their connections.” Proc. Princeton Sympos. on Math. Programming, pp. 303–311. Princeton Univ. Press, Princeton, N.J., 1970. MR 48.1 5917.
Ball, Michael 0.; Provan, J. Scott (1982) “Bounds on the reliability polynomial for shellable independence systems.” SIAM J. Algebraic Discrete Methods 3, no. 2, 166–181.
Bang, Chang M.; Sharp, Henry, Jr. (1977) “An elementary proof of Moon’s theorem on generalized tournaments.” J. Combinatorial Theory Ser. B 22, no. 3, 299–301. MR 56.1 176.
Bang, Chang M.; Sharp, Henry, Jr. (1979) “Score vectors of tournaments.” J. Combin. Theory Ser. B 26, no. 1, 81–84. MR 80d:05025.
Bange, David W.; Barkauskas, Anthony E.; Slater, Peter J. (1980) “Conservative graphs.” J. Graph Theory 4, no. 1, 81–91. MR 81b:05089.
Bannai, Eiichi; Cameron, Peter J.; Kahn, Jeff (1981) “Nonexistence of certain distance-transitive digraphs.” J. Combin. Theory Ser. B 31, no. 1, 105–110. MR 82m:05049.
Baranskii, V.A.; Trahtman, A.N. (1970) “Subsemigroup graphs.” (Russian. English summary), Mat. Casopis Sloven. Akad. Vied 20, 135–140. MR 47.1 3211.
Baranyai, Z.; Szasz, Gy. R. (1981) “Hamiltonian decomposition of lexicographic product.” J. Combin. Theory Ser. B 31, no. 3, 253–261. MR 83c:05085.
Bari, Ruth A. (1981) “Line graphs and their chromatic polynomials.” Graph theory (Cambridge), pp. 15–21, North-Holland Math. Stud., 62, North-Holland, Amsterdam-New York, 1982. MR 83j:05035.
Barker, George Phillip (1973) “The lattice of faces of a finite dimensional cone.” Linear Algebra and Appl. 7, 71–82.
Barkova, L.S.; Smirnov, V.M. (1975) “A transformation of a graph of relations in order to construct precedence functions.” (Russian), Trudy Moskov. Orden. Lenin. Energet. Inst. Vyp. 247, 96–101. MR 58 #3708.
Barlotti, A. (1971) “Some classical and modern topics in finite geometrical structures. A brief survey.” A survey of combinatorial theory (dedicated to R.C. Bose on the occasion of his seventieth birthday, and containing the proceedings of the Internat. Sympos. Combinatorial Math, and its Appl., Colorado State Univ., Fort Collins, Colo.), pp. 1–14. North-Holland, Amsterdam, 1973.
Barlotti, A . (1974) “Combinatorics of finite geometries.” Combinatorics, Part 1: theory of designs, finite geometry and coding theory (Proc. Advanced Study Inst., on Combinatorics, Breukelen), pp. 55–59. Math. Centre Tracts, No. 55, Math. Centrum, Amsterdam. MR 50.1 1926.
Barlotti, A.; Cofman, J. (1974) “Finite Sperner spaces constructed from projective and affine spaces.” Abb. Math. Sem. Univ. Hamburg 40, 231–241. MR 49.1 87.
Barnabei, Marilena; Brini, Andrea (1980) “Some properties of characteristic polynomials and applications to T-lattices.” Discrete Math. 31, no. 3, 261–270. MR 82b:05008.
Barnette, David (1969) “Diagrams and Schlegel diagrams.” Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta.), pp. 1–4. Gordon and Breach, New York, 1970. MR 42.2 5156
Barnette, David (1980) “Polyhedral maps on 2-manifolds.” Convexity and related combinatorial geometry (Norman, Okla.), pp. 7-19, Lecture Notes in Pure and Appl. Math., 76, Dekker, New York, 1982. MR 83c:05049.
Barthelemy, Jean-Pierre (1977) “Comparaison et agregation des partitions et des preordres totaux.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 285, no. 16, A985–A987. MR 58 #16328.
Barthelemy, Jean-Pierre (1978) “Caracterisation metrique des ensembles ordonnes arborescents.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 286, no. 4, A189–A190. MR 57 #12274.
Basca, O.C . (1977) “On algorithms of minimum paths in graphs.” (French and Russian summaries), Econom. Comp. Econom. Cybernet. Stud. Res., no. 2, 91–101. MR 57 #18781.
Basile, A.; Brutti, P. (1971) “Alcuni risultati sui {q(n-l)+l;n}-archi di un piano proiettivo finito.” Rend. Sem. Mat. Univ. Padova 46, 107–125. MR 47.1 3205.
Bass, D.W. (1972) “Graphical representation of finite topological spaces.” Ann. Soc. Sci. Bruxelles Ser. I 86, 193–200. MR 46.1 3343.
Bass, Hyman (1976) “Some remarks on group actions on trees.” Comm. Algebra 4, no. 12, 1091–1126. MR 54.2 7634.
Basu, Sanat K. (1970) “Transformations on directed graphs.” J. Combinatorial Theory 9, 244–256. MR 46.1 86.
Batagelj, V.; Pisanski, T. (1979) “On partially directed Eulerian multigraphs.” Publ. Inst. Math. (Beograd) (N.S.) 25 (39), 16–24. MR 81a:05054.
Bauer, Douglas; Tindell, Ralph (1979) “Graphs with prescribed connectivity and line graph connectivity.” J. Graph Theory 3, no. 4, 393–395. MR 80j:05083.
Bauer, Douglas (1977) “On regular line graphs .” Topics in graph theory (New York), pp. 30–31, Ann. New York Acad. Sci., 328, New York Acad. Sci., New York, 1979 MR 81b:05070.
Bauer, Douglas (1980) “Line-graphical degree sequences.” J. Graph Theory 4, no. 2, 219–232. MR 81k:05061.
Bauer, Friedrich-Wilhelm (1962) “Dimensionstheorie und differenzierbare Mannigfaltigkeiten.” Ann. Inst. Fourier (Grenoble) 12, 231–291. MR 28.1 1619.
Baumert, L.D. (1966) “Extreme copositive quadratic forms.” Pacific J. Math. 19, 197–204. MR 36.2 5155.
Baumert, Leonard; Hall, Marshall, Jr. (1973) “Nonexistence of certain planes of order 10 and 12.” J. Combinatorial Theory Ser. A 14, 273–280. MR 47.1 3206
Bautz, Manfred; Clauder, Ulf; Spathe, Eberhard (1977) “Notwendige Bedingungen fur Kreismatrizen gerichteter Graphen.” Wiss. Z. Techn. Hochsch. Leuna-Merseburg 19, no. 1, 118–122. MR 57.1 171.
Bautz, Manfred (1981) “Uber eine Klasse spezieller schlichter, stark zusammenhangender Graphen. [On a class of special schlicht, strongly connected graphs].” Wiss. Z. Tech. Hochsch. Leuna-Merseburg 23, no. 3–4, 477–486. MR 83f:05024.
Beach, B. (1972) “Immediate predominators in a directed graph.” Proceedings of the Second Manitoba Conference on Numerical Mathematics (Univ. Manitoba, Winnipeg, Man.), pp. 73–79. Congressus Numeratium, No. VII, Utilitas Math., Winnipeg, Man., 1973. MR 50.2 9673.
Bean, D.T. (1972) “A finitary matroid without a proper finitary refinement.” J. Korean Math. Soc. 9, 13–14. MR 46.2 5149.
Beck, Jozsef (1981) “Roth’s estimate of the discrepancy of integer-sequences is nearly sharp.” Combinatorica 1, no. 4, 319–325. MR 83i:05040.
Bedrosian, Samuel D. (1981) “Tree counting polynomials for labelled graphs. I. Properties.” J. Franklin Inst. 312, no. 6, 417–430. MR 83a:05052.
Behzad, Mehdi; Chartrand, Gary (1966/67) “Total graphs and traversability.” Proc. Edinburgh Math. Soc. (2) 15, 117–120. MR 36.1 1351.
Behzad, M.; Mahmoodian, S.E. (1969) “On topological invariants of the product of graphs.” Canad. Math. Bull. 12, 157–166. MR 39.2 5393.
Behzad, Mehdi; Chartrand, Gary; Wall, Curtiss E. (1970) “On minimal regular digraphs with given girth.” Fund. Math. 69, 227–231. MR 44.1 2666.
Behzad, Mehdi (1973) “Minimal 2-regular digraphs with given girth.” J. Math. Soc. Japan 25, 1–6. MR 46.2 8889.
Behzad, M.; Radjavi, H. (1976) “Chromatic numbers of infinite graphs.” J. Combinatorial Theory Ser. B 21, no. 3, 195–200. MR 56.1 2859.
Behzad, M.; Harary, F. (1977) “Which directed graphs have a solution?” (Russian summary), Math. Slovaca 27, no. 1, 37–42. MR 57 #9590.
Behzad, Mehdi; Chartrand, Gary; Lesniak-Foster, Linda (1979) “Graphs & digraphs.” Prindle, Weber & Schmidt, Boston, Mass., x+406 pp. MR 80f:05019.
Beineke, L.W. (1966) “Topological aspects of complete graphs.” Theory of Graphs (Proc. Colloq., Tihany), pp. 19–26. Academic Press, New York, 1968. MR 38.1 1025.
Beineke, L.W.; Pippert, R.E. (1969) “Minimal regular extensions of oriented graphs.” Amer. Math. Monthly 76, 145–151. MR 39.1 91.
Beineke, Lowell W.; Harary, Frank (1965) “The maximum number of strongly connected subtournaments.” Canad. Math. Bull. 8, 491–498. MR 31.2 5810.
Beineke, Lowell W.; Hemminger, Robert L. (1976) “Infinite digraphs isomorphic with their line digraphs.” J. Combinatorial Theory Ser. B 21, no. 3, 245–256. MR 58 #5339.
Beineke, Lowell W.; Harary, Frank (1978) “Consistency in marked digraphs.” J. Math. Psych. 18, no. 3, 260–269. MR 80d:05026.
Beineke, L.W.; Moon, J.W. (1980) “On bipartite tournaments and scores.” The theory and applications of graphs (Kalamazoo, Mich.), pp. 55–71, Wiley, New York, 1981. MR 83b:05066.
Beineke, Lowell W.; Zamfirescu, Christina M. (1982) “Connection digraphs and second-order line digraphs.” Discrete Math. 39, no. 3, 237–254. MR 83m:05065.
Beissinger, Janet Simpson (1982) “On external activity and inversions in trees.” J. Combin. Theory Ser. B 33, no. 1, 87–92. MR 83k:05041.
Bekisev, G.A . (1966) “On a problem of decomposition into classes of vertices of an oriented graph.” (Russian), Diskret. Analiz No. 8, 27–34. MR 34.2 4154.
Belocerkovskii, B.M.; Belocerkovskii, I.M. (1974) “Elements of the general theory of generative functions.” (Russian), Othor i Peredaca Informacii Vyp. 40, 12–26, 110. MR 55.2 7797.
Belousov, V.D.; Ryzkov, V.V. (1972) “The geometry of webs.” (Russian), Algebra. Topology, Geometry, Vol. 10 (Russian), pp. 159–188, 191. Akad. Nauk SSSR Vsesojuz. Inst. Naucn. i Tehn. Informacii, Moscow. MR 50.1 8318.
Beltrametti, E.G. (1969) “Lorentz transformations and symmetry properties in Galois space-time.” Combinatorial theory and its Applications, I (Proc. Colloq., Balatonfured), pp. 105–117. North-Holland, Amsterdam, 1970. MR 45.2 6349.
Benard, Dominique; Bouchet, Andre (1976) “Some cases of triangular imbeddings for kn(m).” J. Combinatorial Theory Ser. B 21, no. 3, 257–269. MR 56.1
Benard, Dominique (1978) “Orientable imbedding of line graphs.” J. Combinatorial Theory Ser. B 24, no. 1, 34–43. MR 58 #5312.
Bender, Edward A.; Tucker, Thomas W. (1969) “The exponents of strongly connected graphs.” Canad. J. Math. 21, 769–782. MR 39.2 6766.
Bender, E.A.; Goldman, J.R. (1975) “On the applications of Mobius inversion in combinatorial analysis.” Amer. Math. Monthly 82, no. 8, 789–803. MR 51.2 12536.
Benhocine, A . (1978) “Nombres de Ramsey dans le cas oriente.” (English summary), Discrete Math. 22, no. 3, 213–217. MR 80a:05145.
Benzaken, C.; Hammer, P.L. (1977) “Linear separation of dominating sets in graphs.” Advances in graph theory (Cambridge Combinatorial Conf., Trinity College, Cambridge). Ann. Discrete Math. 3, 1–10, 1978. MR 58 #10603.
Benzaken, C . (1979) “Hypergraphes critiques pour le nombre chromatique et conjecture de Lovasz.” (English summary), Combinatorics 79 (Proc. Colloq., Univ. Montreal, Montreal, Que.), Part I. Ann. Discrete Math. 8, 91–100, 1980. MR 81m:05100.
Benzaken, C. (1978) “Post’s closed systems and the weak chromatic number of hypergraphs.” Discrete Math. 23, no. 2, 77–84. MR 80a:05154.
Beresina, L. Ja. (1979) “Applications of the theory of surfaces to the theory of graphs.” Geometry and differential geometry (Proc. Conf., Univ. Haifa, Haifa), pp. 20–23, Lecture Notes in Math., 792, Springer, Berlin, 1980. MR 81j:05053.
Berge, Anne-Marie (1971) “Sue l’arithmetique des extensions diedrales.” C.R. Acad. Sci. Paris Sur. A-B 272, A1221–A1223. MR 43.1 3249.
Berge, C. (1967) “Some classes of perfect graphs.” Graph Theory and Theoretical Physics, pp$1155–165. Academic Press, London. MR 38. 1 1017.
Berge, C. (1967) “Some classes of perfect graphs. (With discussion).” Combinatorial Mathematics and its Applications (Proc. Conf., Univ. North Carolina, Chapel Hill, N.C.), pp. 539–552. Univ. North Carolina Press, Chapel Hill, N.C., 1969. MR 42.1 100.
Berge, C. (1971) “Sur une extension de la theorie des matrices bi-stochastiques.” (English summary), Studi di probabilita, statistica e ricerca operativa in onore di Giuseppe Pompilj, pp. 475–482. Edizioni Oderisi, Gubbio. MR 51.1 5321.
Berge, C.; Rado, R. (1972) “Note on isomorphic hypergraphs and some extensions of Whitney’s theorem to families of sets.” J. Combinatorial Theory Ser. B 13, 226–241. MR 47.1 72.
Berge, C. (1973) “Nouvelles extensions du noyau d’un graphe et ses applications en theorie des jeux.” Publ. Econometriques 6, 6–11. MR 52.2 10479.
Berge, Claude (1973) “Graphs and hypergraphs.” Translated from the French by Edward Minieka. North-Holland Mathematical Library, Vol. 6. North-Holland Publishing Co., Amsterdam-London; American Elsevier Publishing Co., Inc., New York, xiv+528 pp. MR 50.2 9640.
Berge, C.; Simonovits, M. (1972) “The coloring numbers of the direct product of two hypergraphs.” Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio; dedicated to Arnold Ross), pp. 21–33. Lecture Notes in Math., Vol. 411, Springer, Berlin, 1974. MR 51.1 2989
Berge, Claude; Ray-Chaudhuri, Dijen (Editors) (1972) “Hypergraph Seminar.” Proceedings of the First Working Seminar on Hypergraphs, held at Ohio State University, Columbus, Ohio. MR 50.1 1945.
Berge, C.; Duchet, P. (1974) “A generalization of Gilmore’s theorem.” Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague), pp. 49–55. Academia, Prague, 1975. MR 53.2 10587.
Berge, C.; Duchet, P. (1974) “Une generalisation du theoreme de Gilmore.” Colloque sur la Theorie des Graphes (Paris). Cahiers Centre Etudes Recherche Oper. 17 (1975), no. 2–3–4, 117–123. MR 53.1 145.
Berge, Claude (1975) “Perfect graphs.” Studies in graph theory, Part I, pp. 1–22. Studies in Math., Vol. 11, Math. Assoc. Amer., Washington, D.C. MR 53.2 10585.
Berge, Claude (1976) “The multicolourings of graphs and hypergraphs.” (Arabic summary), J. Univ. Kuwait Sci. 3, 1–6. MR 58 #5322.
Berge, C . (1976) “Multicolorings.” Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely), Vol. I, pp. 121–133, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 80c:05104.
Berge, C. (1980) “Les graphes d’intervalles. [Interval graphs].” A look at graph theory (Proc. Colloq., Cerisy) (French), pp. 1–9, Presses Polytech. Romandes, Lausanne.
Berge, C. (1982) “k-Optimal partitions of a directed graph.” Europ. J. Comb. 3, 97–101.
Berge, C . (1983) “Path partitions in directed graphs.” Annals of Disc. Math., 59–63.
Berggren, J.L. (1972) “An algebraic characterization of finite symmetric tournaments.” Bull. Austral. Math. Soc. 6, 53–59. MR 45.1 118.
Bergmann, Horst (1982) “Ein Planaritatskriterium fur endliche Graphe. [A planarity criterion for finite graphs].” Elem. Math. 37, no. 2, 49–51. MR 83g:05031.
Bergthaller, Cristian; Dragomirescu, Mihai (1971) “On the workability of Leontief systems.” Rev. Roumaine Math. Pures appl. 16, 1017–1022. MR 45.2 6377.
Berkowitz, H.W. (1978) “Restricted Eulerian circuits in directed graphs.” Colloq. Math. 39, no. 1, 185–188. MR 80c:05074.
Berman, Abraham; Kotzig, Anton (1979) “The order of cyclicity of bipartite tournaments and (0,1) matrices.” Kyungpook Math. J. 19, no. 1, 127–134. MR 81a:05088.
Berman, David M . (1975) “On the number of 5-cycles in a tournament.” Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 101–108. Congressus Numerantium, No. XIV, Utilitas Math., Winnipeg, Man. MR 53.2 7845.
Berman, Gerald (1977) “Frequently cited publications in pure graph theory.” J. Graph Theory 1, no. 2, 175–180. MR 56.1 168.
Bergman, Gerald (1977) “The dichromate and orientations of a graph.” Canad. J. Math. 29, no. 5, 947–956. MR 57 #9591.
Berman, Kenneth A. (1977) “Enumeration of labelled balanced 4-valent digraphs.” Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 81–89. Congressus Numerantium, No. XIX, Utilitas Math., Winnipeg, Man. MR 58 #5340.
Berman, Kenneth A. (1978) “An-Eulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths.” Discrete Math. 22, no. 1, 75–80. MR 80c:05075.
Berman, Kenneth A. (1978) “Directed f-aces in planar digraphs and unicoloured faces in edge 2-coloured planar Eulerian maps.” Discrete Math. 21, no. 1, 83–85. MR 80a:05101.
Berman, Kenneth A . (1979) “On the number of balanced orientations of even graphs.” Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 193–198, Congress. Numer., XXIII–XXIV, Utilitas Math., Winnipeg, Man. MR 8le:05084.
Berman, Kenneth A. (1979) “Spanning arborescences, ingraphs and outgraphs.” J. Graph Theory 3, no. 2, 141–150. MR 80h:05027
Berman, Kenneth A. (1980) “A graph-theoretical approach to handicap ranking of tournaments and paired comparisons.” SIAM J. Algebraic Discrete Methods 1, no. 3, 359–361. MR 81i:05072.
Berman, Kenneth A. (1980) “A proof of Tutte’s trinity theorem and a new determinant formula.” SIAM J. Algebraic Discrete Methods 1, no. 1, 64–69. MR 81c:05042.
Bermond, J.-C . (1973) “The circuit-hypergraph of a tournament.” Infinite and finite sets (Colloq., Keszthely; dedicated to P. Erdos on his 60th birthday), Vol. I, pp. 165–180. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR 53.1 187.
Bermond, J.C.; Faber, V. (1976) “Decomposition of the complete directed graph into k-circuits.” J. Combinatorial Theory Ser. B 21, no. 2, 146–155. MR 55.1 2638
Bermond, J.-C.; Frankl, P.; Sterboul, F. (1980) “On the maximum number of edges in a hypergraph whose linegraph contains no cycle.” (French summary), Discrete Math. 30, no. 3, 295–298. MR 81i:05103.
Bermond, J.-C.; Thomassen, C. (1981) “Cycles in digraphs—a survey.” J. Graph Theory 5, no. 1, 1–43. MR 82k:05053.
Bermond, Jean-Claude (1970) “Graphes orientes fortement k-connexes et graphes “k arc hamiltoniens”.” C.R. Acad. Sci. Paris Ser. A-B 271, A141–A144.MR 42.2 4442.
Bermond, J.-C. (1972) “Ordres a distance minimum d’un tournoi et graphes partiels san circuits maximaux.” Math. Sci. Humaines No. 37, 5–25. MR 46.1 87.
Bermond, J.C. (1974) “Some Ramsey numbers for directed graphs.” Discrete Math. 9, 313–321. MR 54.1 5029.
Bermond, J.C . (1974) “An application of the solution of Kirkman’s schoolgirl problem: the decomposition of the symmetric oriented complete graph into 3-circuits.” Discrete Math. 8, 301–304. MR 49.1 4850.
Bermond, J.C . (1974) “1-graphes reguliers minimaux de girth donne.” (English summary), Colloque sur la Theorie des Graphes (Paris). Cahiers Centre Etudes Recherche Oper. 17 (1975), no. 2–3–4, 125–135. MR 53.2 7846.
Bermond, J.-C.; Kodratoff, Y. (1976) “Une heuristique pour le calcul de l’indice de transitivite d’un tournoi.” (Loose English summary), Rev. Francaise Automat. Informat. Recherche Operationnelle Ser. Rough Informat. Theor. 10, no. R-1, 83–92. MR 54.1 5033.
Bermond, J.C.; Heydemann, M.C.; Sotteau, D. (1977) “Line graphs of hypergraphs. I.” Discrete Math. 18, no. 3, 235–241. MR 57.1 2967.
Bermond, J.-C . (1978) “Graceful graphs, radio antennae and French windmills.” Graph theory and combinatorics (Proc. Conf., Open Univ., Milton Keynes), pp. 18–37, Res. Notes in Math., 34, Pitman, San Francisco, Calif., 1979. MR 81i:05109.
Bermond, J.-C.; Germa, A.; Sotteau, D. (1979) “Resolvable decomposition of Kn*.” J. Combin. Theory Ser. A 26, no. 2, 179–185. MR 80k:05083.
Bermond, J.-C.; Simoes-Pereira, J.M.S.; Zamfirescu, Christina M. (1979/80) “On non-Hamiltonian homogeneously traceable digraphs.” Math. Japon. 24, no. 4, 423–425. MR 82d:05063.
Bermond, J.-C.; Germa, A.; Heydemann, M.C.; Sotteau, D. (1980) “Girth in digraphs.” J. Graph Theory 4, no. 3, 337–341. MR 81i:05073.
Bermond, J.C.; Sotteau, D.; Germa, A.; Heydemann, M.C. (1979) “Chemins et circuits dans les graphes orientes.” (English summary), Combinatorics 79 (Proc. Colloq., Univ. Montreal, Montreal, Que.), Part I. MR 82g:05056.
Best, M.R. (1970) “The distribution of some variables on symmetric groups.” Nederl. Akad. Wetensch. Proc. Ser. A 73 = Indag. Math. 32, 385–402. MR 45.1 2003.
Bhargava, T.N. (1965) “On time changes in a digraph.” J. Appl. Probability 2, 101–118. MR 31.1 1207.
Bhargava, T.N.; Ahlborn, T.J. (1968) “On topological spaces associated with digraphs.” Acta Math. Acad. Sci. Hungar. 19, 47–52. MR 36.2 5025.
Bhargava, T.N.; Edelman, Joel E. (1968) “Some topological properties of covered spaces and digraphs.” Proc. Internat. Sympos. on Topology and its Applications (herceg-Novi), pp. 81–86. Savez Drustava Mat. Fiz. i Astronom., Belgrade, 1969. MR 42.2 4443.
Bhat, Kabekode V.S. (1980) “Refined vertex codes and vertex partitioning methodology for graph isomorphism testing.” IEEE Trans. Systems Man Cybernet. 10, no. 10, 610–615. MR 81k:05086.
Bhat, Kabekode V.S . (1981/82) “A representation of bipartite graphs by digraphs and its programming application.” Internat. J. Comput. Math. 10, no. 1, 15–16. MR 82m:05050.
Biess, Gunther; Janicke, Winfried; Meissler, H.G. (1977) “Ein Algorithmus zur Bestimmung aller Elementarkreise eines gerichteten Graphen.” Wiss. Z. Techn. Hochsch. Leuna-Merseburg 19, no. 1, 103–111. MR 56.2 8413.
Bigalke, Anton; Kohler, Norbert (1977) “Zerlegung des vollstandigen Graphen der Ordnung n in gewisse Fastlinearfaktoren.” Arch. Math. (Basel) 28, no. 2, 221–224. MR 57.1 5810.
Bigalke, Anton; Kohler, Norbert (1979) “Antigerichtete Hamiltonlinien in vollstandig gerichteten Graphen.” Abh. Math. Sem. Univ. Hamburg 48, 114–117. MR 80m:05049.
Biggs, Norman (1971) “Classification of complete maps on orientable surfaces.” Rend. Mat. (6) 4, 645–655 (1972). MR 48.1 140.
Biggs, Norman (1974) “Algebraic graph theory.” Cambridge Tracts in Mathematics, No. 67. Cambridge University Press, London, vii+170 pp. MR 50.1 151.
Biggs, R.G.; Rankin, S.A.; Reis, C.M. (1976) “A study of graph closed subsemigroups of a full transformation semigroup.” Trans. Amer. Math. Soc. 219, 211–223. MR 53.2 8304.
Billington, David (1981) “The graph of hypergraphic realisations of denumerable multisets of degrees.” Combinatorial mathematics, IX (Brisbane), pp. 150–181, Lecture Notes in Math., 952, Springer, Berlin-New York, 1982. MR 83j:05063.
Billington, Elizabeth J.; Oates-Williams, Sheila; Street, Anne Penfold (Editors) (1981) “Combinatorial mathematics. IX.” Proceedings of the Ninth Australian Conference held at the University of Queensland, Brisbane, August 24–28, 1981. MR 83i:05003.
Bixby, Robert E. (1974) “ℓ-matrices and a characterization of binary matroids.” Discrete Math. 8, 139–145. MR 49.1 2430.
Bixby, Robert E. (1976) “A strengthened form of Tutte’s characterization of regular matroids.” J. Combinatorial Theory Ser. B 20, no. 3, 216–221. MR 53.2 10622.
Bixby, Robert E. (1975) “A composition for matroids.” J. Combinatorial Theory Ser. B 18, 59–72. MR 56.1 164.
Bixby, Robert E.; Cunningham, William H. (1977) “Matroids, graphs, and 3-connectivity.” Graph theory and related topics (Proc. Conf., Univ. Waterloo, Waterloo, Ont.), pp. 91–103, Academic Press, New York, 1979. MR 81e:05053.
Blanc, Georges (1975) “Langages du premier ordre sur graphes et theorie sur categorie.” Cahiers Mathematiques, No. 6. U.E.R. de Mathematiques, Universite des Sciences et Techniques du Languedoc, Montpellier, 66 pp. MR 56.2 13797.
Bland, Robert G. (1977) “A combinatorial abstraction of linear programming.” J. Combinatorial Theory Ser. B 23, no. 1, 33–57. MR 57.1 5793.
Bland, R.G.; Huang, H.C.; Trotter, L.E., Jr. (1979) “Graphical properties related to minimal imperfection.” Discrete Math. 27, no. 1, 11–22. MR 80g:05034.
Blower, Paul E., Jr. (1981) “The direct power of a 1-graph.” J. Combin. Theory Ser. B 31, no. 1, 62–74. MR 83b:05067.
Bodendiek, R.; Schumacher, H.; Wagner, K. (1981) “Uber Relationen auf Graphenmengen. [Relations on sets of graphs].” Abb. Math. Sem. Univ. Hamburg 51, 232–243. MR 83b:05067.
Boesch, F.T.; Gimpel, J.F. (1977) “Covering the points of a digraph with point-disjoint paths and its application to code optimization.” J. Assoc. Comput. Mach. 24, no. 2, 192–198. MR 56.1 4781.
Bognar, M. (1972) “Uber Kategorien mit involution.” Acta Math. Acad. Sci. Hungar. 23, 147–174. MR 48.1 374.
Bogomolov, S.A. (1978) “Minimal identifiers of the vertices of a graph.” (Russian), Discrete systems, formal languages and complexity of algorithms (Russian), pp. 10–17, Inst. Kibernet., Akad. Nauk Ukrain. SSR, Kiev. MR 80e:05060.
Bollobas, Bela (1973) “Sperner systems consisting of pairs of complementary subsets.” J. Combinatorial Theory Ser. A 15, 363–366. MR 48.1 5867.
Bollobas, B.; Milner, E.C. (1973) “A theorem in transversal theory.” Bull. London Math. Soc. 5, 267–270. MR 49.1 52.
Bollobas, Bela (1978) “Extremal graph theory.” London Mathematical Society Monographs, 11. Academic Press [Harcourt Brace Jovanovich, Publishers], London-New York, xx+488 pp. MR 80a:05120.
Bollobas, Bela; Rival, Ivan (1979) “The maximal size of the covering graph of a lattice.” Algebra Universalis 9, no. 3, 371–373. MR 81g:05088.
Bollobas, B.; Thomason, A. (1979) “Set colorings of graphs.” Discrete Math., 25, 21–26.
Bollobas, Bela (Editor) (1979) “Surveys in combinatorics.” Proceedings of the Seventh British Combinatorial Conference held in Cambridge, August 13–17, 1979. MR 81b:05005.
Bollobas, Bela (1980) “Measure graphs.” J. London Math. Soc. (2) 21, no. 3, 401–412. MR 82g:05077.
Bollobas, Bela (1981) “Random graphs.” Combinatorics (Swansea), pp. 80–102, London Math. Soc. Lecture Note Ser., 52, Cambridge Univ. Press, Cambridge. MR 83e:05039.
Bollobas, Bela (1982) “Vertices of given degree in a random graph.” J. Graph Theory 6, no. 2, 147–155. MR 83f:05066.
Bollobas, Bela (Editor) (1981) “Graph theory.” Proceedings of the Conference held at the University of Cambridge, Cambridge, March 11–13, 1981. MR 83i:05004.
Bollobas, Bela (1982) “The asymptotic number of unlabelled regular graphs.” J. London Math. Soc. (2) 26, no. 2, 201–206. MR 83j:05038.
Bolsakov, V.I. (1976) “Generalized weighted compositions.” (Russian), Kombinatornyi Anal. Vyp. 4, 96–104. MR 56.2 11810.
Bondy, J.A. (1969) “On the reconstruction of a graph from its closure function.” J. Combinatorial Theory 7, 221–229. MR 40.1 2654.
Bondy, J.A.; Hemminger, R.L. (1974) “Almost reconstructing infinite graphs.” Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague), pp. 69–73. Academia, Prague, 1975. MR 52.1 5480.
Bondy, J.A . (1975) “Balanced colourings and graph orientation.” Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 109–114. Congressus Numerantium, No. XIV, Utilitas Math., Winnipeg, Man. MR 53.2 13014.
Bondy, J.A.; Murty, U.S.R. (1976) “Graph theory with applications.” American Elsevier Publishing co ., Inc., New York, x+264 pp. MR 54.1 117.
Bondy, J.A. (1976) “Diconnected orientations and a conjecture of Las Vergnas.” J. London Math. Soc. (2) 14, no. 2, 277–282. MR 56.2 8414.
Bondy, J.A.; Thomassen, C. (1977) “A short proof of Meyniel’s theorem.” Discrete Math. 19, no. 2, 195–197. MR 57.1 5811.
Bondy, J.A . (1978) “Hamilton cycles in graphs and digraphs.” Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 3–28, Congress. Numer., XXI, Utilitas Math., Winnipeg, Man. MR 80k:05074.
Bondy, John Adrian; Murty, U.S.R. (Editors) (1977) “Graph theory and related topics.” Proceedings of the Conference in honour of Professor W.T. Tutte on the occasion of his sixtieth birthday, held at the University of Waterloo, Waterloo, Ont., July 5–9, 1977. MR 80e:05004.
Booker, Aaron (1965) “Numerical evaluation of symmetric polynomials.” J. Assoc. Comput. Mach. 12, 90–94. MR 30.1 695.
Boorman, Scott A.; Olivier, Donald C. (1973) “Metrics on space of finite trees.” J. Mathematical Psychology 10, 26–59. MR 47. 2 6524.
Borevic, Z.I.; Venslav, V. [Wieslaw, Witold]; Dobrovolskii, E. [Dobrowolski, E.]; Rodionov, V.I. (1978) “The number of labeled topologies on nine points.” (Russian), Rings and linear groups. Zap. Naucn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 75, 35–42, 195. MR 80e:0501
Borevic, Z.I.; Bumagin, V.V.; Rodionov, V.I. (1979) “The number of labeled topologies on ten points.” (Russian). Algebraic numbers and finite groups. Zap. Naucn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 86, 5–10, 188. MR 80f:05004.
Borevich, Z.I . (1980) “On the periodicity of residues of the number of finite labeled topologies.” (Russian). Modules and linear groups. Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 103, 5–12, 155. MR 83a:05015.
Borevich, Z.I . (1982) “Periodicity of residues of the number of finite labeled T0-topologies.” (Russian), Modules and algebraic groups. Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 114, 32–36, 217. MR 83k:05004a.
Borges, R. (1973) “On the principle of inclusion and exclusion.” Period. Math. Hungar. 3, 149–156. MR 48.1 5868.
Borowiecki, M.; Szamkolowicz, L. (1970) “Remarques sur la construction des graphes symetriques.” Comment. Math. Prace Mat. 13, 249–253. MR 41.2 8301.
Borowiecki, Mieczyslaw (1977) “On the graphs with minimaximal kernels.” (Polish and Russian summaries), Prace. Nauk, Inst. Mat. Politech. Wroclaw. No. 17 Ser. Stud.I Materialy No. 13, 3–7. MR 57 #12296.
Bories, Francette; Jolivet, Jean-Loup (1974) “On complete colorings of graphs.” Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague), pp. 75–87. Academia, Prague, 1975.
Borzacchini, L. (1980) “Lattice constants matricial equations for conversion matrices.” Calcolo 17, no. 4, 379–384 (1981).
Bosak, Juraj (1962) “The investigation of graphs by means of matrices.” (Slovak. Russian and English summaries), Casopis Pest. Mat. 87, 284–289. MR 31.2 4734.
Bosak, Juraj (1962) “On a certain class of oriented graphs.” (Slovak. Russian and English summaries), Mat.-Fyz. Casopis Sloven. Akad. Vied 12, 81–84. MR 28.1 1617.
Bosak, Juraj (1974) “Graphs of algebras and algebraic graphs.” Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague), pp. 93–98. Academia, Prague, 1975.
Bosak, Juraj (1978) “Directed graphs and matrix equations.” (Russian summary), Math. Slovaca 28, no. 2 189–202. MR 8la:05089.
Bosak, J . (1976) “Geodetic graphs.” Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely), Vol. I, pp. 151-172, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 80d:05031.
Bosak, Juraj (1976) “Graphs with unique walks, trails or paths of given lengths.” Theory and applications of graphs (Proc. Internat. Conf., Western Mich. Univ., Kalamazoo, Mich.), pp. 75–85, Lecture Notes in Math., 642, Springer, Berlin, 1978. MR 80a:05126.
Bosak, Juraj (1979) “Partially directed Moore graphs.” (Russian summary), Math. Slovaca 29, no. 2, 181–196. MR 81j:05083.
Bose, R.C. (1970) “Coordinatization of a class of projective planes which can be linearly represented in a projective space of four dimensions.” Proc. Second Chapel Hill Conf. on Combinatorial Mathematics and its Applications (Univ. North Carolina, Chapel Hill, N.C. ), pp. 37–56.
Bosserman, Robert W.; Harary, Frank (1981) “Demiarcs, creaons and genons.” J. Theoret. Biol. 92, no. 3, 241–254. MR 83b:05068.
Both, N . (1982) “Standard coverings.” (Romanian. English summary), Stud. Cere. Mat. 34, no. 1, 3–7. MR 83k:05001.
Bouchet, Andre (1973) “On the Sperner lemma and some colorings of graphs.” J. Combinatorial Theory Ser. B 14, 157–162. MR 47.2 4837.
Bouchet, Andre (1975) “Immersions autoduales de graphes de Cayley dans les surfaces orientables.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 280, no. 24, Ai, A1669–A1672. MR 52.1 5458.
Bouchet, Andre (1977) “Cyclabilite des groupes additifs d’ordre impair.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 284, no. 10, A527–A530. MR 55.1 162.
Bouchet, Andre (1982) “Constructions of covering triangulations with folds.” J. Graph Theory 6, no. 1, 57–74. MR 83b:05057.
Boulaye, Guy (1968) “Sur l’ensemble ordonne des parties connexes d’un graphe connexe.” Rev. Francaise Informat. Recherche Operationnelle 2, no. 7, 13–25. MR 38.1 77.
Bowie, William S. (1976) “Applications of graph theory in computer systems.” Internat. J. Comput. Information Sci. 5, no. 1, 9–31. MR 52.2 16096.
Brace, Alan; Daykin, D.E. (1972) “Sperner type theorems for finite sets.” Combinatorics (Proc. Conf. Combinatorial Math., Math. Inst., Oxford), pp. 18–37. Inst. Math. Appl. Southend-on-Sea. MR 49.2 10561.
Brace, Alan; Daykin, D.E. (1974) “Pseudo-matchings of a bipartite graph.” Proc. Amer. Math. Soc. 42, 28–32. MR 48.2 8299.
Braemert, D. (1975) “Graph theory: a selected bibliography.” Match No. 1, 207–210. MR 54.1 118.
Bragard, Leopold (1971) “Racine carree d’un graphe oriente.” (English summary), Bull. Soc. Roy. Sci. Liege 40, 424–427. MR 46.1 88.
Bramwell, D.L.; Wilson, B.J. (1973) “The (11,3)-arcs of the Galois plane of order 5.” Proc. Cambridge Philos. soc. 74, 247–250. MR 48.1 130.
Brauer, Alfred; Gentry, Ivey C.; Shaw, Kay (1968) “A new proof of a theorem by H.G. Landau on tournament matrices.” J. Combinatorial Theory 5, 289–292. MR 38.1 66.
Bregman, Yu. Kh. (1981) “On a modification of a theorem of Erdos and Rado.” (Russian. English summary), Topological spaces and their mappings, pp. 10–13, 175, 181, Latv. Gos. Univ., Riga. MR 83i:05007.
Bridges, W.G. (1971) “The polynomial of a non-regular digraph.” Pacific J. Math. 38, 325–341. MR 47.2 6534.
Bridges, W.G.; Mena, R.A. (1981) “xk-digraphs.” J. Combin. Theory Ser. B 30, no. 2, 136–143. MR 82k:05054.
Bridges, W.G . (1980) “Some path-length properties of graphs and digraphs.” Combinatorics and graph theory (Calcutta), pp. 185–194, Lecture Notes in Math., 885, Springer, Berlin-New York, 1981. MR 83j:05059.
Broere, I . (1979) “Graph-theoretic coloring problems.” (Afrikaans. English summary), Tydskr. Natuurwetenskap. 19, no. 1, 2–11. MR 80m:05034.
Bruno, John; Weinberg, Louis (1971) “The principal minors of a matroid.” Linear Algebra and Appl. 4, 17–54. MR 45.1 92.
Brouwer, A.E . (1980) “The enumeration of locally transitive tournaments.” Afdeling Zuivere Wiskunde [Department of Pure Mathematics], 138. Mathematisch Centrum, Amsterdam. ii+6 pp. MR 81j-.05068.
Brown, A.B.; Cairns, S.S. (1961) “Strengthening of Sperner’s lemma applied to homology theory.” Proc. Nat. Acad. Sci. U.S.A. 47, 113–114. MR 26.2 4351.
Brown, David P. (1968) “Topological properties of resistance matrices.” SIAM J. Appl. Math. 16, 387–394. MR 38.1 78.
Brown, T.C. (1975) “A proof of Sperner’s lemma via Hall’s theorem.” Math. Proc. Cambridge Philos. Soc. 78, no. 3, 387. MR 52.1 2900.
Brown, T.C. (1975) “Variations on van der Waerden’s and Ramsey’s theorems.” Amer. Math. Monthly 82, no. 10, 993–995. MR 52.1 2915.
Brown, Terrence J. (1969) “A recursion formula for finite partition lattices.” Proc. Amer. Math. Soc. 22, 124–126. MR 39.1 2647.
Brown, W.G.; Harary, F. (1969) “Extremal digraphs.” Combinatorial Theory and its Applications, I (Proc. Colloq., Balatonfured), pp. 135–198. North-Holland, Amsterdam, 1970. MR 45.2 8576.
Brualdi, Richard A. (1967) “Kronecker products of fully indecomposable matrices and of ultrastrong digraphs.” J. Combinatorial Theory 2, 135–139. MR 34.2 4155.
Brualdi, Richard A.; Scrimger, Edward B. (1968) “Exchange systems, matchings, and transversals.” J. Combinatorial theory 5, 244–257. MR 38.1 55.
Brualdi, Richard A. (1969) “An extension of Banach’s mapping theorem.” Proc. Amer. Math. Soc. 20, 520–526. MR 38.2 4327.
Brualdi, Richard A. (1970) “Existence theorem for infinite integral matrices.” Mathematika 17, 91–97. MR 42.1 291.
Brualdi, Richard A. (1970) “Admissible mappings between dependence spaces.” Proc. London Math. Soc. (3) 21, 296–312. MR 43.2 6102.
Brualdi, Richard A. (1970) “Common transversals and strong exchange systems.” J. Combinatorial Theory 8, 307–329. MR 41.1 1543.
Brualdi, Richard A. (1971) “On families of finite independence structures.” Proc. London Math. Soc. (3) 22, 265–293. MR 45.2 5003.
Brualdi, R.A.; Pym, J.S. (1971) “A general linking theorem in directed graphs.” Studies in Pure Mathematics (Presented to Richard Rado), pp. 17–29. Academic Press, London. MR 42.2 7559.
Brualdi, R.A. (1971) “Induced matroids.” Proc. Amer. Math. Soc. 29, 213–221. MR 44.2 6526.
Brualdi, R.A. (1971) “Strong transfinite version of Konig’s duality theorem.” Monatsh. Math. 75, 106–110. MR 44.2 5239.
Brualdi, R.A. (1971) “Common partial transversals and integral matrices.” Trans. Amer. Math. Soc. 155, 475–592. MR 47.1 1648.
Brualdi, Richard A . (1970) “Generalized transversal theory.” Theorie des matroides (Rencontre Franco-Britannique, Brest), pp. 5–30. Lecture Notes in Math., Vol. 211, Springer, Berlin, 1971. MR 49.1 2431.
Brualdi, Richard A.; Mason, John H. (1972) “Transversal matroids and Hall’s theorem.” Pacific J. Math. 41, 601–613. MR 47.1 1647.
Brualdi, R.A. (1974) “Matroids induced by directed graphs, a survey.” Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague), pp. 115–134. Academia, Prague, 1975. MR 54.1 115.
Brualdi, Richard A. (1974) “Weighted join semilattices and transversal matroids.” Trans. Amer. Math. Soc. 191, 317–328. MR 52.1 2927.
Brualdi, Richard A.; Harary, Frank; Miller, Zevi (1980) “Bigraphs versus digraphs via matrices.” J. Graph Theory 4, no. 1, 51–73. MR 81b:05077.
Brualdi, Richard A. (1977) “Convex polyhedra of double stochastic matrices. II. Graph of Ωn.” J. Combinatorial Theory Ser. B 22, no. 2, 175–198. MR 55.2 10487.
Brualdi, Richard A. (1980) “On 1-factors of cubic bipartite graphs.” Ars combin. 9, 211–219. MR 81h:05098.
Brualdi, Richard A.; Shanny, Robert F. (1981) “Hamiltonian line graphs.” J. Graph Theory 5, no. 3, 307–314. MR 83b:05088.
Bruck, R.H . (1972) “Construction problems in finite projective spaces.” Finite geometric structures and their applications (C.I.M.E., II Ciclo, Bressanone), pp. 105–188. Edizioni Cremonese, Rome, 1973. MR 49.2 7159.
Brucker, Peter (1974) “Theory of matrix algorithms.” Mathematical Systems in Economics, No. 13. Verlag Anton Hain, Meisenheim am Glan. vii+109 pp. MR 52.1 5216.
Brudnyi, Ju. A.; Kotljar, B.D. (1970) “A certain problem of combinatorial geometry.” (Russian), Sibirsk. Mat. Z. 11, 1171–1173, 1199. MR 42.2 5160.
Bruijning, J . (1973) “Characterization of In and I∞ using the graph theoretical representation of J. de Groot.” Topological structures (Proc. Sympos. in honour of Johannes de Groot, Amsterdam), pp. 38–47. Math. Centre Tracts, No. 52, Math. Centrum, Amsterdam, 1974. MR 51.1 9036.
Bruno, J.; Weinberg, L. (1976) “Generalized networks: networks embedded on a matroid. I.” Networks 6, no. 1, 53–94. MR 52.2 16870.
Bruter, C.P. (1969) “An algebraic structure for graphs on the factorization of groupoids.” Amer. Math. Monthly 76, 658–661. MR 40.1 1295.
Bruter, Claude P. (1969) “Vue d’ensemble sur la theorie des matroides.” Bull. Soc. Math. France Suppl. Mem. 17, 48 pp. MR 41.2 8265.
Bruter, C.P . (Editor) (1970) “Theorie des matroides.” Actes du Rencontre Franco-Britannique, Brest, 14-15 Mai. Lecture Notes in Mathematics, Vol. 211. Springer-Verlag, Berlin-New York, 1971. iii+108 pp. MR 48.1 135.
Bryant, Roger M. (1971) “On a conjecture concerning the reconstruction of graphs.” J. Combinatorial Theory Ser. B 11, 139–141. MR 43.2 6114.
Bryant, V.W.; Harris, K.G. (1975) “Transitive graphs.” J. London Math. Soc. (2) 11, no. 1, 123–128. MR 55.1 5476.
Bryant, Victor; Perfect, Hazel (1980) “Independence theory in combinatorics.” Chapman & Hall, London-New York, xii+144 pp. MR 82d:05001.
Brylawski, Thomas H . (1971) “The Mobius function on geometric lattices as a decomposition invariant.” Mobius algebras (Proc. Conf., Univ. Waterloo, Waterloo, Ont.), pp. 143–148. MR 52.1 151.
Brylawski, Thomas (1973) “The lattice of integer partitions.” Discrete Math. 6, 201–219. MR 48.1 3752.
Brylawski, Thomas H . (1973) “Reconstructing combinatorial geometries.” Graphs and combinatorics (Proc. Capital Conf. on Graph Theory and Combinatorics, George Washington Univ., Washington, D.C.), pp. 226–235. Lecture Notes in Math., Vol. 406, Springer, Berlin, 1974. MR 51.1 5345.
Brylawski, Thomas H. (1975) “An affine representation for transversal geometries.” Studies in Appl. Math. 54, no. 2, 143–160. MR 57.1 2956.
Brylawski, Tom (1975) “Modular constructions for combinatorial geometries.” Trans. Amer. Math. Soc. 203, 1–44. MR 50.2 9631.
Buckley, Fred (1982) “Atoll decompositions of graphs.” J. Graph Theory 6, no. 3, 317–324. MR 83j:05050.
Buekenhout, Francis; Deherder, Roger (1971) “Espaces lineaires finis a plans isomorphes.” Bull. Soc. Math. Belg. 23, 348–359. MR 48.1 131.
Buekenhout, Francis (1979) “Separation and dimension in a graph.” Geom. Dedicata 8, no. 3, 297–298. MR 80j:05078.
Bumby, R.; Fisher, R.; Levinson, H.; Silverman, R. [Silverman, Ruth] (1978) “Topologies on finite sets.” Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 163–170, Congress. Numer., XXI, Utilitas Math., Winnipeg, Man. MR 80h:05008.
Bumcrot, Robert J. (1973) “An index to papers in Finite geometries.” Proc. Internat. Conf. Projective Planes (Washington State Univ., Pullman, Wash.), pp. 7–25. Washington State Univ. Press, Pullman, Wash. MR 50.1 8283.
Burdjuk, V.Ja.; Kahicko, A.A.; Scerbak, V.V. (1978) “The construction of Hamiltonian paths in tournaments.” (Russian. English summary insert), Kibernetika (Kiev), no. 2, 65–68. MR 58 #10571.
Burkov, V.N.; Groppen, V.O. (1975) “Maximal circulation and minimal cut on planar digraphs.” (Russian. English summary insert), Kibernetika (Kiev), no. 6, 85–89. MR 58 #5341.
Burmeister, Peter (1981) “On maximal objects in classes of (di)graphs determined by prescribed factor/objects.” Discrete Math. 35, 17–23. MR 83i:05065.
Burosh, G. [Burosch, Gustav]; Drevs, K.-D. [Drews, Klaus-Dieter]; Leontev, V.K. (1982) “A problem of Sperner type.” (Russian), Zh. Vychisl. Mat. i Mat. Fiz. 22, no. 3, 710–716, 767. MR 83k:05005.
Burosh, Gustav [Burosch, Gustav]; Lau, Ditlinde [Lau, Dietlinde]; Shmidt, Eberkhard [Schmidt, Eberhard] (1982) “Chromatic sets and classes of monotone functions”. (Russian. English and Hungarian summaries), Kozl.-MTA Szamitastech. Automat. Kutato Int. Budapest No. 25, 5–23. MR 83m:05105.
Burr, Stefan a.; Grunbaum, Branko; Sloane, N.J.A. (1974) “The orchard problem.” Geometriae Dedicata 2, 397–424. MR 49.1 2428.
Burscheid, H.J. (1979) “Zur Vorgabe gerichteter Kanten von Vergleichbarkeitsgraphen.” Math. Nachr. 91, 321–325. MR 81e:05113.
Burstein, M.I . (1979) “Every 4-valent graph has an acyclic 5-coloring.” (Russian. Georgian and English summaries), Soobsc. Akad. Nauk Gruzin. SSR 93, no. 1, 21–24. MR 80m:05035.
Burtin, Y.D. [Burtin, Ju. D.] (1980) “On a simple formula for random mappings and its applications.” J. Appl. Probabl. 17, no. 2, 403–414. MR 82a:05076.
Busacker, Robert G.; Saaty, Thomas L. (1965) “Finite graphs and networks: An introduction with applications.” McGraw-Hill Book co., New York-Toronto-London-Sydney, xiv+294 pp. MR 35.1 79.
Butler, Kim Ki-Hang; Markowsky, George (1973) “Enumeration of finite topologies.” Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 169–184. Utilitas Math., Winnipeg, Man.
Butler, Kim Ki Hang (1974) “Combinatorial properties of binary semigroups.” Period. Math. Hungar. 5, 3–46, MR 49. 2 10806.
Butz, Lothar (1982) “Connectivity in multifactor designs.” A combinatorial approach. R&E, 3. Heldermann Verlag, Berlin, vii+190 pp. MR 83m: 05089.
Caccetta, Louis; Haggkvist, R. (1978) “On minimal digraphs with given girth.” Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing, pp. 181–187, congress. Numer., XXI, Utilitas Math., Winnipeg, Man. MR 83h:05055.
Cadogan, C.C. (1971) “The Mobius function and connected graphs.” J. Combinatorial Theory Ser. B 11, 193–200. MR 44. 1 1605.
Cadogan, C.C. (1975) “Graph-lattices and associated matrices.” Indian J. Math. 17, no. 1, 21–32. MR 82i: 05052.
Cameron, Peter J. (1973) “Primitive groups with most sub-orbits doubly transitive.” Geometriae Dedicata 1, no$14, 434–446. MR 48. 1 391.
Cameron, Peter J . (1974/75) “On groups of degree n and n-1, and highly-symmetric edge colourings.” J. London Math. Soc. (2) 9, 385–391. MR 50.2 13217.
Cameron, P.J.; Goethals, J.M.; Seidel, J.J.; Shult, E.E. (1976) “Line graphs, root systems, and elliptic geometry.” J. Algebra 43, no. 1, 305–327. MR 56. 1 182.
Cameron, P.J . (1977) “Automorphisms and cohomology of switching classes.” J. Combinatorial Theory Ser. B 22, no. 3, 297–298. MR 58 #16382.
Cameron, Peter J . (1978) “A combinatorial tool kit for permutation groups.” (Proc. Sympos. Pure Math., Ohio State Univ., Columbus, Ohio), pp. 77–96, Proc. Sympos. Pure Math., XXXIV, Amer. Math. Soc., Providence, R.I., 1979. MR80d:05001.
Cameron, Peter J. (1980) “A note on generalized line graphs.” J. Graph Theory 4, no. 2, 243–245. MR 81j: 05089.
Cameron, Peter J. (1982) “There are only finitely many finite distance-transitive graphs of given valency greater than two.” Combinatorica 2, no$11, 9–13. MR 83k: 05050.
Camion, Paul (1959) “Chemins et circuits hamiltoniens des graphes complets.” C.R. Acad. Sci. Paris 249, 2151–2152. MR 23.A A75.
Camion, Paul (1960) “Quelques proprietes des chemins et circuits hamiltoniens dans la theorie des graphes.” Cahiers Centre Etudes Rech. Oper. 2, 5–36. MR 22.1 4645.
Camion, Paul (1973) “Une propriete des circuits hamiltoniens des graphes complets anti-symetriques.” Colloque sur la Theorie des Graphs (Bruxelles). Cahiers Centre Etudes Recherche Oper. 15, 225–228. MR 50.1 170.
Canfield, E. Rodney (1978) “On a problem of Rota.” Adv. in Math. 29, no. 1, 1–10. MR 58 #265.
Cantor, David G.; Dimsdale, Bernard (1969) “On direction-preserving maps of graphs.” J. Combinatorial Theory 6, 165–176. MR 38.2 5673.
Capobianco, Michael F. (1967) “Tournaments and tensor products of digraphs.” SIAM J. Appl. Math. 15, 624–626. MR 35.2 4126.
Capobianco, Michael; Molluzzo, John C. (1978) “Examples and counterexamples in graph theory.” North-Holland, New York-Amsterdam-Oxford, xii+259 pp. MR 58 #10536.
Cardy, S. (1973) “The proof of, and generalisations to, a conjecture by Baker and Essam.” Discrete Math. 4, 101–122. MR 52.1 190.
Carfagna D’Andrea, Antonella (1976) “Sur una classe di piani metrici gruppali finiti di ordine dispari a debole struttura di incidenza.” (English summary), Rend. Mat. (6) 9, no. 3, 489–501. MR 55.2 7810.
Carre, Bernard (1979) “Graphs and networks.” The Clarendon Press, Oxford University Press, New York, xvi+277 pp. MR 81h:05001.
Cartwright, Dorwin; Harary, Frank (1961) “The number of lines in a digraph of each connectedness category.” SIAM Rev. 3, 309–314. MR 31.2 3351.
Cavalieri D’Oro, Luigi (1971) “Sui grafi orientati finiti isomorfi con 1’opposto.” (English summary), Boll. Un. Mat. Ital. (4) 4, 859–869. MR 45.2 8577.
Cavior, S.R. (1967) “Equivalence classes of sets of polynomials over a finite field.” J. Reine Angew. Math. 225, 191–202. MR 34.2 4260.
Coldberg, Myron (1970) “The group of the quadratic residue tournament.” Canad. Math. Bull. 13, 51–54. MR 41.2 6818.
“Problemes combinatoires et theorie des graphes.” Colloque International CNRS held at the Universite d’Orsay, Orsay, July 9–13, 1976. MR 80e:05005.
Cerasoli, Mauro (1979) “Binomial enumeration and compound stochastic Poisson processes.” (Italian. English summary), Boll. Un. Mat. Ital. A (5) 16, no. 2, 310–315. MR 80k:05008.
Cerasoli, Mauro (1980) “On the lattice of the stones of a graph.” J. Combin. Inform. System Sci. 5, no. 2, 134–140. MR 81m: 05114.
Chaiken, S.; Kleitman, D.J.; Li, S.-Y.R. (1978) “Possible degrees of strongly 2-connected graphs.” Second International Conference on Combinatorial Mathematics (New York), pp$1119–129, Ann. New York Acad. Sci., 319, New York Acad. Sci, New York. MR 81m: 05070.
Chan, Agnes Hui; Ray-Chaudhuri, D.K. (1979) “Characterization of “linegraph of an affine space”.” J. Combin. Theory Ser. A 26, no. 1, 48–64. MR 80m: 05020.
Chang, C.C. (1972) “A partition theorem for the complete graph on ω ω.” J. Combinatorial Theory Ser. A 12, 396–452. MR 48. 1 1930.
Chang, Lena; Poe, Arthur (1975) “Sequence covers and maps.” Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 123–131. Congressus Numerantium, No. XIV, Utilitas Math., Winnipeg, Man. MR 54.1 4992.
Chao, Chong-Yun (1963) “On a problem of C. Berge.” Proc. Amer. Math. Soc. 14, 80. MR 26. 1 1874.
Chao, Chong-Yun (1965) “On groups and graphs.” Trans. Amer. Math. Soc. 118, 488–497. MR 31. 1 1296.
Chao, Chong-yun (1967) “Some applications of a theorem of Schur to graphs and to a class of endomorphisms.” Portugal. Math. 26, 505–523. MR 41. 2 6725.
Chao, Chong-yun; Wells, Jacqueline G. (1973) “A class of vertex-transitive digraphs.” J. Combinatorial Theory Ser. B 14, 246–255. MR 47. 2 8339.
Chao, Chong Yun (1977) “On a conjecture of the semigroup of fully indecomposable relations.” (Loose Russian summary), Czechoslovak Math. J. 27(102), no. 4, 591–597. MR 56.2 8366.
Chartrand, Gary; Stewart, M. James (1966) “Total digraphs.” Canad. Math. Bull. 9, 171–176. MR 34. 1 82.
Chartrand, G.; Kronk, H.V.; Lick, Don R. (1969) “Randomly hamiltonian digraphs.” Fund. Math. 65, 223–226. MR 40. 1 57.
Chartrand, G.; Kapoor, S.F . (Editors) (1968) “The many facets of graph theory.” Proceedings of the Conference held at Western Michigan University, Kalamazoo, Mich., October 31–November 2, 1968. Lecture Notes in Mathematics, No. 110. Springer-Verlag, Berlin-New York, 1969. viii+290 pp. MR 40.2 4161.
Chartrand, Gary; Lick, Don R. (1971) “Randomly Eulerian digraphs.” Czechoslovak Math. J. 21(96), 424–430. MR 44. 2 5250.
Chartrand, Gary; Lesniak, Linda [Lesniak-Foster, Linda]; Roberts, John (1976) “Degree sets for digraphs.” Period. Math. Hungar. 7, no. 1, 77–85. MR 56.2 8415.
Chartrand, Gary (1977) “Graphs as mathematical models.” Prindle, Weber & Schmidt, Inc., Boston, Mass. x+294 pp. MR 58 #9947.
Chartrand, Gary; Alavi, Yousef; Goldsmith, Donald L.; Lesniak-Foster, Linda; Lick, Don R. (Editors) (1980) “The theory and applications of graphs.” Proceedings of the Fourth International Conference held at Western Michigan University, Kalamazoo, Mich., May 6–9, 1980. John Wiley & Sons, Inc., New York, xvi+611 pp. MR 82i:05002.
Chaty, Guy (1971) “Graphes fortement connexes c-minimaux et graphes sans circuit co-minimaux.” J. Combinatorial Theory Ser. B 10, 237–244. MR 45.2 6687.
Chaty, Guy; Chein, Michel (1973) “Bases de chemins et indices de recouvrement dans les graphes sans circuit.” Colloque sur la Theorie des Graphes (Bruxelles). Cahiers Centre Etudes Recherche Oper. 15, 287–307. MR 50.1 6919.
Chaty, Guy; Chein, Michel (1973) “Bases de chemins et indices de recouvrement dans les graphes sans circuit.” C.R. Acad. Sci. Paris Ser. A-B 276, A1489–A1491.
Chaty, G.; Chein, M.; Martin, P.; Petolla, G. (1974) “Some results about the number of jumps in acircuit digraphs.” Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 267-279. Congressus Numerantium, No. X, Utilitas Math., Winnipeg, Man. MR 50.2 12788.
Chaty, G.; Chein, M. (1976) “Path-number of k-graphs and symmetric digraphs.” Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory, and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 203–216. Congressus Numerantium, No. XVII, Utilitas Math., Winnipeg, Man. MR 55.1 2649.
Chaty, G.; Chein, M. (1976) “A note on top down and bottom up analysis of strongly connected digraphs.” Discrete Math. 16, no. 4, 309–311. MR 57 #12285.
Chaty, G.; Chein, M. (1973) “Invariants lies aux chemins dans les graphes sans circuits.” (Italian summary), Colloquio Internazionale sulle Teorie Combinatorie (Roma), Tomo I, pp. 287–308. Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome, 1976. MR 57 #12284
Chaty, G . (1976) “On critically and minimally k-vertex (arc) strongly connected digraphs.” Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely), Vol. I, pp. 193–204, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 80e:05061.
Chaty, G.; Chein, M. (1976) “Une nouvelle caracterisation des circuits composes.” (English summary), Problemes combinatoires et theorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay), pp. 79–80, Colloques Internat. CNRS, 260, CNRS, Paris, 1978. MR 80j:05065.
Chaty, G.; Chein, M. (1979) “Ordered matching and matchings without alternating cycles in bipartite graphs.” Utilitas Math. 16, 183–187. MR 81e:05109.
Chein, Michel; Martin, Pierre (1972) “Sur le nombre de sauts d’une foret.” C.R. Acad. Sci. Paris Ser. A-B 275, A159–A161. MR 46.1 1633.
Chein, M . (1974) “Some results on connectivity classes in digraphs.” Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 281–295. Congressus Numerantium, No. X, Utilitas Math., Winnipeg, Man. MR 51.1 7938.
Chein, M.; Habib, M. (1979) “The jump number of dags and posets: an introduction.” Combinatorics 79 (Proc. Colloq., Univ. Montreal, Montreal, Que.), Part. II. Ann Discrete Math. 9 (1980), 189–194. MR 81m:05071.
Chein, M.; Habib, M.; Maurer, M.C. (1981) “Partitive hypergraphs.” Discrete Math. 37, no. 1, 35–50. MR 83k:05084.
(1975) “Microsymposium: Graph theory in chemistry.” Held at the Institut fur Strahlenchemie, Max-Planck-Institut fur Kohlenforschung, Mulheim, May 26–28, 1975. Match No. 1 (1975). Reprinted in 1976. Inst, fur Strahlenchemie, Max-Planck-Inst. Kohlenforschung, Mulheim, 1976. x+237 pp. MR 83b:05058.
Chen, C.C. [Chen, Chuan Chong] (1981) “On a characterization of planar graphs.” Bull. Austral, math. Soc. 24, no. 2, 289–294. MR 83b:05058.
Chen, I Ngo (1975) “A node-elimination method for finding all simple cycles in a directed graph.” Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 147–160. Congressus Numerantium, No. XIV, Utilitas Math., Winnipeg, Man. MR 53.1 2732.
Chen, Kun Yuan; Saaty, Thomas L. (1978) “Hoover’s problem.” Math. Mag. 51, no. 5, 288–292. MR 80c:05076.
Chen, Pei De (1979) “Minimal number of comparisons of one kind of partially ordered graphs.” (Chinese. English summary), Kexue Tongbao 24, no. 15, 673–677. MR 80j:05066.
Chen, Wai-kai (1965) “Generation of trees and k-trees.” Proc. Third Annual Allerton Conf. on Circuit and System Theory, pp. 889–899. Univ. Illinois, Urbana, I11.
Chen, Wai-kai (1966) “On the realization of a (p,s)-digraph with prescribed degrees.” J. Franklin Inst. 281, 406–422. MR 34.1 83.
Chen, Wai-kai (1966) “On directed trees and directed k-trees of a digraph and their generation.” SIAM J. Appl. Math. 14, 550–560. MR 34.2 8872.
Chen, W-K (1967) “Hamilton circuits in directed-tree graphs.” IEEE Trans. Circuit Theory CT-14, 231–233. MR 41.2 8302.
Chen, Wai-kai (1967) “On directed graph solutions of linear algebraic equations.” SIAM Rev. 9, 692–707. MR 36.2 7306.
Chen, Wai Kai (1969) “Generation of trees and cotrees of a graph by decomposition.” Proc. Inst. Elec. Engrs. 116, 1639–1643. MR 53.2 7830.
Chen, Wai-kai (1971) “On d-invariant transformations of (p,s)-digraphs.” J. Franklin Inst. 291, 89–100. MR 44.1 115.
Chen, Wai Kai (1973) “On equivalence of realizability conditions of a degree sequence.” Large-scale networks. IEEE Trans. Circuit Theory CT-20, 260–262. MR 52.1 191.
Chen, Wai Kai (1973/74) “Applications and realizability of degree sequences of directed graphs without parallel edges and self-loops.” Matrix Tensor Quart. 24, 123–130; ibid. 25 (1974), 1-7. MR 50.2 12789.
Chen, Wai Kai (1976) “Applied graph theory.” North-Holland Publishing Co., Amsterdam-New York-Oxford, xvi+542 pp. MR 57 #11940.
Chen, Wai Kai (1980) “Subgraphs and their degree sequences of a digraph.” J. Franklin Inst. 310, no. 6, 349–363. MR 82c:05050.
Chen, Y.C.; Wing, 0. (1966) “Some properties of cycle-free directed graphs and the identification of the longest path.” J. Franklin Inst. 281, 293–301. MR 34.2 4156.
Cheung, Alan; Crapo, Henry (1976) “A combinatorial perspective on algebraic geometry.” Advances in Math. 20, no. 3, 388–414. MR 54.2 10290.
Cheung, L.K.; Kuh, E.S. (1974) “The bordered triangular matrix and minimum essential sets of a digraph.” IEEE Trans. Circuits and Systems CAS-21, 633–639. MR 52.2 10480.
Chew, K.L.; Yap, K.Y. (1973) “On the addressing problem for graphs.” Nanta Math. 6, no. 2, 77–84. MR 52.1 2961.
Chiappa, Raul A . (1970/71) “Sur les graphes adjoints.” Rev. Un. Mat. Argentina 25, 299–302. MR 51.1 239.
Chiappa, Raul A . (1975) “Caracterisation des graphes adjoints hamiltoniens.” Math. Japon. 20, special issue, 53–56. MR 53.1 196.
Chiappa, Raul A . (1979) “Sur la notion d’adjoint aux graphes orientes et aux graphes non orientes.” (English summary), Rend. Mat. (6) 12, no. 1, 85–104. MR 80m:05091.
Chinn, Phyllis Z.; McCarthy, D. (Editors) (1979) “Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing.” Held at Humboldt State University, Areata, Calif., September 5–7, 1979. Congressus Numerantium, XXVI. Utilitas Mathematica Publishing, Inc., Winnipeg, Man., 1980. vi+322 pp. MR 81i:05006.
Chong, Kong Ming (1982) “On a theorem for edge colorings in bipartite graphs.” (Italian summary), Boll. Un. Mat. Ital. A (6) 1, no. 1, 77–79. MR 83f:05022.
Choudum, S.A.; Parthasarathy, K.R. (1972) “Semi-regular relations and digraphs.” Nederl. Akad. Wetensch. Proc. Ser. A 75 = Indag. Math. 34, 326–334. MR 47. 1 1661.
Choudum, S.A . (1977) “Chromatic bounds for a class of graphs.” Quart. J. Math. Oxford Ser. (2) 28, no. 111, 257–270. MR 58 #5325.
Choueka, Yaacov (1972) “Bounded sets of nodes in transfinite trees.” Israel J. Math. 11, 254–257. MR 47. 1 42.
Christofides, Nicos (1974) “Hamiltonian circuits and the travelling salesman problem.” Combinatorial programming: methods and applications (Proc. NATO Advanced Study Inst., Versailles), pp. 149–171. NATO Advanced Study Inst. Ser., Ser. C: Math, and Phys. Sci., Vol. 19, Reidel, Dordrecht, 1975. MR 53.1 4997.
Christofides, Nicos; Brooker, P. (1976) “The optimal partitioning of graphs.” SIAM J. Appl. Math. 30, no. 1, 55–69. MR 53. 2 9703.
Chu Yoeng-jin [Chu Yung-chin]; Liu Tseng-hong [Liu Tseng-hung] (1965) “On the shortest arborescence of a directed graph.” Sci. Sinica 14, 1396–1400. MR 33. 1 1245.
Chung, F.R.K Graham, R.L..; (1981) “Recent results in graph decompositions.” Combinatorics (Swansea), pp. 103–123, London Math. Soc. Lecture Note Ser., 52, Cambridge Univ. Press, Cambridge. MR 83a:05118.
Chungphaisan, V . (1974/75) “Sequences realizable by graphs with Hamiltonian squares.” Canad. Math. Bull. 17, no. 5, 629–631. MR 53.2 13028.
Chvalina, J . (1973) “On the number of general topologies of a finite set.” (Russian summary), Scripta Fac. Sci. Natur. UJEP Brunensis-Math 3, 7–22. MR 51.1 181.
Chvatal, V.; Hell, P.; Kucera, L.; Nesetril, J. (1971) “Every finite graph is a full subgraph of a rigid graph.” J. Combinatorial Theory Ser. B 11, 284–286. MR 45. 1 3227.
Chvatal, V.; Komlos, J. (1971) “Some combinatorial theorems on monotonicity.” Canad. Math. Bull. 14, 151–157. MR 49. 1 2445.
Chvatal, V.; Lovasz, L. (1972) “Every directed graph has a semi-kernel.” Hypergraph Seminar (Proc. First Working Sem. Ohio State Univ., Columbus, Ohio), p. 175. Lecture Notes in Math., Vol. 411, Springer, Berlin, 1974. MR 54.1 2514.
Chvatal, V. (1976) “On the strong perfect graph conjecture.” J. Combinatorial Theory Ser. B 20, no. 2, 139–141. MR 54.1 129.
Chvatal, V.; Thomassen, C. (1978) “Distances in orientations of graphs.” J. Combinatorial Theory Ser. B 24, no. 1, 61–75. MR 58 #10589.
Chvatal, V.; Garey, M.R.; Johnson, D.S. (1978) “Two results concerning multicoloring.” Annals of Discrete Mathematics, 2, 151–154.
Chvatal, V.; Graham, R.L.; Perold, A.F.; Whitesides, S.H. (1979) “Combinatorial designs related to the strong perfect graph conjecture.” Discrete Math. 26, no. 2, 83–92. MR 81b:05044.
Ciobotaru, Sorin (1977) “A linguistic method for determining Hamiltonian paths.” (Romanian. French summary), Stud. Cere. Mat. 29, no. 2, 103–112. MR 58 #8467.
Ciobataru, Sorin (1978) “On the enumeration of Hamiltonian roads and circuits in certain partial graphs of Kn *.” Rev. Roumaine Math. Pures appl. 23, no. 10, 1487–1496. MR 82j:05068.
Ciobotaru Sorin (1981) “Counting Hamiltonian paths and circuits in Kn* and Kn,n*, containing or avoiding certain given arcs.” (Romanian. English*summary), Stud. Cere. Mat. 33, no. 4, 425–438. MR 82j:05068.
Clarke, F.H.; Jamison, R.E. (1976) “Multicolorings, measures and games on graphs.” Discrete Math., 4, 241–246.
Clements, G.J. (1974) “Inequalities concerning numbers of subsets of a finite set.” J. Combinatorial Theory Ser. A 17, 227–244. MR 49.2 10565.
Clements, G.J. (1974) “Sperner’s theorem with constraints.” Discrete Math. 10, 235–255. MR 50.1 1891.
Clements, G.F. (1977) “An existence theorem for antichains.” J. Combinatorial Theory Ser. A 22, no. 3, 368–371. MR 55.2 10285.
Cocan, A.; Cocan, M. [Cocan, Moise] (1976) “An estimation problem for a preference relation in a graph.” (Romanian. French summary), Univ. Brasov Lucrari Stiint. 18, 37–40. MR 58 #16372.
Cockayne, Ernest J.; Miller, Gary Glenn; Prins, Geert (1972) “An interpolation theorem for partitions which are complete with respect to hereditary properties.” J. Combinatorial Theory Ser. B 13, 290–297. MR 46.2 8848.
Cockayne, E.J.; Thomason, A.G. (1982) “Ordered colourings of graphs.” J. Combin. Theory Ser. B 32, no. 3, 286–292. MR 83k:05046.
Coffy, Joel (1973) “On computing the time complexity of transitive closure algorithms.” Information Processing Lett. 2, 39–42. MR 49.1 125.
Cofman, Judita (1973) “On combinatorics of finite projective spaces.” Proc. Internat. Conf. Projective Planes (Washington State Univ., Pullman, Wash.), pp. 59–70. Washington State Univ. Press, Pullman, Wash. MR 50.2 12766.
Cofman, Judit (1973) “On combinatorics of finite Sperner spaces.” (Italian summary), Colloquio Internazionale sulle Teorie Combinatorie (Roma), tomo II, pp. 55–56. Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome, 1976. MR 57.1 2944.
Cogis, Olivier (1979) “Sur la dimension d’un graphe oriente.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 288, no. 13, A639–A641. MR 80c:05077.
Cogis, O.; Habib, M. (1979) “Nombre de sauts et graphes serie-paralleles.” (English summary), RAIRO Inform. Theor. 13, no. 1, 3–18, ii. MR 81h:05068.
Cohen, A.M . [Cohen, Arjeh M.] (1981) “A synopsis of known distance-regular graphs with large diameters.” Afdeling Zuivere Wiskunde [Department of Pure Mathematics], 168. Mathematisch Centrum, Amsterdam. i+30 pp. MR 83k:05051.
Cohen, Daniel I. A. (1967) “On the Sperner lemma.” J. Combinatorial Theory 2, 585–587. MR 35.2 4899.
Cohen, J.E. (1968) “Interval graphs and food webs: a finding and a problem.” RAND Corporation Document 17696-PR, Santa Monica, Calif.
Cohen, J.E. (1977) “Food webs and the dimensionality of trophic niche space.” Proc. Natl. Acad. Sci., 74, 4533–4536.
Cohen, J.E. (1978) “Food webs and niche space.” Princeton University Press, Princeton, N.J.
Cohen, Joel E. (1982) “The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph.” Discrete Math. 40, no. 1, 21–24. MR 83k:05102.
Cohen, J.E. (1983) “Recent progress and problems in food web theory.” in D.L. DeAngelis, W.M. Post, and G. Sugihara (eds.), Current Trends in Food Web Theory, Tech. Rept. ORNL/TM-8643, Oak Ridge National Laboratory, Oak Ridge, Tenn.
Colbourn, Charles J.; Read, Ronald C. (1979) “Orderly algorithms for generating restricted classes of graphs.” J. Graph Theory 3, no. 2, 187–195. MR 80i:05048.
Collatz, Lothar (1974) “Einige Beziehungen zwischen Graphen, Geometric und Kombinatorik.” (English summary), Numerische Methoden bei graphentheoretischen und kombinatorischen Problemen (Tagung, Math. Forschungsinst. Oberwolfach, Oberwolfach), pp. 27–56. International Series of Numerical Mathematics, vol. 29, Birkhauser, Basel, 1975. MR 55.1 187.
Collatz, L . (1978) “Typen von Hypergraphen innerhalb und au$erhalb der Mathematik.” (English summary), Tagung, Math. Forschungsinst., Oberwolfach, pp. 37–65, Internat. Ser. Numer. Math., 46, Birkhauser, Basel, 1979. MR 81a:05101.
(1978) “Colloque Mathematiques Discretes: Codes et Hypergraphes.” Held in Brussels on april 27–28, 1978. Cahiers Centre Etudes Rech. Oper. 20, no. 3–4, 229–470. Centre d’Etudes de Recherche Operationelle, Institut Statistique, Universite Libre de Bruxelles, Brussels, pp. 229–472. MR 80f:05002.
(1973) “Colloque sur la Theorie des Graphes.” (Bruxelles, 26 et 27 avril 1973), Cahiers Centre Etudes Recherche Oper. 15, no. 3. Centre d’Etudes de Recherche Operationnelle, Brussels, pp. 217–396. MR 48.1 137.
(1974) “Colloque sur la Theorie des Graphes.” Tenu a Paris, le 9 et 10 mai 1974. Cahiers Centre Etudes Recherche Oper. 17, no. 2–3–4. Institut de Statistique, Universite Libre de Bruxelles, Brussels, 1975. pp. i-ii and 109–448. MR 52.1 2931.
(1973) “Colloquio Internazionale sulle Teorie Combinatorie. Tomo I.” Tenuto a Roma, 3-15 settembre 1973. Atti dei convegni Lincei, No. 17. Accademia Nazionale dei Lincei, Rome, 1976. 518 pp. MR 55.1 113.
(1973) “Colloquio Internazionale sulle Teorie combinatorie. Tomo II.” Tenuto a Roma, 3–15 settembre 1983. Atti dei convegni Lincei, No. 17. Accademia Nazionale dei Lincei, Rome, 1976. 526 pp. MR 56.2 8371.
Comer, S.D.; Le Tourneau, J.J. (1969) “Isomorphism types of infinite algebras.” Proc. Amer. Math. Soc. 21, 635–639. MR 39. 1 116.
Comtet, Louis (1966) “Recouvrements, bases de filtre et topologies d’un ensemble fini.” C.R. Acad. Sci. Paris Ser. A=B 262, A1091–A1094. MR 34. 1 1209.
(1977) “Combinatorial structures and graph theory. II.” (Janenese), Proceedings of a Symposium held at the Research Institute for Mathematical Sciences, Kyoto University, Kyoto, September 16–17, 1977. Surikaisekikenkyusho Kokyuroku No. 333 (1978). Research Institute for Mathematical Sciences, Kyoto University, Kyoto, 1978. pp. i–ii and 1–235. MR 80f:05003.
(1967) “Proceedings of the projective geometry conference.” at the University of Illinois, Summer. University of Illinois at Chicago Circle, Chicago, Ill. v+164 pp. MR 36.2 3615.
Cook, R.J . (1977) “Some results in topological graph theory.” Period. Math. Hungar. 8, no. 3–4, 261–274. MR 57 #9581.
Cook, R.J. (1979) “Vertex degrees of graphs on orientable surfaces.” Utilitas Math. 15, 281–290. MR 80m: 05062.
Cooper, Christopher D.H. (1973) “On the maximum eigenvalue of a reducible non-negative real matrix.” Math. Z. 131, 213–217. MR 51. 1 240.
Cooper, E.D. (1975) “Combinatorial map theory.” J. Combinatorial Theory Ser. B 18, 73–83. MR 51.1 2962.
Cordovil, Raul (1977) “Extensions lisses d’une geometrie combinatoire.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 284, no. 20, A1249–A1252. MR 56.1 2850.
Cori, Robert (1970) “Une equation liee a un probleme combinatoire dans une algebre non commutative.” C.R. Acad. Sci. Paris Ser. A–B 271, A771–A773. MR 43.1 1889.
Cori, Robert; Richard, Jean (1971) “Some languages related to planar maps.” Theory of machines and computations (Proc. Internat. Sympos., Technion, Haifa), pp. 115–121. Academic Press, New York. MR 53.2 12094.
Cori, Robert (1975) “Un code pour les graphes planaires et ses applications.” With an English abstract. Asterisque, No. 27. Societe Mathematique de France, Paris, i+169 pp. MR 53.2 7851.
Cori, Robert; Machi, Antonio; Penaud, Jean-Guy; Vauquelin, Bernard (1981) “On the automorphism group of a planar hypermap.” European J. Combin. 2, no. 4, 331–334. MR 83e:05059.
Cottle, Richard W.; Dantzig, George B. (1970) “A generalization of the linear complementarity problem.” J. Combinatorial theory 8, 79–90. MR 40.2 7275.
Cover, Thomas M. (1967) “The number of linearly inducible orderings of points in d-space.” SIAM J. Appl. Math. 15, 434–439. MR 35.1 2767.
Cowen, Robert H. (1977) “Generalizing Konig’s infinity lemma.” Notre Dame J. Formal Logic 18, no. 2, 243–247. MR 58 #5306.
Cozzens, M.B. (1982) “The NP-completeness of the boxicity of a graph.” mimeographed, Department of Mathematics, Northeastern University, Boston, Mass.
Cozzens, M.B.; Roberts, F.S. (1982) “Double semiorders and double indifference graphs.” SIAM J. on Algebraic and Discrete Methods, 3, 566–583. (a)
Cozzens, M.B.; Roberts, F.S. (1982) “k-Suitable sets of arrangements and the boxicity of a graph.” mimeographed, Department of Mathematics, Rutgers University, New Brunswick, N.J. (b )
Cozzens, M.B.; Roberts, F.S. (1982) “T-colorings of graphs and the channel assignment problem.” Congressus Numerantium, 35, 191–208. (c)
Cozzens, M.B.; Roberts, F.S. (1982) “T-colorings of graphs and the channel assignment problem.” Congressus Numerantium, 35, 191–208. (c)
Cozzens, M.B.; Wang, D-I. (1983) “The channel assignment problem.” Congressus Numerantium, to appear.
Crapo, Henry H. (1966) “The Moius function of a lattice.” J. Combinatorial Theory 1, 126–131. MR 33. 1 1240.
Crapo, Henry H. (1967) “A higher invariant for matroids.” J. Combinatorial Theory 2, 406–417. MR 35. 2 6579.
Crapo, Henry H. (1970) “Erecting geometries.” Proc. Second Chapel Hill Conf. on Combinatorial Mathematics and its Applications (Univ. North Carolina, Chapel Hill, N.C.), pp. 74–99. Univ. North Carolina, Chapel Hill, N.C. MR 42.2 7536.
Crapo, Henry H. (1969) “Geometric duality and the Dilworth completion.” Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta.), pp. 37–46. Gordon and Breach, New York, 1970. MR 43.1 119.
Crapo, Henry H.; Rota, Gian-Carlo (1970) “On the foundations of combinatorial theory: Combinatorial geometries.” Preliminary edition. The M.I.T. Press, Cambridge, Mass.-London, iv+289 pp. MR 45.1 74.
Csakany, B.; Pollak, G. (1969) “The graph of subgroups of a finite group.” (Russian), Czechoslovak Math. J. 19 (54), 241–247. MR 40.1 2573.
Culik, Karel (1977) “Extensions of rooted trees and their applications.” Discrete Math. 18, no. 2, 131–148. MR 57.1 2975.
Cunningham, W.H . (1972) “On theorems of Berge and Fournier.” Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio), pp. 67–74. Lecture Notes in Math., vol. 411, Springer, Berlin, 1974. MR 57.1 5794.
Cunningham, William H.; Edmonds, Jack (1980) “A combinatorial decomposition theory.” Canad. J. Math. 32, no. 3, 734–765. MR 83c:05098.
Cvetkovic, Dragos M . (1970) “The Boolean operations on graphs-spectrum and connectedness.” (Serbo-Croatian summary), Proceedings of the Fifth Congress of Mathematicians, Physicists and Astronomers of Yugoslavia (Ohrid), Vol. I, Mathematics (Macedonian), pp. 115–119. Sojuz Drustva. Mat., Fiz. i Astronom. Jugoslav., Skonie, 1973. MR 57 #12298.
Cvetkovic, Dragos M. (1972) “The number of antichains of finite power sets.” Publ. Inst. Math. (Beograd) (N.S.) 13 (27), 5–9. MR 49.1 69.
Cvetkovic, Dragos M. (1975) “Cubic integral graphs.” Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz. No. 498-541, 107–113. MR 53.2 13038.
Cvetkovic, Dragos M.; Simic, Slobodan K. (1975) “Graph equations for line graphs and total graphs.” Discrete Math. 13, no. 4, 315–320. MR 53.2 7859.
Cvetkovic, Dragos; Doob, Micahel; Simic, Slobodan (1981) “Generalized line graphs.” J. Graph Theory 5, no. 4, 385–399. MR 82k:05091.
Cvetkovic, D.M . (1976) “Definition and calculation of determinants with the help of graphs.” (Dutch), Nieuw Tijdschr. Wisk. 63, no. 4, 209–215. MR 54.2 10066.
Cvetkovic, D.M.; Lackovic, I.B.; Simic, S.K. (1976) “Graph equations, graph inequalities and a fixed point theorem.” Publ. Inst. Math. (Beograd) (N.S.) 20 (34), 59–66. MR 57.1 178.
Cvetkovic, Dragos M.; Simic, Slobodan K. (1978) “Graphs which are switching equivalent to their line graphs.” Publ. Inst. Math. (Beograd) (N.S.) 23 (37), 39–51. MR 80c:05108.
Cvetkovic, D.M . (1978) “Some possible directions in further investigations of graph spectra.” Algebraic methods in graph theory, Vol. I, II(Szeged), pp. 47–67, Colloq. Math. Soc. Janos Bolyai, 25, North-Holland, Amsterdam, 1981. MR 83b:05090.
Czerwinska, D . (1972/73) “On the similarity of sets.” (Polish summary), Zastos. Mat. 13, 153–158. MR 48.1 1932.
Dachs, Jose N.W. (1971) “A convergence problem on finite directed graphs.” SIAM J. Appl. Math. 21, 214–220. MR 47.1 67.
Dalimaev, A.P . (1981) “Decomposition approach to an analysis of the structure of digraphs with multicolored arcs.” (Russian. English summary), Vesci Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk, no. 1, 29–38, 138. MR 82g:05046.
Dalmazzo, Michel (1977) “Nombre d’arcs dans les graphes k-arc-fortement connexes minimaux.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 285, no. 5, A341–A344. MR 57.1 2968.
Dambit, Ja. Ja. [Dambitis, J.] (1965) “On trees of connected graphs.” (Russian. Latvian and English summaries), Latvian Math. Yearbook (Russian), pp. 337–345. Izdat. “Zinatne”, Riga, 1966. MR 35.1 1507.
Damerell, R.M. (1981) “Distance-transitive and distance-regular digraphs.” J. Combin. Theory Ser. B 31, no. 1, 46–53. MR 83a:05061.
D’Amore, Bruno (1973) “Un risultato relativo alle funzioni di Grundy nella teoria dei grafi.” (English summary), Rend. 1st. Mat. Univ. Trieste 5, 129–131. MR 52.1 169.
Dani, E . (1976) “The number of trees of a given length.” (Russian), Mathematica (Cluj) 18 (41), no. 2, 137–142. MR 58 #16389.
Das, Prabir (1980) “Characterization of potentially self-complementary, self-converse degree-pair sequences for digraphs.” Combinatorics and graph theory (Calcutta), pp. 212–226, Lecture Notes in Math., 885, Springer, Berlin-New York, 1981. MR 83i:05033.
Das, Shawpawn Kumar (1973) “On the enumeration of finite maximal connected topologies.” J. Combinatorial Theory Ser. B 15, 184–199. MR 48.1 1939.
Das, Shawpawn Kumar (1976) “Errata: “On the enumeration of finite maximal connected topologies”.” (J. Combinatorial Theory Ser. B 15, 184–199). J. Combinatorial Theory Ser. B 21, no. 3, 285. MR 55.2 7798.
Das, Shawpawn Kumar (1976) “Reconstruction of a class of finite acyclic transitive digraphs.” Proceedings of the Symposium on Graph Theory (Indian Statist. Inst., Calcutta), pp. 163–173, ISI Lecture Notes, 4, Macmillan of India, New Delhi, 1979. MR 81b:05050.
Das, Shawpawn Kumar (1977) “A machine representation of finite To topologies.” J. Assoc. Comput. Mach. 24, no. 4, 676–692. MR 57 #12240.
Davis, Robert L. (1974) “A Galois connection for reduced incidence algebras.” Proc. Amer. Math. Soc. 45, 179–184. MR 51.1 201.
Davydov, E.G . (1968) “The automorphisms of unions of direct products of finite graphs.” (Russian. English summary insert), Kibernetika (Kiev), no. 6, 16–22. MR 45.2 6691.
Dawson, J.E . (1980) “A construction for a family of sets and its application to matroids.” Combinatorial mathematics, VIII (Geelong), pp. 136–147, Lecture Notes in Math., 884, Springer, Berlin, 1981. MR 83a:05049.
Dawson, Jeremy E. (1982) “A matroid theoretic approach to the matching structure of a graph.” Quart. J. Math. Oxford Ser. (2) 33, no. 131, 297–302. MR 83j:05066.
Daykin, D.E.; Godfrey, Jean; Hilton, A.J.W. (1974) “Existence theorems for Sperner families.” J. Combinatorial Theory Ser. A 17, 245–251. MR 54.1 4993.
Daykin, D.E. (1975) “Antichains in the lattice of subsets of a finite set.” Nanta Math. 8, no. 2, 84–94. MR 56.2 11806.
Daykin, D.E . (1976) “Poset functions commuting with the product and yielding Chebychev type inequalities.” (French summary), Problemes combinatoires et theorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay), pp. 93–98, Colloques Internat. CNRS,2 60, CNRS, Paris, 1978. MR 80j:05005.
Daykin, D.E.; Frankl, P.; Greene, C.; Hilton, A.J.W. (1981) “A generalization of Sperner’s theorem.” J. Austral. Math. Soc. Ser. A 31, no. 4, 481–485. MR 83a:05003.
de Biasi, Jean (1977) “Applications θ-croissantes; generalisation du probleme de Terquem.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 285, no. 3, A89–A92. MR 56.1 144.
de Bruijn, N.G.; Klarner, D.A. (1969) “Enumeration of generalized graphs.” Nederl. Akad. Wetensch. Proc. Ser. A 72 = Indag. Math. 31, 1–9. MR 39.1 1341.
de Bruijn, N.G. (1972) “Enumeration of mapping patterns.” J. Combinatorial Theory Ser. A 12, 14–20. MR 44.1 1585.
de Bruijn, N.G. (1980) “Counting complete matchings without using Pfaffians.” Nederl. Akad. Wetensch. Indag. Math. 42, no. 4, 361–366. MR 81m:05108.
Decker, R.W.; Glover, H.H.; Huneke, J.P. (1981) “The genus of the 2-amalgamations of graphs.” J. Graph Theory 5, no. 1, 95–102. MR 82d:05056.
Dedo, Ernesto (1981) “The reconstructibility of the characteristic polynomial of the line-graph of a graph.” (Italian. English summary), Boll. Un. Mat. Ital. A (5) 18, no. 3, 423–429. MR 82k:05078.
de Groot, J. (1973) “Graph representations of topological spaces.” Topological structures (Proc. Sympos., Amsterdam), pp. 29–37. Math. Centre Tracts, No. 52, Math. Centrum, Amsterdam, 1974.
Demaria, Davide Carlo (1977) “Sull’omotopia regolare: applicazioni agli spazi uniformi ed ai graf finiti.” (English summary), Confer. Sem. Mat. Univ. Bari No. 148, 14 pp. MR 58 #13019.
Dembowski, Peter; Piper, Fred (1967) “Quasiregular collineation groups of finite projective planes.” Math. Z. 99, 53–75. MR 35.2 6576.
Demetrovic, Ja. [Demetrovics, Janos]; D’epesi, D. [Gyepesi, Gy.] (1980) “Generation of functional dependencies and their representation by means of relations.” (Russian. Hungarian and English summaries), Kozl.-MTA Szamitastech. Automat. Kutato Int. Budapest No. 24, 7–18. MR 81m:05008.
Deming, R.W. (1979) “Acyclic orientations of a graph and chromatic and independence numbers.” J. Combin. Theory Ser. B 26, no. 1, 101–110. MR 80k:05056.
Denes, Jozsef (1959) “The representation of a permutation as the product of a minimal number of transpositions, and its connection with the theory of graphs.” Magyar Tud. Akad. Mat. Kutato Int. Kozl. 4, 63–71. (Hungarian and Russian summaries). MR 22.2 6733.
Denes, J. (1966) “Connections between transformation semigroups and graphs.” (French summary), Theory of Graphs (Internat. Sympos., Rome), pp. 93–101. Gordon and Breach, New York; Dunod, Paris, 1967. MR 36.1 2528.
Denes, J. (1966) “On transformations, transformation-semigroups and graphs.” Theory of Graphs (Proc. Colloq., Tihany), pp. 65–75. Academic Press, New York, 1968. MR 38.2 3367.
Denes, J.; Torok. E. (1969) “Groups and graphs.” Combinatorial Theory and its Applications, I (Proc. Colloq., Balatonfured), pp. 257–289. North-Holland, Amsterdam, 1970. MR 46.1 91.
Deo, Narsingh (1968) “Self-dual graphs and digraphs.” Proc. Sixth Annual Allerton Conf. on Circuit and System Theory (Monticello, 111.), pp. 832–840. Univ. of Illinois, Urbana, 111. MR 42.1 105.
Deo, Narsingh (1969) “An extensive English language bibliography on graph theory and its applications.” National Aeronautics and Space Administration, Technical Report 32-1413. Jet Propulsion Laboratory, California Institute of Technology, Pasadena, Calif, vi+80 pp. MR 41.1 3319.
Deo, Narsingh (1974) “Graph theory with applications to engineering and computer science.” Prentice-Hall, Inc., Englewood Cliffs, N.J. xvii+478 pp. MR 50.2 12772.
Deo, Narsingh; Krishnamoorthy, M.S. (1974) “An algorithm for removing surplus edges from a directed graph.” Technical Report No. TRCS-74-002. Computer Science Centre, Indian Institute of Technology, Kanpur. ii+14 pp. MR 50.1 6911.
Deo, Narsingh; Krishnamoorthy, M.S.; Pai, Ajit B. (1977) “Generalizations of line graphs and applications.” Information Processing Lett. 6, no. 1, 14–17. MR 56.1 5362.
Deo, Narsingh; Davis, J.M.; Lord, R.E. (1977) “A new algorithm for digraph isomorphism.” Nordisk Tidskr. Informationsbehandling (BIT) 17, no. 1, 16–30. MR 58 #3647.
Desarmenien, Jacques (1980) “La fonction de Mobius du monoide plaxique.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 290, no. 19, A859–A861. MR 81e:05013.
DeTemple, Duane W.; Robertson, Jack M. (1976) “An analog of Sperner’s Lemma.” Amer. Math. Monthly 83, no. 6, 465–467. MR 53.2 7839.
Deuber, W . (1973) “Generalizations of Ramsey’s theorem.” Infinite and finite sets (Colloq., Keszthely), Vol. I, pp. 323–332. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR 51.1 5363.
Deuber, Walter (1975) “Partitionstheoreme fur Graphen.” Comment. Math. Helv. 50, no. 3, 311–320. MR 53.1 5373.
Deuber, Walter (1975) “Partition theorems for abelian groups.” J. Combinatorial Theory Ser. A 19, 95–108. MR 52.1 601.
Deuber, Walter (1975) “A generalization of Ramsey’ss theorem for regular trees.” J. Combinatorial Theory Ser. B 18, 18–23. MR 55.2 10301.
Deuber, W.; Rothschild, B.L.; Voigt, B. (1982) “Induced partition theorems.” J. Combin. Theory Ser. A 32, no. 2, 225–240. MR 83k:05013.
Deuel, D.R.; Gill, A. (1966) “Some decision problems associated with weighted, directed graphs.” SIAM J. Appl. Math. 14, 970–979. MR 35.1 2790.
Devitt, J.S.; Jackson, D.M. (1982) “The enumeration of covers of a finite set.” J. London Math. Soc. (2) 25, no. 1, 1–6. MR 83k:05008.
Dewdney, A.K.; Szilard, A.L. (1973) “Tours in machines and digraphs.” IEEE Trans. Computers C-22, 635–539. MR 50.2 9674.
Dewdney, A.K.; Harary, Frank (1976) “The adjacency graphs of a complex.” Czechoslovak Math. J. 26 (101), no. 1, 137–144. MR 55.1 188.
Dewdney, A.K. (1980) “The embedding dimension of a graph.” Ars combin$19, 77–90. MR 81m: 05064.
Dewdney, A.K.; Harary, Frank (1981) “Oriented two-dimensional circuits.” Discrete Math. 33, no. 2, 149–162. MR 82i:05039.
de Werra, D . (1971/72) “Investigations on an edge coloring problem.” Discrete Math. 1, no. 2, 167–179. MR 45.1 3248.
de Werra, D . (1972) “Decomposition of bipartite multigraphs into matchings.” (German summary), z. Operations Res. Ser. A-B 16, A85–A90. MR 46.2 5182.
de Werra, D . (1974) “Some results in chromatic scheduling.” (German summary), Z. Operations Res. Ser. A-B 18, A167–A175. MR 50.1 6910.
de Werra, D. (1978) “On line-perfect graphs.” Math. Programming 15, no. 2, 236–238. MR 81a: 05052.
de Werra, D. (1980) “Geography, games and graphs.” Discrete Appl. Math. 2, no. 4, 327–337. MR 82c:05051.
de Werra, D. (1979) “On the use of alternating chains and hypergraphs in edge coloring.” J. Graph Theory 3, no. 2, 175–182. MR 83c:05061.
de Werra, D. (1982) “Minimizing irregularities in sports schedules using graph theory.” Discrete Appl. Math. 4, no. 3, 217–226. MR 83m:05079.
Deza, Mikhail (1975) “Racine minimum d’un groupe elementaire abelien.” Canad. J. Math. 27, no. 4, 819–826. MR 52.1 5442.
Dickson, T.J. (1971) “On a covering problem concerning abelian groups.” J. London Math. Soc. (2) 3, 222–232. MR 42.2 7770.
Diderrich, George T. (1973) “Sums of length t in Abelian groups.” Israel J. Math. 14, 14–22. MR 47.2 5146.
Diego, A.; Germani, A. (1972) “Extremal measures with prescribed marginals (finite ease).” J. Combinatorial Theory Ser. A 13, 353–366. MR 47.2 5913.
Dienes, I.; Kovacs, L.B. (1976) “Maximum transitive paths and their application to a geological problem: setting up stratigraphic units.” Survey of mathematical programming (Proc. Ninth Internat. Math. Programming sympos., Budapest), Vol. 2, pp. 441-454, North-Holland, Amsterdam, 1979. MR 811:05088.
Di Giorgio, V . (1971) “Application de l’algebre de Boole a l’etude des graphes.” Math. Sci. Humaines No. 36, 33–58; loose errata, ibid. No. 38 (1972). MR 49.1 148.
Dinic, E.A.; Zaicev, M.A. (1978) “Linear ordering and generation of trees.” (Russian), Algorithmic studies in combinatorics (Russian), pp. 85–99, 186, “Nauka”, Moscow. MR 80e:05048.
Dion, Jean-Guy (1976) “Sur une caracterisation des vidanges fortes.” (English summary), Advances in Appl. Probability 8, no. 1, 105–126. MR 52.2 15597.
Di Paola, J.W.; Nemeth, E. (1976) “Generalized triple systems and medial quasigroups.” Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory, and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 289–306. Congressus Numerantium, No. XVII, Utilitas Math., Winnipeg, Man. MR 55.1 2599.
Dirac, G.A. (1965) “Chromatic number and topological complete subgraphs.” Canad. Math. Bull. 8, 711–715. MR 33.2 3955.
Dirac, G.A. (1966) “Short proof of Menger’s graph theorem.” Mathematika 13, 42–44. MR 33. 2 3956.
Dirac, G.A. (1969) “Extension of Konig’s lemma.” Math. Nachr. 40, 43–49. MR 43.1 1870.
Dirac, Gabriel (1972) “On arbitrarily traceable graphs.” Math. Scand. 31, 319–378 (1973). MR 49.1 135.
Dirac, Gabriel (1973) “On separating sets and Menger’s theorem.” Nederl. Akad. Wetensch. Proc. Ser. A 76 = Indag. Math. 35, 49–62. MR 47.2 4832.
Dirac, G.A. (1973) “On systems of paths and circuits in graphs.” Math. Ann. 201, 133–144. MR 52. 1 182.
Dlab, Vlastimil; Ringel, Claus Michael (1974) “Representations des graphes values.” C.R. Acad. Sci. Paris Ser. A 278, 537–540. MR 50.2 9973.
Domschke, W . (1973) “Zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen.” (English summary), Computing (Arch. Elektron. Rechnen) 11, no. 2, 125–136. MR 52.1 5467.
Dirac, G.A . (1975) “Structural properties and circuits in graphs.” Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen), pp. 135–140. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976. MR 53.1 2733.
Donald, J.D.; Holzmann, C.A.; Tobey, M.D. (1977) “A characterization of complete matroid base graphs.” J. Combinatorial Theory Ser. B 22, no. 2, 139–158. MR 58 #377.
Donec, G.A. (1968) “The resolvent polynomials of plane saturated graphs.” (Russian), Theory of Optimal Solutions (Proc. Sem., Kiev), No. 2 (Russian), pp. 35–53. Akad. Nauk Ukrain. SSR, Kiev. MR 40.1 2571.
Donovan, Peter; Freislich, Mary Ruth (1973) “The representation theory of finite graphs and associated algebras.” Carleton Mathematical Lecture Notes, No. 5. Carleton University, Ottawa, Ont. iii+83 pp. MR 50.2 9701.
Doob, Michael (1973) “An interrelation between line graphs, eigenvalues, and matroids.” J. Combinatorial Theory Ser. B 15, 40–50. MR 55.2 12573.
Doob, Michael (1978) “Seidel switching and cospectral graphs with four distinct eigenvalues.” Second International Conference on Combinatorial Mathematics (New York), pp. 164–168, Ann. New York Acad. Sci., 319, New York Acad. Sci., New York, 1979. MR 81m:05095.
Dorfler, W.; Imrich, W. (1969) “Uber die X-Summe von Mengensystemen.” Combinatorial theory and its Applications, I (Proc. Colloq., Balatonfured), pp. 297–309. North-Holland, Amsterdam, 1970. MR 45.2 6692.
Dorfler, Willibald (1971) “Uber die X-Summe von gerichteten Graphen.” Arch. Math. (Basel) 22, 24–36. MR 45.2 8578.
Dorfler, Willibald (1971) “Uber Produkte von endlichen zusammenhangenden Graphen.” Osterreich. Akad. Wiss. Math.-Natur. Kl. S.-B. II 179, 177–192. MR 48.1 3808.
Dorfler, Willibald (1971) “Dorfler, Willibald (1971) Zum Kroneckerprodukt von endlichen Graphen.” (Serbo-Croatian summary), Glasnik Mat. Ser. III 6 (26), 217–229. MR 47.2 6554.
Dorfler, Willibald; Imrich, Wilfried (1972) “Das lexikographische Produkt gerichteter Graphen.” Monatsh. Math. 76, 21–30. MR 46.2 8891.
Dorfler, Willibald; Imrich, Wilfried (1972) “Eine Klasse rekonstruierbarer Graphen.” (Serbo-Croatian summary), Glasnik Mat. Ser. III 7 (27), 159–165. MR 47.2 6555.
Dorfler, W. (1974) “Every regular graph is a quasigroup graph.” Discrete Math. 10, 181–183. MR 50.1 6912.
Dorfler, Willibald (1974) “Der Arboreszenzengraph eines gerichteten Graphen.” Math. Nachr. 59, 35–49. MR 49.1 119.
Dorfler, W . (1973) “Some results on the reconstruction of graphs.” Infinite and finite sets (Colloq., Keszthely), Vol. I, pp. 361–383. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR 51.1 5407.
Dorfler, Willibald; Harary, Frank; Malle, Gunther (1980) “Covers of digraphs.” (Russian summary), Math. Slovacca 30, no. 3, 269–280. MR 81k:05081.
Dorfler, W . (1980) “A homotopy theory for hypergraphs.” (Serbo-Croatian summary), Glas. Mat. Ser. III 15(35), no. 1, 3–16. MR 81m:05103.
Dorfler, W. (1977) “Double covers of graphs and hypergraphs.” Contributions to graph theory and its applications (Internat. Colloq., Oberhof) (German), pp. 67–79, Tech. Hochschule Ilmenau, Ilmenau. MR 82c:05074.
Dorfler, W.; Waller, D.A. (1980) “A category-theoretical approach to hypergraphs.” Arch. Math. (Basel) 34, no. 2, 185–192. MR 83f:05053.
Doubilet, Peter; Rota, Gian-Carlo; Stanley, Richard (1970/1971) “On the foundations of combinatorial theory. VI. The idea of generating function.” Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability (Univ. California, Berkeley, Calif.), Vol. II: Probability theory, pp. 267–318. Univ. California Press, Berkeley, Calif., 1972. MR 53.2 7796.
Doubilet, Peter (1972) “On the foundations of combinatorial theory. VII. Symmetric functions through the theory of distribution and occupancy.” Studies in Appl. Math. 51, 377–396. MR 55.1 2589.
Douglas, Robert J. (1970) “Tournaments that admit exactly one Hamiltonian circuit.” Proc. London Math. Soc. (3) 21, 716–730. MR 43.186.
Dowling, T.A.; Laskar, Renu (1967) “A geometric characterization of the line graph of a projective plane.” J. Combinatorial Theory 3, 402–410. MR 36.1 67.
Dowling, T.A . (1971) “A q-analog of the partition lattice.” A survey of combinatorial theory (dedicated to R.C. Bose on the occasion of his seventieth birthday, and containing the Proceedings of the Internat. Sympos. Combinatorial Math, and its appl., Colorado State Univ., Fort Collins, Colo.), pp. 101–115. North-Holland, Amsterdam, 1973. MR 51.1 2954.
Dowling, Thomas A.; Wilson, Richard M. (1974) “The slimmest geometric lattices.” Trans. Amer. Math. Soc. 196, 203–215. MR 49.2 10579.
Dowling, T.A.; Kelly, D.G. (1974) “Elementary strong maps and transversal geometries.” Discrete Math. 7 (1974), 209–224. MR 48.2 8275.
Dowling, Thomas A.; Wilson, Richard M. (1975) “Whitney number inequalities for geometric lattices.” Proc. Amer. Math. Soc. 47, 504–512. MR 50.1 6900.
Doyle, M.S. (1971) “Minimum path covering algorithms.” Proceedings of the Manitoba Conference on Numerical Mathematics (Univ. Manitoba, Winnipeg, Man.), pp. 127–139. Dept. Comput. Sci., Univ. Manitoba, Winnipeg, Man. MR 52.1 170.
Drake, David A. (1974) “Existence of parallelisms and projective extensions for strongly n-uniform near affine Hjelmslev planes.” Geometriae Dedicata 3, 191–214.MR 50.1 1105.
Druffel, L.E.; Schmidt, D.C.; Simpson, J.E. (1975) “A partitioning isomorphism algorithm for directed graphs using the F matrix.” Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 231–264. Congressus Numerantium, No. XIV, Utilitas Math., Winnipeg, Man. MR 54.1 2515.
Duarte, J.A.M.S.; Ruskin, H.J. (1981) “The branching of real lattice trees as dilute polymers.” (French summary), J. Physique 42, no. 12, 1585–1590. MR 83c:05043.
Dubois, Jacques-Emile; Bonnet, Jean-Claude (1970) “Systeme DARC. Description par propagation concentrique d’un environement limite. Methode de representation des graphes values et des graphes orientes.” C.R. Acad. Sci. Paris Ser. A-B 270, A1002–A1005. MR 41.1 1584.
Ducamp, A. (1966) “Sur la dimension d’un ordre partiel.” (English summary), Theory of Graphs (Internat. Sympos., Rome), pp. 103–112. Gordon and Breach, New York; Dunod, Paris, 1967. MR 36.2 3684.
DuCasse, Edgar (1974) “An enumeration of a class of multiple-valued functions.” Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 375–394. Congressus Numerantium, No. X, Utilitas Math., Winnipeg, Man. MR 52.2 10445.
Duchamp, Alain (1972) “Sur certains matroides definis a partir des graphes.” C.R. Acad. Sci. Paris Ser. A-B 274, A9–A11. MR 45.2 5004.
Duchamp, Alain (1979) “Formes bilineaires symetriques sur un espace vectoriel de dimension finie sur le corps a deux elements: applications aux matroides binaires.” (English summary), Combinatorics 79 (Proc. Colloq., Univ. Montreal, Montreal, Que.), Part II. Ann. Discrete Math. 9 (1980), 269–276. MR 82c:05039.
Duchet, Pierre (1978) “Colorations transitives des graphes.” (English summary), Colloque Mathematiques
Duchet, P . (1979) “Graphes noyau-parfaits.” (English summary), Combinatorics 79 (Proc. Colloq., Univ. Montreal, Montreal, Que.), Part II. Ann. Discrete Math. 9 (1980), 93–101. MR 81k:05051.
Duchet, Pierre; Meyniel, Henri (1981) “A note on kernel-critical graphs.” Discrete Math. 33, no. 1, 103–105. MR 81k:05052.
Dugue, D. (1966) “Geometrie algebrique finie et plans d’experiences.” Rend. Mat. e Appl. (5) 25, 139–146. MR 35.2 6577.
Dulmage, A.L.; Mendelsohn, N.S. (1967) “Graphs and matrices.” Graph Theory and Theoretical Physics, pp. 167–227. (loose errata) Academic Press, London. MR 40.2 5468.
Dunstan, F.D.J.; Ingleton, A.W.; Welsh, D.J.A. (1972) “Supermatroids.” Combinatorics (Proc. Conf. Combinatorial Math., Math. Inst., Oxford), pp. 72–122. Inst. Math, appl., Southend-on-Sea. MR 49.1 4813.
Dunstan, F.D.J.; Welsh, D.J.A. (1973) “A greedy algorithm for solving a certain class of linear programmes.” Math. Programming 5, 338–353. MR 49.1 93.
Dushnik, B. (1950) “Concerning a certain set of arrangements.” Proc. Amer. Math. Soc., 1, 788–796.
Dutton, R.D.; Brigham, R.C. (1983) “A characterization of competition graphs.” Discrete Applied Math., 6, in press.
Dvorak, Stanislav; Vaculin, Jaroslav (1969) “The choice of subgraphs from the oriented acyclic graph.” (Czech. English summary), Ekonom.-Mat. Obzor 5, 454–464. MR 41.2 5245.
Dvorak, S.; Kropac, B. (1974) “Decomposition of the Gozinto’s graph with the use of a nesting store.” Comput. J. 17, 245–248. MR 52.1 4698.
Edelman, Paul H. (1982) “Multichains, noncrossing partitions and trees.” Discrete Math. 40, no. 2–3, 171–179. MR 83m:05048.
Edmonds, Jack (1965) “Maximum matching and a polyhedron with 0,1-vertices.” J. Res. Nat. Bur. Standards Sect. B 69B, 125–130. MR 32.1 1012.
Edmonds, Jack; Fulkerson, D.R. (1965) “Transversals and matroid partition.” J. Res. Nat. Bur. Standards Sect. B 69B, 147–153. MR 32.2 5531.
Edmonds, Jack (1971) “Matroids and the greedy algorithm.” Math. Programming 1, 127–136. MR 45.2 6414.
Edmonds, Jack (1972) “Edge-disjoint branchings.” Combinatorial algorithms (Courant Comput. Sci. Sympos., No. 9), pp. 91–96. Algorithmics Press, New York, 1973. MR 50.1 4377.
Edmonds, Allan L.; Fintushel, Ronald (1976) “Singular circle fiberings.” Math. Z. 151, no. 1, 89–99. MR 54.2 13946.
Edmonds, Jack; Giles, Rick (1975) “A min-max relation for submodular functions on graphs.” Studies in integer programming (Proc. Workshop, Bonn), pp. 185–204. Ann. of Discrete Math., Vol. 1, North-Holland, Amsterdam, 1977. MR 57.1 165.
Eggleton, R.B.; Holton, D.A. (1978) “Graphic sequences.” Combinatorial mathematics, VI (Proc. Sixth Austral. Conf., Univ. New England, Armidale), pp. 1–10, Lecture Notes in Math., 748, Springer, Berlin, 1979. MR 81g:05092.
Egle, Kuno (1977) “Graphen und Praordnungen.” Mathematik fur Wirtschaftswissenschaftier, Band 5. Bibliographisches Institut, Mannheim-Vienna-Zurich. 208 pp. MR 57 #9629.
Egle, Kuno (1981) “Graphen und praordnungen.” (German) [Graphs and preorders], Second edition. Mathematik fur Wirtschaftswissenschaftier [Mathematics for Economists], 5. Bibliographisches Institut, Mannheim. 207 pp. MR 83c:05001.
Egorov, V.N.; Markov, A.I. (1979) “Adam’s conjecture for graphs with circulant adjacency matrices.” (Russian), Dokl. Akad. Nauk SSSR 249, no. 3, 529–532. MR 81b:05051.
Egorycev, G.P. (1977) “Integral representation and computation of combinatorial sums.” (Russian), Izdat. “Nauka” Sibirsk. Otdel., Novosibirsk. 283 pp. MR 58 #10474.
Einbu, John M. (1980) “The enumeration of bit-sequences that satisfy local criteria.” Publ. Inst. Math. (Beograd) (N.S.) 27 (41), 51–56. MR 83a:05016.
Elekes, G . (1973) “Colouring of infinite subsets of ω.” Infinite and finite sets (Colloq., Keszthely), Vol. I, pp. 393–396. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR 52.1 5428.
Elekes, G.; Hoffmann, G. (1973) “On the chromatic number of almost disjoint families of countable sets.” Infinite and finite sets (Colloq., Keszthely), Vol. I, pp. 397–402. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR 51.2 10105.
Elliott, P.D.T.A. (1966) “Mappings of finite sets.” Mathematika 13, 23–25. MR 33.2 7267.
Elliott, P.D.; Erdos, P. (1968) “Some matching theorems.” J. Indian Math. Soc. (N.S.) 32, 215–219 (1969). MR 44.1 103.
Emerson, W.R. (1970) “A combinatorial invariant for finite Abelian groups with various applications.” J. Combinatorial Theory 9, 72–92. MR 41.1 1870.
Enomoto, Hikoe (1981) “Combinatorially homogeneous graphs.” J. Combin. Theory Ser. B 30, no. 2, 215–223. MR 83h:05070.
Entringer, R.C.; Tolman, L.K. (1978) “Characterizations of graphs having orientations satisfying local degree restrictions.” (Loose Russian summary), Czechoslovak Math. J. 28(103), no. 1, 108–119. MR 58 #10606.
Entringer, R.C.; Slater, P.J. (1981) “On the maximum number of cycles in a graph.” Ars Combin. 11, 289–294. MR 83a:05085.
Eplett, W.J.R . (1977) “A result on tournaments with an application to counting.” Bull. Austral. Math. Soc. 16, no. 2, 273–278. MR 55.2 12536.
Eplett, W.J.R . (1979) “Self-converse tournaments.” Canad. Math. Bull. 22, no. 1, 23–27. MR 80j:05068.
Erdos, P.; Hajnal, A. (1964) “Some remarks on set theory. IX. Combinatorial problems in measure theory and set theory.” Michigan Math. J. 11, 107–127. MR 80j:05068.
Erdos, P.; Moser, L. (1964) “A problem on tournaments.” Canad. Math. Bull. 7, 351–356. MR 29. 2 4046.
Erdos, Paul; Harary, Frank; Tutte, William T. (1965) “On the dimension of a graph.” Mathematika 12, 118–122. MR 32.2 5537.
Erdos, P.; Moon, J.W. (1965) “On sets of consistent arcs in a tournament.” Canad. Math. Bull. 8, 269–271. MR 32.1 57.
Erdos, P.; Goodman, A.; Posa, L. (1966) “The representation of a graph by set intersections.” Canad. J. Math., 18, 106–112.
Erdos, Paul (1968) “Some applications of graph theory to number theory.” The Many Facets of Graph Theory (Proc. Conf., Western Mich. Univ., Kalamazoo, Mich.), pp. 77–82. Springer, Berlin, 1969. MR 40.2 4149.
Erdos, P.; Renyi, A.; Sos. Vera T. (Editors) (1969) “Combinatorial theory and its applications. I-III.” Proceedings of the Colloquium on Combinatorial Theory and its Applications held at Balatonfured, August 24–29, 1969. Colloquia Mathematica societatis Janos Bolyai, 4. North-Holland Publishing Co., Amsterdam-London, 1970. Vol. I: 390 pp.; Vol. II: iv+pp. 395–799; Vol. III: iii+pp. 803–1201. MR 45.2 4981.
Erdos, P.; Hajnal, A.; Milner, E.C. (1969) “Set mappings and polarized partition relations.” Combinatorial Theory and its Applications, I (Proc. Colloq., Balatonfured), pp. 327–363. North-Holland, Amsterdam, 1970. MR 45.2 6636.
Erdos, P.: Hajnal, A. (1971) “Ordinary partition relations for ordinal numbers.” Period. Math. Hungar. 1, no. 3, 171–185. MR 45.2 8531.
Erdos, Pal [Erdos, Paul]; Spencer, Joel (1971) “On a certain problem of Erdos and Hajnal.” (Hungarian. English summary), Mat. Lapok 22, 1–2 (1972). MR 48.1 112.
Erdos, P.; Hajnal, A.; Milner, E.C. (1972) “Simple one-point extensions of tournaments.” Mathematika 19, 57–62. MR 52.1 2947.
Erdos, P.; Meir, A.; Sos, V.T.; Turan, P. (1972) “On some applications of graph theory. I.” Discrete Math. 2, no. 3, 207–228. MR 46.1 5053.
Erdos, P.: Fried, E.; Hajnal, A.; Milner, E.C. (1972) “Some remarks on simple tournaments.” Algebra Universalis 2, 238–245. MR 46.2 5161.
Erdos, P.; Lovasz, L.; Simmons, A.; Straus, EG. (1971) “Dissection graphs of planar point sets.” Proceedings of the Internat. Sympos. Combinatorial Math, and its Appl., Colorado State Univ., Fort Collins, Colo., pp. 139–149. North-Holland, Amsterdam, 1973. MR 51.1 241.
Erdos, P.; Milner, E.C.; Rado, R. (1974) “Intersection theorems for systems of sets. III.” J. Austral. Math. Soc. 18, 22–40. MR 51.1 169.
Erdos, Paul; Kleitman, Daniel J. (1974) “Extremal problems among subsets of a set.” Discrete Math. 8, 281–294. MR 48.2 10821.
Erdos, P.; Hajnal, A.; Shelah, S. (1972) “On some general properties of chromatic numbers.” Topics in topology (Proc. Colloq., Keszthely), pp. 243–255. Colloq. Math. Soc. Janos Bolyai, Vol. 8, North-Holland, Amsterdam, 1974. MR 50.2 9662.
Erdos, P.; Galvin, F.; Hajnal, A. (1973) “On set-systems having large chromatic number and not containing prescribed subsystems.” Infinite and finite sets (Colloq., Keszthely), Vol. I, pp. 425–513. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR 53.1 2727.
Erdos, P . (1973) “Problems and results on finite and infinite combinatorial analysis.” Infinite and finite sets (Colloq., Keszthely), Vol. I, pp. 403–424. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR 52.2 10438.
Erdos, P . (1975) “Problems and results in graph theory and combinatorial analysis.” Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen), pp. 169–192. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976. MR 53.2 13006.
Erdos, P.; Graham, R.L.; Szemeredi, E. (1976) “On sparse graphs with dense long paths.” Computers and mathematics with applications, pp. 365–369. Pergamon, Oxford. MR 57 #16131.
Erdos, P . (Chairman) (1975) “Unsolved problems.” Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen), pp. 678–696. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man. 1976. MR 53.1 141.
Erdos, P . (1978) “Old and new problems in combinatorial analysis and graph theory.” Second International Conference on Combinatorial Mathematics (New York), pp. 177–187, Ann. New York Acad. Sci., 319, New York Acad. Sci., New York, 1979. MR 81a:05033.
Erdos, Paul (1977) “Problems and results in graph theory and combinatorial analysis.” Graph theory and related topics (Proc. Conf., Univ. Waterloo, Waterloo, Ont.), pp. 153–163, Academic Press, New York, 1979. MR 81a:05034.
Erdos, Paul; Lovasz, Laszlo; Spencer, Joel (1977) “Strong independence of graphcopy functions.” Graph theory and related topics (Proc. Conf., Univ. Waterloo, Waterloo, Ont.), pp. 165–172, Academic Press, New York, 1979.
Erdos, P.; Szemeredi, E. (1978) “Combinatorial properties of systems of sets.” J. Combinatorial Theory Ser. A 24, no. 3, 308–313. MR 58 #10467.
Erdos, Peter L.; Furedi, Z. (1980) “On automorphisms of line-graphs.” European J. Combin. 1, no. 4, 341–345. MR 82c:05081.
Erdos, P. [Erdos, Paul] (1981) “On the combinatorial problems which I would most like to see solved.” Combinatorica 1, no. 1, 25–42. MR 82k:05001.
Erdos, P. [Erdos, Paul] (1980) “Problems and results in graph theory.” The theory and applications of graphs (Kalamazoo, Mich.), pp. 331–341, Wiley, New York, 1981. MR 83c:05112.
Erdos, P . [Erdos, Paul] (1978) “Some applications of graph theory and combinatorial methods to number theory and geometry.” Algebraic methods in graph theory, Vol. I, II (Szeged), pp. 137–148, Colloq. Math. Soc. Janos Bolyai, 25, North-Holland, Amsterdam, 1981. MR 83g:05001.
Erdos, Paul (1980) “Some new problems and results in graph theory and other branches of combinatorial mathematics.” Combinatorics and graph theory (Calcutta), pp. 9–17, Lecture Notes in Math., 885, Springer, Berlin-New York, 1981. MR 83k:05038.
Erickson, D. Bruce (1975) “Arbitrarily traceable graphs and digraphs.” J. Combinatorial Theory Ser. B 19, no. 1, 5–23. MR 53.1 2749.
Erne, Marcel (1974) “Struktur- und Anzahlformeln fur Topologien auf endlichen Mengen.” Manuscripta Math. 11, 221–259. MR 50.2 12750
Erusalimskii, Ya. M. [Erusalimskii, Ja. M. ]; Svetlov, G.G. (1980) “Bijoin points, bibridges, and biblocks of directed graphs.” Kibernetika (Kiev), no. 1, ii, 37–39, 150 (Russian); translated as Cybernetics 16, no. 1, 41–44. MR 81k:05053.
Escalante, Fernando (1972) “Schnittverbande in Graphen.” Abb. Math. Sem. Univ. Hamburg 38, 199–220. MR 47.1 3250.
Escalante, F . (1973) “Cut-set lattices of graphs.” Combinatorics (Proc. British Combinatorial Conf., Univ. Coll. Wales, Aberystwyth), pp. 35–36. London Math. Soc. Lecture Note Ser., No. 13, Cambridge Univ. Press, London, 1974. MR 50.1 4394.
Escalante, F.; Simoes Pereira, J.M.S. (1976) “Just two total graphs are complementary.” Monatsh. Math. 81, no. 1, 5–13. MR 53.2 7860.
Esser, Friedrich; Harary, Frank (1980) “Digraphs with real and Gaussian spectra.” Discrete Appl. Math. 2, no. 2, 113–124. MR 81m:05096.
Esser, Friedrich; Harary, Frank (1981) “The pairing theorem for digraph spectra.” Bull. Malaysian Math. Soc. (2) 4, no. 1, 17–19. MR 83b:05091.
Eufinger, Jurgen (1971) “Operations on directed graphs.” J. Reine Angew. Math. 247, 146–154. MR 3170.
Evans, Trevor (1963) “A decision problem for transformations of trees.” Canad. J. Math. 15, 584–590. MR 27.2 4220.
Even, Shimon (1973) “Algorithmic combinatorics.” The Macmillan Co., New York; Collier-Macmillan Publishers, London, xii+260 pp. MR 49.1 48.
Everett, Martin; Nieminen, Juhani (1980) “Partitions and homomorphisms in directed and undirected graphs.” J. Math. Sociol. 7, no. 1, 91–111. MR 81e:05115.
Evstigneev, V.A . (1966) “On the optimal weight of elements of a network.” (Russian), Problemy Kibernet. No. 17, 219–223. MR 35.2 5219.
Evstigneev, V.A . (1978) “A local algorithm for finding the bicomponents in a directed graph.” (Russian), Z. Vycist. Mat. i Mat. Fiz. 18, no. 5, 1345–1349, 1360. MR 80b:05032.
Faber, Vance (1972) “Hypergraph reconstruction.” Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio), pp. 85–94. Lecture Notes in Math., Vol. 411, Springer, Berlin, 1974. MR 51.1 277.
Faber, Vance (1977) “An upper bound for the minimum valency of a graph embedded in a compact 2-manifold.” Portugal. Math. 36, no. 2, 139–152 (1980). MR 81h:05057.
Fadini, A. (1972) “Una decomposizione in grafi parziali dell’l-grafo orientato, completo, simmetrico di ordine n.” Ricerca (Napoli) (2) 23, gennaio-aprile, 11–14. MR 47. 2 4843.
Fagin, Ronald (1977) “The number of finite relational structures.” Discrete Math. 19, no. 1, 17–21. MR 56.2 15444.
Faigle, Ulrich (1980) “Geometries on partially ordered sets.” J. Combin. Theory Ser. B 28, no. 1, 26–51. MR 81m:05054.
Fajtlowicz, Siemion (1977) “A graph-theoretical generalization of a Cantor theorem.” Proc. Amer. Math. Soc. 63, no. 1, 177–179. MR 55.1 5477.
Faradzev, I. A . (1976) “Constructive enumeration of combinatorial objects.” (French summary), Colloq. Internat. CNRS, Univ. Orsay, Orsay, pp. 131–135, Colloques Internat. CNRS, 260, CNRS, Paris, 1978. MR 80i:05049.
Feinberg, Robert B. (1977) “Characterization of incidence algebras.” Discrete Math. 17, no. 1, 47–70. MR 57.1 2943.
Fendel, Daniel (1967) “The number of classes of linearly equivalent functions.” J. Combinatorial Theory 3, 48–53. MR 35.2 5336.
Farmer, Frank D. (1975) “The homology of reflexive relations.” Math. Japon. 20, no. 1, 21–28. MR 53.1 5349.
Fernandez de Troconiz, A . (1966) “Hamiltonian paths and circuits in strongly connected graphs.” (Spanish), Trabajos Estadist. 17, 17–32. MR 34.1 1222.
Farrahi, Bijan (1975) “On isometries of planes, with the Euclidean-like metric, over Galois fields.” Abb. Math. Sem. Univ. Hamburg 43, 51–58. MR 52.1 4097.
Ferri, Massimo (1978) “A non-Cayleyian diagram for presentations of groups.” J. Combin. Inform. System Sci. 3, no. 4, 245–254. MR 80i:05045.
Ferro, Maria (1973) “Caratteristiche dei singrammi orientati.” Riv. Mat. Univ. Parma (3) 2, 159–173. MR 54.1 136.
Fiedler, M . (1963) “Some applications of the theory of graphs in matrix theory and geometry.” Proc. Sympos. Smolenice, pp. 37–41. Publ. House Czechoslovak Acad. Sci., Prague, 1964. MR 30.2 5294.
Fiedler, M . (1966) “Graphs and linear algebra.” (French summary), Internat. Sympos., Rome, pp. 131–134. Gordon and Breach, New York; Dunod, Paris, 1967. MR 36.2 6313.
Fiedler, Miroslav (Editor) (1974) “Recent advances in graph theory.” Proceedings of the Second Czechoslovak Symposium held in Prague, June 1974. Academia, Prague, 1975. 544 pp. (loose errata). MR 51.1 217.
Fidler, M . [Fiedler, M.] (1976) “An application of graphs to the Gaussian elimination method.” (Russian), Zap. Naucn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 58, 72–79, 160. MR 57 #18047.
Fiedler, M . (1976) “Aggregation in graphs.” Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely), Vol. I, pp. 315–330, colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 80g:05050.
Filipponi, P. (1980) “On the number of transitive digraphs with n labeled vertices and k arcs.” Calcolo 17, no. 4, 365–378 (1981). MR 82k:05064.
Filippov, N.D . (1968) “Comparability graphs of partially ordered sets of certain types.” (Russian), Ural. Gos. Univ. Mat. Zap. 6, tetrad’ 3, 86–108. MR 42.2 4453.
Filus, Lidia (1977) “A combinatorial lemma related to the search of fixed points.” (Russian summary), Bull. Acad. Polon. Sci. Ser. Sci. Math. Astronom. Phys. 25, no. 7, 615–616. MR 57.1 126.
Filus, Lidia (1979) “Fixed point algorithms and some graph problems.” Sympos. Fixed Point Algorithms and Complementarity Problems, Univ. Southampton, Southampton, pp. 241–249, North-Holland, Amsterdam, 1980. MR 81e:05090.
Finck, Hans-Jaochim; Sachs, Horst (1973) “Uber Beziehungen zwischen Struktur und spektrum regularer Graphen.” Wiss. Z. Techn. Hochsch. Ilmenau 19, Heft 3/4, 83–99. MR 48.1 5899.
Fink, John Frederick; Lesniak-Foster, Linda (1980) “Graphs for which every unilateral orientation is traceable.” Ars Combin. 9, 113–118. MR 81i:05074.
Fink, John Frederick; Straight, H. Joseph (1981) “A note on path-perfect graphs.” Discrete Math. 33, no. 1, 95–98. MR 82a:05077.
Fink, John Frederick (1982) “Randomly antitraceable digraphs.” J. Graph Theory 6, no. 4, 481–488. MR 83m:05094a.
Fishburn, Peter C. (1968) “Additive representations of real functions on product sets.” J. Combinatorial Theory 4, 397–402. MR 36.1 1338.
Fishburn, Peter C.; Spencer, Joel H. (1971) “Directed graphs as unions of partial orders.” Pacific J. Math. 39, 149–161. MR 46.2 5162.
Fishburn, Peter C. (1973) “Internal coverings of sets by asymmetric relations.” J. Combinatorial Theory Ser. B 14, 195–202. MR 47.2 6494.
Fishburn, Peter C. (1976) “On linear extension majority graphs of partial orders.” J. Combinatorial Theory Ser. B 21, no. 1, 65–70. MR 57 #9592.
Fisher, James L. (1977) “Application-oriented algebra.” IEP-A Dun-Donnelley Publisher, New York, xviii+362 pp. MR 56.2 15111.
Fisher, Michael e. (1966) “On hearing the shape of a drum.” J. Combinatorial Theory 1, 105–125. MR 33.2 5509.
Fisk, Steve (1978) “The nonexistence of colorings.” J. Combinatorial Theory Ser. B 24, no. 2, 247–248. MR 58 #10562.
Fitialov, S. Ya. [Fitjalov, S. Ja.]; Tseitin, G.S. [Ceitin, G.S.] (1966) “Estimates of the number of syntactical structures with various restrictions.” Kibernetika (Kiev), no. 6, 85–95 (Russian); translated as Cybernetics 2, no. 6, 68-75 (1969). MR 40.2 4172.
FitzGerald, Carl H.; Manaster, Alfred B. (1977) “Mappings related to permutations.” J. Combinatorial Theory Ser. A 23, no. 2, 128–139. MR 56.1 2837.
Flachsmeyer, Jurgen (1977) “Kombinatoryka.” (Polish) [Combinatorics], Panstwowe Wydawnictwo Naukowe, Warsaw. 219 pp. MR 56.2 15431.
Flament, Claude (1965) “Theorie des graphes et structures sociales.” Mathematiques et Sciences de l’Homme, No. 2. Editions Mouton, Paris; Editions Gauthier=Villars, Paris. 166 pp. MR 36.2 5018.
Flament, C . (1975) “Aretes maximales des cocycles d’un graphe preordonne.” (English summary), Math. Sci. Humaines No. 51, 5–12, 85. MR 57 #16132.
Flament, Claude (1978) “Hypergraphes arbores.” Discrete Math. 21, no. 3, 223–227. MR 80d:05040.
Flanigan, J.A. (1981) “Selective sums of loopy partizan graph games.” Internat. J. Game Theory 10, no. 1, 1–10. MR 83c:05063.
Fleischner, H.; Vestergaard, P.D. (1977) “Value-true walks in finite, connected, valuated graphs.” Monatsh. Math. 83, no. 1, 1–8. MR 57.1 172.
Flinchbaugh, B.E.; Jones, L.K. (1981) “Strong connectivity in directional nearest-neighbor graphs.” SIAM J. Algebraic Discrete Methods no. 4, 461–463. MR 83b:05086.
Florence, John B. (1980) “Consanguinity graphs.” Discrete Math. 32, no. 3, 225–228. MR 81m:05072.
Foata, Dominique (1979) “A matrix analog for Viennot’s construction of the Robinson correspondence.” Linear and Multilinear Algebra 7, no. 4, 281–298. MR 80k: 05011.
Foata, Dominique (1965) “Etude algebrique de certains problemes d’analyse combinatoire et du calcul des probabilites.” Publ. Inst. Statist. Univ. Paris 14, 81–241. MR 36.1 3392.
Foldes, S. (1977) “A characterization of hypercubes.” Discrete Math. 17, no. 2, 155–159. MR 56.2 8433.
Foldes, Stephane; Hammer, Peter L. (1976) “The Dilworth number of a graph.” Algorithmic aspects of combinatorics (Conf., Vancouver Island, B.C.). Ann. Discrete Math. 2, 211–219. MR 80c:05111.
Foldes, S.; Hammer, P.L. (1976) “On a class of matroid-producing graphs.” Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely), Vol. I, pp. 331–352, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 80c:05110.
Foldes, Stephane (1980) “Symmetries of directed graphs and the Chinese remainder theorem.” J. Combin. Theory Ser. B 28, no. 1, 18–25. MR 81h:05075.
Folkman, Jon; Fulkerson, D.R. (1970) “Flows in infinite graphs.” J. Combinatorial Theory 8, 30–44. MR 42.1 2964.
Fomin, S.V . (1978) “Finite, partially ordered sets and Young diagrams.” (Russian), Dokl. Akad. Nauk SSSR 243, no. 5, 1144–1147. MR 80b:05002.
Fook, Leong (1976) “Quasigraphs and quasigroups.” Nanta Math. 9, no. 1, 80–83. MR 58 #352.
Forcade, Rodney (1973) “Smallest maximal matchings in the graph of the d-dimensional cube.” J. Combinatorial Theory Ser. B 14, 153–156. MR 48.1 171.
Foulkes, J.D . (1960) “Directed graphs and assembly schedules.” Proc. Sympos. Appl. Math., Vol. 10, pp. 281–289. American Mathematical Society, Providence, R.I. MR 22.2 9456.
Fouquet, J.L.; Jolivet, J.L. (1978) “Hypohamiltonian oriented graphs.” Cahiers Centre Etudes Rech. Oper. 20, no. 2, 171–181. MR 58 #16373.
Fouquet, J.-L.; Jolivet, J.-L. (1976) “Graphes hypohamiltoniens orientes.” (English summary), Colloq. Internat. CNRS, Univ. Orsay, Orsay, pp. 149–151, colloques Internat. CNRS, 260, CNRS, Paris, 1978. MR 81h:05094.
Fouquet, J.L.; Jolivet, J.L.; Riviere, M. (1981) “Graphes cubiques d’indice trois, graphes cubiques isochromatiques, graphes cubiques d’indice quatre.” (English summary) [Cubic graphs of index three, isochromatic cubic graphs, cubic graphs of index four], J. Combin. Theory Ser. B 31, no. 3, 262–281. MR 83a:05060.
Fournier, J.C . (1970) “Representation sur un corps des matroides d’ordre ≦ 8.” Rencontre Franco-Britannique, Brest, pp. 50–61. Lecture Notes in Math., Vol. 211, Springer, Berlin, 1971. MR 51.2 12575.
Fournier, Jean-Claude (1972) “Sur les isomorphismes d’hypergraphes.” C.R. Acad. Sci. Paris Ser. A-B 274, A1612–A1614. MR 47.2 4860.
Fournier, Jean-Claude (1973) “Orthogonalite generalisee entre matroides et application a la representation des graphes sur les surfaces.” C.R. Acad. Sci. Paris Ser. A-B 276, A835–A838. MR 51.1 7903.
Fournier, Jean Claude (1974) “Une relation de separation entre cocircuits d’un matroide.” (English summary), J. Combinatorial Theory Ser. B 16, 181–190. MR 49.1 2432.
Fournier, Jean-Claude (1978) “Une caracterisation des graphes de cordes.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 286, no. 19, A811–A813. MR 58 #16414.
Fournier, J.-C . (1979) “Introduction a la notion de matroide.” (French) [Introduction to the notion of a matroid], Publications Mathematiques d’Orsay 79, 3. Universite de Paris-Sud, Departement de Mathematique, Orsay. 57 pp. MR 8la-.05027.
Fournier, Reine (1975) “Irreducible subdirect representations of graphs.” Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen), pp. 203–209. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976. MR 52.2 13499.
Fraenkel, A.S.; Yesha, Y. (1976) “Theory of annihilation games.” Bull. Amer. Math. Soc. 82, no. 5, 775–777. MR 56.1 8027.
Francon, Jean (1975) “Acyclic and parking functions.” J. Combinatorial Theory Ser. A 18, 27–35. MR 50.2 9611.
Frank, Andras (1975) “Some polynomial algorithms for certain graphs and hypergraphs.” Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen), pp. 211–226. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976. MR 52.2 13500.
Frank, Andras (1977/78) “On a class of balanced hypergraphs.” Discrete Math. 20, no. 1, 11–20. MR 58 #16415.
Frank, A. [Frank, Andras]; Gyarfas, A. (1976) “How to orient the edges of a graph?” Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely), Vol. I, pp. 353–364, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 80c:05078.
Frank, Andras (1979) “Kernel systems of directed graphs.” Acta Sci. Math. (Szeged) 41, no. 1–2, 63–76. MR 81e:05075a.
Frank, Andras (1979) “Covering branchings.” Acta Sci. Math. (Szeged) 41, no. 1–2, 77–81. MR 81e:05075b.
Frank, Andras (1980) “On the orientation of graphs.” J. Combin. Theory Ser. B 28, no. 3, 251–261. MR 81i:05075.
Frank, Andras (1981) “How to make a digraph strongly connected.” Combinatorica 1, no. 2, 145–153. MR 82j:05061.
Frank, Andras (1982) “A note on k-strongly connected orientations of an undirected graph.” Discrete Math. 39, no. 1, 103–104. MR 83m:05066.
Frank, Ove (1977) “Estimation of graph totals.” Scand. J. Statist. 4, no. 2, 81–89. MR 56.2 16859.
Frank, Ove; Harary, Frank (1980) “Maximum triad counts in graphs and digraphs.” J. Combin. Inform. System Sci. 5, no. 1, 1–9. MR 81h:05081.
Frank, O. (1980) “On random planar graphs.” The theory and applications of graphs (Kalamazoo, Mich.), pp. 363–372, Wiley, New York, 1981. MR 83b:05060.
Frankl, P. (1974) “A theorem on Sperner-systems satisfying an additional condition.” Studia Sci. Math. Hungar. 9, no. 3–4, 425–431 (1975). MR 53.1 5314.
Frankl, P. (1976) “On Sperner families satisfying an additional condition.” J. Combinatorial Theory Ser. A 20, no. 1, 1–11. MR 53.1 2693.
Frankl, P. (1978) “A Sperner-type theorem for families of finite sets.” Period. Math. Hungar. 9, no. 4, 257–267. MR 80g:05010.
Frankl, Peter (1981) “On a problem of Chvatal and Erdos on hypergraphs containing no generalized simplex.” J. Combin. Theory Ser. A 30, no. 2, 169–182. MR 83k:05086.
Frasnay, Claude (1964) “Partages d’ensembles de parties et de produits d’ensembles; applications a la theorie des relations.” C.R. Acad. Sci. Paris 258, 1373–1376. MR 32.2 5532.
Frasnay, Claude (1965) “Quelques problemes combinatoires concernant les ordres totaux et les relations monomorphes.” Ann. Inst. Fourier (Grenoble) 15, fasc. 2, 415–524. MR 33.1 54.
Fredman, Michael L. (1976) “New bounds on the complexity of the shortest path problem.” SIAM J. Comput. 5, no. 1, 83–89. MR 53.2 7856.
Fredricksen, Harold (1970) “Asymptotic behavior of Golomb’s Z(n) conjecture.” IEEE Trans. Information Theory IT-16, 509–510. MR 43.1 1740.
Fridman, A.A . (1973) “Problems on finite sets.” (Russian), Ekonom. i Mat. Metody 9, 1124–1129. MR 49.2 10617.
Fridman, G.S . (1973) “Radially critical directed graphs.” (Russian), Dokl. Akad. Nauk SSSR 212, 565-568. MR 54.1 137.
Fried, E . (1969) “On homogeneous tournaments.” Combinatorial Theory and its Applications, II (Proc. Colloq., Balatonfured), pp. 467–476. North-Holland, Amsterdam, 1970. MR 45.2 6688.
Fried, E.; Wiegandt, R. (1975) “Connectednesses and disconnectednesses of graphs.” Algebra Universalis 5, no. 3, 411–428. MR 56.2 15474.
Frucht W., Roberto; Rota, Gian-Carlo (1963) “The Mobius function for partitions of a set.” (Spanish), Scientia (Valparaiso) No. 122, 111–115. MR 33.1 55.
Frucht, Roberto [Frucht W., Roberto]; Gewirtz, Allan; Quintas, Louis V. (1972) “Extremal edge graphs having given automorphism group.” Proceedings of the Third Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 213–129. MR 50.1 176.
Frucht, Robert [Frucht W., R.]; Harary, Frank (1974) “Self-complementary generalized orbits of a permutation group.” Canad. Math. Bull. 17, 203–208; correction, ibid. 17, no. 3, 427. MR 51.1 5381.
Frye, William G.; Laskar, Renu (1980) “Path number of bipartite digraphs.” J. Combin. Theory Ser. B 28, no. 2, 243–244. MR 81e:05076.
Freeman, J.M. (1972) “On the classification of operator identities.” Studies in Appl. Math. 51, 73–84. MR 47.1 2218.
Freeman, J.M . (1978) “New solutions to the Rota/ Mullin problem of connection constants.” Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 301–305, Congress. Numer., XXI, Utilitas Math., Winnipeg, Man. MR 80c:05019.
Friedlander, Richard J.; Gordon, Basil; Miller, Michael D. (1978) “On a group sequencing problem of Ringel.” Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 307–321, Congress. Numer., XXI, Utilitas Math., Winnipeg, Man. MR 80c:05079.
Fu, Yumin (1968) “Dominating set and converse dominating set of a directed graph.” Amer. Math. Monthly 75, 861–863. MR 39.2 4050.
Fujishige, Satoru (1977) “An algorithm for finding an optimal independent linkage.” J. Operations Res. Soc. Japan 20, no. 1, 59–75. MR 58 #9173.
Fulkerson, D.R.; Gross, O.A. (1965) “Incidence matrices and interval graphs.” Pacific J. Math., 15, 835–855.
Fulkerson, D.R . (1972) “On the perfect graph theorem.” Proc. Advanced Sem., Univ. Wisconsin, Madison, Wise., pp. 69–76. Math. Res. Center Publ., No. 30, Academic Press, New York, 1973. MR 51.2 10147.
Fulkerson, D.R . (Editor) (1975) “Studies in graph theory. Part I.”Studies in Mathematics, Vol. 11 The Mathematical Association of America, Washington, D.C. x+199+9 pp. MR 52.2 13446.
Fulkerson, D.R . (Editor) (1975) “Studies in graph theory. Part II.” Studies in Mathematics, Vol. 12 . The Mathematical Association of America, Washington, D.C. xi+201-413+9 pp. MR 52.2 13447.
Fulkerson, D.R.; Harding, G.C. (1976) “On edge-disjoint branchings.” Networks 6, no$12, 97–104. MR 56. 1 177.
Fulton, John D. (1967) “Products and linear combinations of involutory matrices in the same P-class.” Duke Math. J. 34, 431–435. MR 36.1 1464.
Furedi, Z . (1978) “Erdos-Ko-Rado type theorems with upper bounds on the maximum degree.” Algebraic methods in graph theory, Vol. I, II (Szeged), pp. 177–207, Colloq. Math. Soc. Janos Bolyai, 25, North-Holland, Amsterdam, 1981. MR 83g:05002.
Furedi, Z. (1982) “On a problem of Deza and Frankl.” Ars Combin. 13, 221–222. MR 83i:05008.
Gabai, H. (1974) “N-dimensional interval graphs.” mimeographed, York College, CUNY, New York.
Gabow, Harold (1976) “Decomposing symmetric exchanges in matroid bases.” Math. Programming 10, no. 2, 271–276. MR 55.1 146.
Gabow, Harold N. (1977) “Two algorithms for generating weighted spanning trees in order.” SIAM J. Comput. 6, no. 1, 139–150. MR 56.1 179.
Gabow, Harold N.; Myers, Eugene W. (1978) “Finding all spanning trees of directed and undirected graphs.” SIAM J. Comput. 7, no. 3, 280–287. MR 58 #13886.
Gadasin, V.A . (1979) “Asymptotic characteristics of the connectedness of a planar random graph in the form of a lattice.” Izv. Akad. Nauk SSSR Tehn. Kibernet., no. 4, 140–149, 221 (Russian); translated as Engrg. Cybernetics 17, no. 4, 123–133 (1980). MR 81m:05117.
Gallai, Tibor (1957) “Maximum-minimum theorems for networks. I, II.” (Hungarian), Magyar Tud. Akad. Mat. Fiz. Oszt. Kozl. 7, 305–338; 8 (1958), 1–40. MR 23.A A1552a.
Gallai, T . (1959) “Uber regulare Kettengruppen.” (Russian summary, unbound insert), Acta Math. Acad. Sci. Hungar. 10, 227–240. MR 23A A1553.
Gallai, T.; Milgram, A.N. (1960) “Verallgemeinerung eines graphentheoretischen Satzes von Redei.” Acta Sci. Math. (Szeged) 21, 181–186. MR 25.2 3862.
Gallai, T. (1966) “On directed paths and circuits.” Theory of Graphs (Proc. Colloq., Tihany), pp. 115–118. Academic Press, New York, 1968. MR 38.1 2054.
Gallai, T. (1967) “Transitiv orientierbare Graphen.” Acta Math. Acad. Sci. Hungar. 18, 25–66. MR 36.2 5026.
Ganley, Michael J.; Spence, Edward (1975) “Relative difference sets and quasiregular collineation groups.” J. Combinatorial Theory Ser. A 19, no. 2, 134–153. MR 51.2 12568.
Gannich, P.A.; Spol’nik, N.S. (1981) “A problem on a finite digraph without cycles.” (Russian), Akad. Nauk Ukrain. SSR Inst. Mat. Preprint no. 28, Struktura i Topolog. Svoistva Grafov, 55–57, 59. MR 83c:05064.
Gardiner, A. (1974) “Antipodal covering graphs.” J. Combinatorial Theory Ser. B 16, 255–273. MR 49.1 4846.
Gardiner, A. (1978) “Homogeneity conditions in graphs.” J. Combin. Theory Ser. B 24, no. 3, 301–310. MR 80b:05034.
Garey, M.R.; Graham, R.L.; Johnson, D.S.; Knuth, D.E. (1978) “Complexity results for bandwidth minimization.” SIAM J. Appl. Math. 34, no. 3, 477–495. MR 57 #18220.
Garncarek, Zbigniew; Romanowicz, Zbigniew (1977) “The structure of extremal even digraphs.” (Polish and Russian summaries), Prace Nauk. Inst. Mat. Politechn. Wroclaw. No. 17 Ser. Stud, i Materialy No. 13, 45–51. MR 57 # 16133.
Gati, Georg; Harary, Frank; Robinson, Robert W. (1982) “Line colored trees with extendable automorphisms.” Acta Math. Sci. 2, no. 1, 105–110. MR 83i:05028.
Gaul, W.; Heinecke, A. (1975) “Einige Aspekte in der Zuordnungstheirie.” (English summary), Z. Operations Res. Ser. A-B 19, no. 3, A89–A99. MR 55.2 12115.
Gaul, Wolfgang (1978) “Some structural properties of project digraphs.” J. Combin. Inform. System Sci. 3, no. 4, 217–222. MR 80k:05061.
Gavalec, Martin; Vojtas, Peter (1980) “Remarks to a modification of Ramsey-type theorems.” Comment. Math. Univ. Carolin. 21, no. 4, 727–738. MR 82i:05053.
Gavril, Fanica (1972) “Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph.” SIAM J. Comput. I, no. 2, 180–187. MR 48.1 5922.
Gavril, Fanica (1975) “A recognition algorithm for the intersection graphs of directed paths in directed trees.” Discrete Math. 13, no. 3, 237–249. MR 53.1 5358.
Gedeonova, Eva (1981) “The orientability of the direct product of graphs.” (Russian summary), Math. Slovaca 31, no. 1, 71–78. MR 83i:05066.
Geissinger, Ladnor (1973) “Valuations on distributive lattices. II” Arch. Math. (Basel) 24, 337–345. MR 49.1 4890.
Gel’fand, I.M.; Ponomarev, V.A. (1980) “Representations of graphs. Perfect subrepresentations.” (Russian), Funktsional. Anal, i Prilozhen. 14, no. 3, 14–31, 96. MR 83c:05113.
Geller, Dennis P.; Harary, Frank (1968) “Arrow diagrams are line digraphs.” SIAM J. Appl. Math. 16, 1141–1145. MR 38.2 3179.
Geller, Dennis P. (1968) “The square root of a digraph.” J. Combinatorial Theory 5, 320–321. MR 38.1 80.
Geller, Dennis; Manvel, Bennet (1969) “Reconstruction of cacti.” Canad. J. Math. 21, 1354–1360. MR 40.2 5476.
Geller, Dennis P. (1970) “Minimally strong digraphs.” Proc. Edinburgh Math. Soc. (2) 17, 15–22. MR 42.1 1718.
Geller, Dennis; Harary, Frank (1970) “Connectivity in digraphs.” Proc. Conf., New York, pp. 105–115. Lecture Notes in Mathematics, Vol. 186. Springer, Berlin, 1971. MR 43.2 4724.
Geller, Dennis (1973) “Some graph theory arising from a problem in automata theory.” Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 279–288. Utilitas Math., Winnipeg, Man. MR 52.1 5231.
Geller, Dennis P. (1974) “Walkwise and admissible mappings between digraphs.” Discrete Math. 9, 375–390. MR 49.2 10592.
Georgescu, Horia (1967) “Sur quelques problemes de classification mathematique.” Colloque sur les Techniques de Calcul et les Calculateurs (Bucarest). Bull. Math. Soc. Sci. Math. R.S. Roumanie (N.S.) 12 (60), no. 3, 31–37 (1969). MR 40.1 2193.
Germa, A . (1976) “Decomposition of the edges of a complete t-uniform directed hypergraph.” Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely), Vol. I, pp. 393–399, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 80e:05086.
Gerov, G.H . (1971) “A total ordering of the edges of a graph when they are partially ordered at each vertex.” (Russian. Bulgarian and German summaries), Godisnik Viss. Tehn. Ucebn. Zaved. Mat. 7, no. 4, 33–38 (1973). MR 53.2 7863.
Gerov, GK. b.; Tarandova, R. (1980) “Determination of all elementary contours in an oriented network.” (Bulgarian. German and Russian summaries), Godishnik Vissh. Uchebn. Zaved. Prilozhna Mat. 16, no. 4, 193–201 (1981). MR 83m:05075.
Gervacio, Severino V . (1979) “On graphs all of whose orientations have kernels.” Proceedings of the First Franco-Southeast Asian Mathematical Conference, Vol. II.(Singapore) Southeast Asian Bull. Math., Special Issue b, 259–263. MR 83c:05103.
Geyer, E. Peter (1976/77) “The Mobius function and finite networks.” (Arabic summary), Arabian J. Sci. Engrg. 2, no. 1, 45–48. MR 56.2 15445.
Ghouila-Houri, Alain (1962) “Caracterisation des graphes non orientes dont on peut orienter les aretes de maniere a obtenir le graphe d’une relation d’ordre.” C.R. Acad. Sci. Paris 254, 1370–1371. MR 30.1 2495.
Ghouila-Houri, Alain (1960) “Une condition suffisante d’existence d’un circuit homiltonien.” C.R. Acad. Sci. Paris 251, 495–497. MR 22.1 5590.
Ghouila-Houri, Alain (1960) “Un resultat relatif a la notion de diametre.” C.R. Acad. Sci. Paris 250, 4254–4256. MR 22.1 5589.
Ghouila-Houri, Alain (1964) “Flots et tensions dans un graphe.” Ann. Sci. Ecole Norm. Sup. (3) 81, 267–339. MR 32.1 58.
Giles, R . (1976) “Facets and other faces of branching polyhedra.” Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely), Vol. I, pp. 401–418, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 80i:05043.
Giles, William B. (1974) “The reconstruction of outerplanar graphs.” J. Combinatorial Theory Ser. B. 16, 215–226. MR 49.2 10603.
Gill, M.K . (1980) “A graph theoretical recurrence formula for computing the characteristic polynomial of a matrix.” Combinatorics and graph theory (Calcutta), pp. 261–265, Lecture Notes in Math., 885, Springer, Berlin, 1981. MR 83f:05047.
Gilmore, P.C.; Hoffman, A.J. (1964) “A characterization of comparability graphs and of interval graphs.” Canad. J. Math. 16, 539–548. MR 31.1 87.
Gionfriddo, Mario (1981) “Hypergraphs whose attachment-hypergraphs have complete p-sections.” (Italian), Riv. Mat. Univ. Parma (4) 7, 1–8 (1982). MR 83j:05064.
Give’on, Yehoshafat (1964) “Lattice matrices.” Information and Control 7, 477–484. MR 31.2 6735.
Glagolev, V.V . (1973) “The length of the reduced disjunctive normal form for Boolean functions of dimension 1.” (Russian), Diskret. Analiz No. 22, 29–33, 80. MR 49.1 2202.
Glass, Leon (1973) “A combinatorial analog of the Poincare index theorem.” J. Combinatorial Theory Ser. B 15, 264–268. MR 48.1 5900.
Glivjak, Ferdinand; Plesnik, Jan (1969) “On the existence of certain overgraphs of given graphs.” Acta Fac. Rerum Natur. Univ. Comenian. Math. Publ. 23, 113–119 (1970). MR 45.1 95.
Gliviak, Ferdinand (1976) “On the existence of critically n-connected graphs.” Math. Slovaca 26, no. 1, 53–56. MR 54.2 12559.
Glover, Fred; Klingman, Darwin (1974) “Finding minimum spanning trees with a fixed number of links at a node.” Proc. NATO Advanced Study Inst., Versailles, pp. 191–201. NATO Advanced Study Inst. Ser., Ser. C: Math, and Phys. Sci., Vol. 19, Reidel, Dordrecht, 1975. MR 53.1 7112.
Godsil, C.D. (1977) “Graphs, groups and polytopes.” Proc. Internat. Conf. Combinatorial Theory, Australian Nat. Univ., Canberra, pp. 157–164, Lecture Notes in Math., 686, Springer, Berlin, 1978. MR 80m:05052.
Godsil, C.D. (1981) “On the full automorphism group of a graph.” Combinatorica 1, no. 3, 243–256. MR 83a:05066.
Godsil, C.D . (1978) “GRRs for nonsolvable groups.” Algebraic methods in graph theory, Vol. I, II(Szeged), pp. 221–239, Colloq. Math. Soc. Janos Bolyai, 25, North-Holland, Amsterdam, 1981. MR 83b:05069.
Godsil, C.D. (1982) “Some graphs with characteristic polynomials which are not solvable by radicals.” J. Graph Theory 6, no. 2, 211–214. MR 83j:05060.
Godsil, C.D. (1982) “Eigenvalues of graphs and digraphs.” Linear Algebra Appl. 46, 43–50. MR 83k:05076.
Godwin, D.C.; Sullivan, R.P. (1975) “An instance of the binomial theorem in set theory.” Math. Student 43, 21–24 (1976). MR 56.1 134.
Goebel, Rotraut (1981) “Minimum functors on categories of Neuman trees.” (Czech summary). With a loose Russian summary. Casopis Pest. Mat. 106, no. 4, 357–367, 435–536. MR 83b:05054.
Goethals, Jean-Marie; Delsarte, Philippe (1968) “On a class of majority-logic decodable cyclic codes.” IEEE Trans. Information Theory IT-14, 182–188. MR 40.2 5321.
Goldberg, K. (1959) “Principal submatrices of a full-rowed non-negative matrix.” J. Res. Nat. Bur. Standards Sect. B 63B, 19–20. MR 21.2 6333.
Goldberg, M.K. (1965) “On the stable equivalences of finite graphs.” (Ukrainian. Russian and English summaries ), Dopovidi Akad. Nauk Ukrain. RSR, 1009–1011. MR 33.1 64.
Goldberg, M.K . (1965) “Applications of the method of contractions to strongly connected graphs.” (Russian), First Republic Math. Conf. of Young Researchers, Part II, pp. 155–161. Akad. Nauk Ukrain. SSR Inst. Math., Kiev. MR 33.2 5510.
Goldberg, M.K . (1966) “The diameter of a strongly connected graph.” (Russian), Dokl. Akad. Nauk SSSR 170, 767–769. MR 34.1 2488.
Goldberg, Myron; Moon, J.W. (1966) “On the maximum order of the group of a tournament.” Canad. Math. Bull. 9, 563–569. MR 34.2 4161.
Goldberg, M. [Gol’dberg, M.K.]; Moon, J.W. (1971) “Arc mappings and tournament isomorphisms.” J. London Math. Soc. (2) 3, 378–384. MR 43.2 4725.
Gol’dberg, M.K.; Klipker, I.A. (1975) “A numbering of a uniform tree that minimizes the sum of the lengths of the edges.” (Russian. Georgian and English summaries), Gamoqeneb. Math. Inst. Sem. Mohsen. Anotacie. Vyp. 10, 65–71. MR 53.2 10646.
Goldman, A.J. (1964) “Optimal matchings and degree-constrained subgraphs.” J. Res. Nat. bur. Standards Sect. B 68B, 27–29. MR 29.1 1635.
Goldman, Jay R. (1969) “The method of special cases in combinatorial theory and probability.” Reprinting of Technical Report No. 28, Department of Statistics, Harvard University, Cambridge, Mass., Mobius algebras (Proc. Conf., Univ. Waterloo, Waterloo, Ont., 1971 ). MR 50.1 1892.
Goldschmidt, David M. (1980) “Automorphisms of trivalent graphs.” Ann. of Math. (2) 111, no. 2, 377–406. MR 82a:05052.
Golovko, I.A . (1975) “P-groupoids and P-nets.” (Russian), Mat. Issled. 10, no. 3, 29–43, 239. MR 53.1 5796.
Golumbic, M.C . (1974) “An infinite class of superperfect noncomparability graphs.” IBM Research, RC 5064, October.
Golumbic, Martin Charles (1975) “Comparability graphs and a new matroid.” Proceedings of the Conference on Algebraic Aspects of Combinatorics (Univ. Toronto, Toronto, Ont., pp. 213–217. Congressus Numerantium, No. XIII, Utilitas Math., Winnipeg, Man. MR 53.2 10653.
Golumbic, Martin Charles (1977) “Comparability graphs and a new matroid.” J. Combinatorial Theory Ser. B 22, no. 1, 68–90. MR 55.2 12575.
Golumbic, Martin C. (1976) “Combinatorial merging.” IEEE Trans. Computers C-25, no. 11, 1164–1167. MR 58 #19328.
Golumbic, M.C . (1977) “The complexity of comparability graph recognition and coloring.” (German summary), computing 18, no. 3, 199–208. MR 58 #19345.
Golumbic, Martin Charles (1980) “Algorithmic graph theory and perfect graphs.” Academic Press [Harcourt Brace Jovanovich, Publishers], New York-London-Toronto, Ont. xx+284 pp. MR 81e:68081.
Gondran, M. (1974) “Remarque sur le polytope des couplages d’Edmonds.” Discrete Math. 9, 235–238. MR 50.1 4396.
Gondran, M . (1974) “Path algebra and algorithms.” Proc. NATO Advanced Study Inst., Versailles, pp. 137–148. NATO Advanced Study Inst. Ser., Ser. C: Math, and Phys. Sci., Vol. 19, Reidel, Dordrecht, 1975. MR 53.2 10231.
Gondran, M . (1975) “Algebre des chemins et algorithmes.” (English summary), Bull. Direction Etudes Recherches Ser. C Math. Informat., no. 2, 4, 57–64. MR 57 #16134.
Gondran, M.; Minoux, M. (1977) “Valeurs propres et vecteurs propres dans les dioides et leur interpretation en theorie des graphes.” (English summary), Bull. Direction Etudes Recherches Ser. C Math. Informat., no. 2, i, 25–41. MR 58 #5368.
Gondran, M . (1980) “Chemins et connexite.” [Paths and connectedness], Proc. Colloq., Cerisy, pp. 11–27, Presses Polytech. Romandes, Lausanne. MR 83b:05081.
Good, I.J. (1970) “Short proof of a conjecture by Dyson.” J. Mathematical Phys. 11, 1884. MR 41.1 3290.
Gordon, M . (1969) “Combinatorics and graph theory of abundance and stability of chemical species.” Proc. Colloq., Balatonfured, pp. 511–523. North-Holland, Amsterdam, 1970. MR 45.2 6657.
Gordon, V.S.; Safranskii, Ja. M. (1978) “Optimal ordering under serial-parallel precedence constraints.” (Russian. English summary), Dokl. Akad. Nauk BSSR 22, no. 3, 244–247, 286. MR 58 #15114.
Gorskov, A.F.; Kirpienikov, V.M. (1970) “An efficient algorithm for selecting paths of a graph.” (Russian), Izv. Vyss. Ucebn. Zaved. Elektromehanika, no. 8, 857–860. MR 44.1 116.
Gould, Ronald J. (1981) “On line graphs and the Hamiltonian index.” Discrete Math. 34, no. 2, 111–117. MR 82m:05067.
Goulden, I.P.; Jackson, D.M. (1981) “The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Lagrangian methods.” European J. Combin. 2, no. 2, 131–135. MR 82j: 05062.
Graham, R.L. (1968) “On finite 0-simple semigroups and graph theory.” Math. Systems Theory 2, 325–339. MR 39.1 1580.
Graham, R.L.; Harper, L.H. (1969) “Some results on matching in bipartite graphs.” SIAM J. Appl. Math. 17, 1017–1022. MR 42.1 1695.
Graham, R.L. (1970) “On subrees of directed graphs with no path of length exceeding one.” Canad. Math. Bull. 13, 329–332. MR 42.2 5859.
Graham, R.L. (1970) “A mathematical study of a model of magnetic domain interactions.” Bell System Tech. J. 49, 1627–1644. MR 47.2 8357.
Graham, R.L.; Spencer, J.H. (1971) “A constructive solution to a tournament problem.” Canad. Math. Bull. 14, 45–48. MR 45.1 1798.
Graham, R.L.; Rothschild, B.L. (1971) “A survey of finite Ramsey theorems.” Proc. Second Louisiana Conf. on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 21–40. MR 47.2 4805.
Graham, R.L.; Leeb, K.; Rothschild, B.L. (1972) “Ramsey’s theorem for a class of categories.” Proc. Nat. Acad. Sci. U.S.A. 69, 119–120. MR 46.2 5137a.
Graham, R.L.; Leeb, K.; Rothschild, B.L. (1972) “Ramsey’s theorem for a class of categories.” Advances in Math. 8, 417–433. MR 46.2 5137b.
Graham, R.L.; Knuth, D.E.; Motzkin, T.S. (1972) “Complements and transitive closures.” Discrete Math. 2, 17–29. MR 48.1 1933.
Graham, R.L.; Rothschild, B.L. (1978) “Ramsey theory.” Studies in combinatorics, pp. 80–99, MAA Studies in Math., 17, Math. Assoc. America, Washington, D.C. MR 80h:05039.
Grant, Douglas D . (1975) “How to run a hockey tournament-a combinatorial scheduling problem.” Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen), pp. 239–254. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976. MR 52.2 13471.
Grant, Douglas D. (1976) “Stability of line graphs.” J. Austral. Math. Soc. Ser. A 21, no. 4, 457–466. MR 55.1 5483.
Grant, Douglas D. (1980) “Antidirected Hamiltonian cycles in digraphs,” Ars Combin. 10, 205–209. MR 82b:05066.
Grant, Douglas D.; Jaeger, F.; Payan, C. (1982) “On digraphs without antidirected cycles.” J. Graph Theory 6, no. 2, 133–138. MR 83e:05066.
Gassman, Larry D.; Entringer, R.C.; Gilbert, John R.; Lonz, Stephen A.; Vucenic, Wayne (1975) “Geodetic orientations of complete k-partite graphs.” J. Combinatorial Theory Ser. B 19, no. 3, 214–238. MR 52.2 13470.
Graves, William (1971) “Algebraic machinery in combinatorics.” Mobius algebras (Proc. Conf., Univ. Waterloo, Waterloo, Ont.), pp. 176–186. MR 50.1 1906.
Green, C.D . [Green, Christopher D.] (1975) “The detection of mistakes in the comparability graph of a tree.” Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen), pp. 255–260. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976. MR54.1 5023.
Greene, Curtis (1971) “An inequality for the Mobius function of a geometric lattice.” Mobius algebras (Proc. Conf., Univ. Waterloo, Waterloo, Ont.), pp. 149–153. MR 50.1 1938.
Greene, Curtis (1973) “A multiple exchange property for bases.” Proc. Amer. Math. Soc. 39, 45–50. MR 47.1 56.
Greene, Curtis (1974) “Another exchange property for bases.” Proc. Amer. Math. Soc. 46, 155–156. MR 49.2 10580.
Greene, Curtis; Kleitman, Daniel J.; Magnanti, T.L. (1974) “Complementary trees and independent matchings.” Studies in Appl. Math. 53, 57–64. MR 49.2 888.
Greene, C . (1974) “Sperner families and partitions of a partially ordered set.” Combinatorics, Part 2: Graph theory; foundations, partitions and combinatorial geometry (Proc. Advanced Study Inst, on Combinatorics, Breukelen), pp. 91–106. Math. Centre Tracts, No. 56, Math. Centru, Amsterdam. MR 50.2 9606.
Greene, Curtis; Magnanti, Thomas L. (1975) “Some abstract pivot algorithms.” SIAM J. Appl. Math. 29, no. 3, 530–539. MR 51.2 12577.
Greene, Curtis (1976) “Some partitions associated with a partially ordered set.” J. Combinatorial Theory Ser. A 20, no. 1, 69–79. MR 53.1 2763.
Greene, Curtis; Kleitman, Daniel J. (1976) “Strong versions of Sperner’s theorem.” J. Combinatorial Theory Ser. A 20, no. 1, 80–88. MR 52.2 10439.
Greene, Curtis; Kleitman, Daniel J. (1976) “The structure of Sperner k-families.” J. Combinatorial Theory Ser. A 20, no. 1, 41–68. MR 53.1 2695.
Greene, Curtis (1975) “An inequality for the Mobius function of a geometric lattice.” Studies in Appl. Math. 54, no. 1, 71–74. MR 56.1 5334.
Greene, Curtis (1976) “Weight enumeration and the geometry of linear codes.” Studies in Appl. Math. 55, no. 2, 119–128. MR 56.1 5335.
Greene, Curtis (1976) “Some order-theoretic properties of the Robinson-Schensted correspondence.” Actes Table Ronde C.N.R.S., Univ. Louis-Pasteur Strasbourg, Strasbourg, pp. 114–120. Lecture Notes in Math., vol. 579, Springer, Berlin, 1977. MR 57.1 2930.
Greene, Curtis; Kleitman, Daniel J. (1978) “Proof techniques in the theory of finite sets.” Studies in combinatorics, pp. 22–79, MAA Studies in Math., 17, Math. Assoc. America, Washington, D.C. MR 80a:05006.
Greenman, J.V. (1976) “Graphs and determinants.” Math. Gaz. 69, no. 414, 241–246. MR 56.2 15669.
Greenwell, D.L.; Hemminger, R.L. (1968) “Reconstructing graphs.” The Many Facets of Graph Theory (Proc. Conf., Western Mich. Univ., Kalamazoo, Mich.), pp. 91–114. Springer, Berlin, 1969. MR 40.2 5479.
Greenwell, D.L. (1971) “Reconstructing graphs.” Proc. Amer. Math. Soc. 30, 431–433. MR 44.2 3908.
Greenwell, D.L.; Hemminger, R.L.; Klerlein, J. (1973) “Forbidden subgraphs.” Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 389–394. Utilitas Math., Winnipeg, Man. MR 50.1 6924.
Greenwell, D.; Lovasz, L. (1974) “Applications of product colouring.” Acta Math. Acad. Sci. Hungar. 25, 335–340. MR 50.2 9667.
Greenwell, Don (1976) “Odd cycles and perfect graphs.” Proc. Internat. Conf., Western Mich. Univ., Kalamazoo, Mich., pp. 191–193, Lecture Notes in Math., 642, Springer, Berlin, 1978. MR 80d:05044.
Greenwell, D.L.; Hemminger, R.L. (1977) “Line graphs, total graphs and forbidden subgraphs.” Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 345–353, Congress. Numer., XIX, Utilitas Math., Winnipeg, Man. MR 811:05115.
Griggs, Jerrold R. (1977) “Sufficient conditions for a symmetric chain order.” SIAM J. Appl. Math. 32, no. 4, 807–809. MR 56.1 146.
Griggs, J.R. (1979) “Extremal values of the interval number of a graph, II.” Discrete Math., 28, 37–47.
Griggs, J.R.; West, D.B. (1980) “Extremal values of the interval number of a graph.” SIAM J. Algebraic and Discrete Methods, 1, 1–7.
Griggs, Jerrold R. (1980) “On chains and Sperner k-families in ranked posets.” J. Combin. Theory Ser. A 28, no. 2, 156–168. MR 81e:05006.
Grigor’ev, E.G . (1974) “A certain modification of Ford’s algorithm.” (Russian), Trudy Moskov. Orden. Lenin. Energet. Inst. Vyp. 178, 94–96. MR 50.2 12804.
Grinberg, E. Ja. [Grinbergs, E.]; Dambit, Ja. Ja. [Dambitis, J.] (1966) “Certain properties of graphs containing cycles.” (Russian. Latvian and English summaries), Latvian Math. Yearbook, 2 (Russian), pp. 65–70. Izdat. “Zinatne”, Riga. MR 34.2 7401.
Grinstead, Charles (1981) “The strong perfect graph conjecture for toroidal graphs.” J. Combin. Theory Ser. B 30, no. 1, 70–74. MR 82d:05087.
Grinstead, Charles M. (1980) “Perfect graphs with nonnegative Euler characteristic.” Ars Combin. 9, 275–281. MR 83c:05050.
Gronau, H.-D.O.F . (1978/79) “On Sperner families in which no 3 sets have an empty intersection.” Acta Cybernet. 4, no. 2, 213–220. MR 80d:05003.
Gronau, H.-D.O.F . (1978/79) “Recognition of monotone functions.” Acta Cybernet. 4, no. 3, 279–281. MR 81g:05007.
Gronau, Hans-Dietrich O.F . (1979) “Extremal families of subsets of a finite set.” Proc. Conf. Algebraic, Arith. and Categorical Methods in Comput. Theory, Berlin/Wendisch-Rietz, pp. 153–159, Math. Research, 2, Akademie-Verlag, Berlin. MR 8le:05003.
Gronau, Hans-Dietrich O.F. (1980) “On Sperner families in which no k sets have an empty intersection.” J. Combin. Theory Ser. A 28, no. 1, 54–63. MR 81g:05003.
Gronau, Hans-Dietrich O.F. (1981) “On Sperner families in which no k sets have an empty intersection. II.” J. Combin. Theory Ser. A 30, no. 3, 298–316. MR 83e:05007.
Gronau, H.-D.O.F. (1982) “On Sperner families in which no k sets have an empty intersection. III.” Combinatorica 2, no. 1, 25–36. MR 83m:05005.
Gronau, H.-D.O.F.; Proske, Chr. (1982) “Maximal families of restricted subsets of a finite set.” Acta Cybernet. 5, no. 4, 441–451. MR 83m:05013.
Groppen, V.O. (1977) “Extremal problems of graphs with a minimax goal functional.” Avtomat. i Telmeh., no. 6, 97-102 (Russian. English summary); translated as Automat. Remote Control 38, no. 6, part 1, 855–859. MR 56.2 11851.
Gross, Jonathan L.; Alpert, Seth R. (1974) “The topological theory of current graphs.” J. Combinatorial Theory Ser. B 17, 218–233. MR 51.1 226.
Gross, Jonathan L. (1974) “Voltage graphs.” Discrete Math. 9, 239–246. MR 50.1 153.
Gross, Jonathan L.; Lomonanco, Samuel J., Jr. (1980) “A determination of the toroidal K-metacyclic groups.” J. Graph Theory 4, no. 2, 165–172. MR 81k:05059.
Gross, Jonathan L.; Harary, Frank (1980) “Some problems in topological graph theory.” J. Graph Theory 4, no. 3, 253–263. MR 81j:05055.
Gross, Kenneth B. (1974) “A multiplication theorem for strong starters.” Aequationes Math. 11, 169–173. MR 50.1 7382.
Grotschel, Martin; Thomassen, Carsten; Wakabayashi, Yoshiko (1980) “Hypotraceable digraphs.” J. Graph Theory 4, no. 4, 377–381. MR 83c:05065.
Grotschel, M.; Wakabayashi, Y. (1978) “Hypo-Hamiltonian digraphs.” IX. Oberwolfach Conference on Operations Research (Oberwolfach), pp. 99–119 Operations Res. Verfahren, 36, Anthenaum/Hain/Scriptor/Hanstein, Konigstein/Ts., 1980. MR 83g:05047.
Grotschel, Martin; Harary, Frank (1979) “The graphs for which all strong orientations are Hamiltonian.” J. Graph Theory 3, no. 3, 221–223. MR 81a:05086.
Grotschel, Martin (1979) “On minimal strong blocks.” J. Graph Theory 3, no. 3, 213–219. MR 81a:05055.
Grotschel, Martin (1978) “Strong blocks and the optimum branching problem.” Numerische Metlioden bei graphentheoretischen und kombinatorischen Problemen, Band 2 (Tagung, Math. Forschungsint., Oberwolfach), pp. 112–121, Internat. Ser. Numer. Math., 46, Birkhauser, Basel, 1979. MR 81m:05073.
Grunbaum, Branko (1970) “Polytopes, graphs, and complexes.” Bull. Amer. Math. Soc. 76, 1131–1201. MR 42.1 959.
Grunbaum, Branko (1971) “Antidirected Hamiltonian paths in tournaments.” J. Combinatorial Theory Ser. B 11, 249–257. MR 45.1 116.
Grunbaum, B. (1974) “Matchings in polytopal graphs.” Networks 4, 175–190. MR 49. 1 4852.
Grunbaum, Branko (1975) “Polytopal graphs.” Studies in graph theory, Part II, pp. 201–224. Studies in Math., Vol. 12, Math. Assoc. Amer., Washington, D.C. MR 53.2 10654.
Grunbaum, Branko (1975) “Venn diagrams and independent families of sets.” Math. Mag. 48, 12–23. MR 51.2 12578.
Grundspen’kis, Ja. A . (1972) “An algorithm for finding proper directed cycles of a strongly connected graph.” (Russian), Cybernetics and diagnostics, No. 5, pp. 85–92. Izdat. “Zinatne”, Riga. MR 50.1 1957.
Grundspen’kis, Ja. A . (1972) “A preliminary simplification of a directed graph containing cycles.” (Russian), Cybernetics and diagnostics, No. 5, pp. 71–77. Izdat. “Zinatne”, Riga. MR 50.1 1958.
Grunskii, I.S.; Speranskii, D.V. (1973) “The length of a round of a graph.” (Russian. English summary insert), Kibernetika (Kiev), no. 6, 34–37. MR 51.1 263.
Grunskii, I.S.; Speranskii, D.V. (1974) “The covering of a graph by a set of paths that emanate from a single vertex.” (Russian. English summary insert), Kibernetika (Kiev), no. 1, 29–34. MR 51.1 5373.
Grzegorek, E. (1977) “A solution of a problem of B. Rotman.” Colloq. Math. 38, no. 1, 37–38. MR 57.1 128
Guan, Mei Gu (1978) “A method for finding the minimum arborescence of the directed graphs arising in the channel design problem.” (Chinese), Acta Math. Appl. Sinica 1, no. 3, 233–239. MR 80j:05069.
Guidotti, Laura (1972) “Un nuova carattere ed alcune nuove proprieta dei T-graf e di loro generalizzazioni.” (English summary), Boll. Un. Mat. Ital. (4) 5, 87–97. MR 47.2 6535.
Guljaev, V.A.; Gluhov, A.D. (1980) “Solution of a graph theory problem arising in the organization of diagnostic systems.” (Russian. English summary), Elektronnoe Modelirovanie, no. 2, 86–87, 112. MR 82b:05067.
Guo, Mai (1973) “Some lemmas in the arithmetical theory of graphs.” Nanta Math. 6, no. 2, 90–99. MR 52.2 13502.
Gupta, Hansraj (1968) “Number of topologies on a finite set.” Res. Bull. Panjab Univ. (N.S.) 19, 231–241. MR 42.1 3733.
Gupta, Ram Prakash (1965) “A contribution to the theory of finite oriented graphs.” Sankhya Ser. A 27, 401–404. MR 34.1 1224.
Gupta, Ram Prakash (1967) “On basis digraphs.” J. Combinatorial Theory 3, 16–24. MR 35.2 4127.
Gupta, Ram Prakash (1978) “An edge-coloration theorem for bipartite graphs with applications.” Discrete Math. 23, no. 3, 229–233. MR 80d:05023.
Gutman, Ivan (1977) “Generalizations of a recurrence relation for the characteristic polynomials of trees.” Publ. Inst. Math. (Beograd) (N.S.) 21 (35), 75–80. MR 58 #5342.
Gutman, I . (1976) “Partial ordering of forests according to their characteristic polynomials.” Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely), Vol. I, pp. 429–436, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 80i:05074.
Gutman, Ivan (1980) “Graphs with greatest number of matchings.” Publ. Inst. Math. (Beograd) (N.S.) 27 (41), 67–76. MR 83a:05110.
Gutnikov, E.V . (1973) “Contours and coboundaries in ultragraphs.” (Russian), Prikl. Mat. i Programmirovanie Vyp. 9, 65–78, 145. MR 48.1 3810.
Gyarfas, A.; Lehel, J. (1969) “A Helly-type problem in trees.” Proc. Colloq., Balatonfured, pp. 571–584. North-Holland, Amsterdam, 1970. MR 45.2 7602.
Gyarfas, A.; Lehel, J. (1973) “A Ramsey-type problem in directed and bipartite graphs.” Period. Math. Hungar. 3, no. 3–4, 299–304. MR 49.1 136.
Gyarfas, A. (1975) “Blocking the loops of a flow-graph.” Vortrage der Wissenschaftlichen Jahrestagung der Gesellschaft fur Angewandte Mathematik und Mechanik (Gottingen). Z. Angew. Math. Mech. 56 (1976), no. 3, T330–T331. MR 56.2 11843.
Gyori, E.; Milner, E.C. (1978) “A theorem of the transversal theory for matroids of finite character.” Discrete Math. 23, no. 3, 235–240. MR 80b:05019.
Gyori, E . (1978) “Strongly connected digraphs with few cycles.” Algebraic methods in graph theory, Vol. I, II (Szeged), pp. 251–265, Colloq. Math. Soc. Jartos Bolyai, 25, North-Holland, Amsterdam, 1981. MR 83c:05066.
Gysin, R. (1977) “Dimension transitiv orientierbarer Graphen.” Acta Math. Acad. Sci. Hungar. 29, no. 3-4, 313–316. MR 58 #5393.
Haas, Robert (1971) “An application of Boolean algebra to finite topology.” Pi Mu Epsilon J. 5, 167–170. MR 44.1 973.
Habib, Michel; Lambert, Gerard (1974) “Nombre de sauts et indice de partition dans les graphes sans circuit.” Colloque sur la Theorie des Graphes (Paris). Cahiers Centre Etudes Recherche Oper. 17 (1975), no. 2–3–4, 197–211. MR 53.2 7847.
Habib, M.; Lambert, G. (1975) “Some results about the minimal cardinal (p(G)) of a path set in a graph G = (X,U) carrying out a partition of X, and the number of jumps (S(G)) in acircuit graphs.” Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 367–384. Congressus Numerantium, No. XIV, Utilitas Math., Winnipeg, Man. MR 52.2 13472.
Habib, M.; Maurer, M.C. (1979) “On the x-join decomposition for undirected graphs.” Discrete Applied Math., 3, 198–207.
Hadlock, F. (1975) “Finding a maximum cut of a planar graph in polynomial time.” SIAM J. Comput. 4, no. 3, 221–225. MR 52.1 196.
Hadlock, F.; Hoffman, F. (1978) “Manhattan trees.” Utilitas Math. 13, 55–67. MR 57.1 5821.
Haff, C.E.; Murty, U.S.R.; Wilton, R.C. (1970) “A note on undirected graphs realizable as p.o. sets.” Canad. Math. Bull. 13, 371–374. MR 42.2 4444.
Hager, Michael (1982) “On primitive sets in graphs.” European J. Combin. 3, no. 1, 29–34. MR 83f:05067.
Hahn, Gena (1980) “The automorphism group of the wreath product of directed graphs.” European J. Combin. 1, no. 3, 235–241. MR 83c:05067.
Hajnal, A.; Rothschild, Bruce (1973) “A generalization of the Erdos-Ko-Rado theorem on finite set systems.” J. Combinatorial Theory Ser. A 15, 359–362. MR 48.1 3745.
Hajnal, A.; Rado, R.; Sos, Vera T. (Editors) (1973) “Infinite and finite sets. Vols. I, II, III.” Proceedings of a Colloquium held at Keszthely, June 25–July 1, 1973. Colloquia Mathematica Societatis Janos Bolyai, Vol. 10. North-Holland Publishing Co., Amsterdam-London; Janos Bolyai Mathematical Society, Budapest, 1975. Vol. I; 604 pp.
Hajnal, Andras; Mate, Attila (1973) “Set mappings, partitions, and chromatic numbers.” Logic Colloquium ’73 (Bristol), pp. 347–379. Studies in Logic and the Foundations of Mathematics, Vol. 80, North-Holland, Amsterdam, 1975. MR 54.2 12528.
Hajnal, A.; Sos, Vera T. (Editors) (1976) “Combinatorics. Vol. I.” Proceedings of the 5th Hungarian Colloquium held at Keszthely, June 28–July 3, 1976. Colloquia Mathematica Societatis Janos Bolyai, 18. North-Holland Publishing Co., Amsterdam-Oxford-New York, 1978. 606 pp. MR 80a:05002a.
Hajnal, A.; Sos, Vera T. (Editors) (1976) “Combinatorics. Vol. II.” Proceedings of the 5th Hungarian Colloquium held at Keszthely, June 28–July 3, 1976. Colloquia Mathematica Societatis Janos Bolyai, 18. North-Holland Publishing Co., Amsterdam-Oxford-New York, 1978. pp. 607–1220. MR 80a:05002b.
Hakimi, S.L. (1965) “On the degrees of the vertices of a directed graph.” J. Franklin Inst. 279, 290–308. MR 31.2 4736.
Hale, W.K. (1980) “Frequency assignments: Theory and applications.” Proc. IEEE, 68, 1497–1514.
Halin, Rudolf (1967) “Zum Mengerschen Graphensatz.” Beitrage zur Graphentheorie (Kolloquium, Manebach), pp. 41–48. Teubner, Leipzig, MR 39.2 6787.
Halin, Rudolf (1976) “S-functions for graphs.” J. Geometry 8, no. 1–2, 171–186. MR 56.1 2873.
Halin, R. (1980) “A note on infinite triangulated graphs.” Discrete Math. 31, no. 3, 325–326. MR 81h:05111.
Hall, Marshall, Jr. (1964) “Numerical analysis of finite geometries.” Proc. IBM Sci. Comput. Sympos. Combinatorial Problems (Yorktown Heights, N.Y.), pp. 11–22. IBM Data Process. Division, White Plains, N.Y., 1966. MR 36.2 5812.
Hall, M., Jr.; van Lint, J.H. (Editors) (1974) “Combinatorics.” Part 2: Graph theory; foundations, partitions and combinatorial geometry. Proceedings of the Advanced Study Institute on Combinatorics held at Nijenrode Castle, Breukelen, July 8–20, 1974. Mathematical Centre Tracts, No. 56. Mathematisch Centrum, Amsterdam, i+118 pp. MR 49.2 8867.
Hall, Marshall, Jr. (1975) “Semi-automorphisms of Hadamard matrices.” Math. Proc. Cambridge Philos. Soc. 77, 459–473. MR 51.1 684.
Hall, R.R.; Jackson, T.H.; Sudbery, A.; Wild, K. (1975) “Some advances in the no-three-in-line problem.” J. Combinatorial Theory Ser. A 18, 336–341. MR 51.1 3063.
Halmos, Paul R . (1968) “Naive Mengenlehre.” Vandenhoeck & Ruprecht, Gottingen. 132 pp. MR 36.2 6292.
Halpern, Jonathan (1975) “Set adjacency measures in fuzzy graphs.” J. Cybernet. 5, no. 4, 77–87 (1976). MR 56.1 2861.
Hamada, Takashi; Yoshimura, Izumi (1976) “Traversability and connectivity of the middle graph of a graph.” Discrete Math. 14, no. 3, 247–255. MR 54.1 2537.
Hamada, Takashi; Kitamura, Tai-ichi [Kitamura, Taiiti]; Yoshimura, Izumi (1975) “On the connectivities of the generalized line, middle and total graph.” Bull. Fac. Sci. Ibaraki Univ. Ser. A No. 7, 47–54. MR 52.1 159.
Hamelink, Ronald C. (1968) “Graph theory and Lie algebra.” Proc. Conf., Western Mich. Univ., Kalamazoo, Mich., pp. 149–153. Springer, Berlin, MR 41.1 1565.
Hamidoune, Yahya Ould (1977) “Sur les atomes d’un graphe oriente.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 284, no. 20, A1253–A1256. MR 56.1 2862.
Hamidoune, Yahya Ould (1979) “Sur les parcours hamiltoniens dans les graphes orientes.” (English summary), Discrete Math. 26, no. 3, 227–234. MR 80h:05034.
Hamidoune, Yahya Ould (1980) “On the decomposition of a minimally strongly h-connected digraph into h+1 acircuitic subgraphs.” Discrete Math. 31, no. 1, 89–90. MR 81j:05063.
Hamidoune, Yahya Ould (1980) “A property of a-fragments of a digraph.” Discrete Math. 31, no. 1, 105–106. MR 81j:05063.
Hamidoune, Yahya Ould (1979) “Sur les parcours hamiltoniens dans les graphes orientes.” (English summary), Discrete Math. 26, no. 3, 227–234. MR 80h:05034.
Hamidoune, Yahya Ould (1981) “On multiply critically h-connected graphs.” J. Combin. Theory Ser. B 30, no. 1, 108–112. MR 82g:05060.
Hamidoune, Yahya Ould (1979) “Connectivity of transitive digraphs and a combinatorial property of finite groups.” Combinatorics 79 (Proc. Colloq., Univ. Montreal, Montreal, Que.), Part I. Ann. Discrete Math. 8 (1980), 61–64. MR 83c:05084.
Hammer, P.L.; Ibaraki, T.; Peled, U. (1979) “Threshold numbers and threshold completions.” Combinatorics 79 (Proc. Colloq., Univ. Montreal, Montreal, Que.), Part II. Ann. Discrete Math. 9 (1980), 103–106. MR 81k:05092.
Hammer, P.L.; Ibaraki, T.; Simeone, B. (1981) “Threshold sequences.” SIAM J. Algebraic Discrete Methods 2, no. 1, 39–49. MR 83f:05057.
Hammond, Peter (1981) “q-coverings, codes, and line graphs.” J. Combin. Theory Ser. B 30, no. 1, 32–35. MR 82i:05059.
Hanak, Jan (1974) “Equilibrium points of some games on oriented graphs.” Proc. Second Czechoslovak Sympos., Prague, pp. 239–240. Academia, Prague, 1975. MR 52.2 16687.
Handa, B.R.; Mohanty, S.G. (1976) “Higher dimensional lattice paths with diagonal steps.” Discrete Math. 15, no. 2, 137–140. MR 53.1 2699.
Hanlon, Phil (1981) “A cycle index sum inversion theorem.” J. Combin. Theory Ser. A 30, no. 3, 248–269. MR 82g:05051.
Hanlon, Phil (1981) “Algebras of acyclic type.” Canad. J. Math. 33, no. 1, 129–141. MR 83a:05017.
Hanlon, Phil (1982) “Counting interval graphs.” Trans. Amer. Math. Soc. 272, no. 2, 383–426. MR 83h:05050.
Hansell, Roger W. (1971) “General embedding properties of absolute Borel and Souslin spaces.” Proc. Amer. Math. Soc. 27, 343–352. MR 42.1 3750.
Hansen, John C. (1975) “Some applications of a general theory of digraph measures.” Proceedings of the 1975 International Symposium on Multiple-Valued Logic (Indiana Univ., Bloomington, Ind.), pp. 262–276. IEEE Comput. Soc., Long Beach, Calif.
Hansen, P. [Hansen, Pierre]; de Werra, D. (Editors) (1980) “Regards sur la theorie des graphes.” (French) [A look at graph theory], Proceedings of a Colloquium held at Cerisy, June 12–18, 1980. Presses Polytechniques Romandes, Lausanne, xi+316 pp. MR 82d:05054.
Hansen, Rodney T. (1969) “Complementing pairs of subsets of the plane.” Duke Math. J. 36, 441–449. MR 39.2 5719.
Harary, Frank (1959) “The number of functional digraphs.” Math. Ann. 138, 203–210. MR 22.1 18.
Harary, Frank (1959/60) “A graph theoretic method for the complete reduction of a matrix with a view toward finding its eigenvalues.” J. Math. Phys. 38, 104–111. MR 22.1 678.
Harary, Frank (1960) “On the consistency of precedence matrices.” J. Assoc. Comput. Mach. 7, 255–259. MR 24.A A1844.
Harary, Frank (1962) “The determinant of the adjacency matrix of a graph.” SIAM Rev. 4, 202–210. MR 26.1 1876.
Harary, Frank (1962) “A graph theoretic approach to matrix inversion by partitioning.” Numer. Math. 4, 128–135. MR 25.2 2977.
Harary, Frank; Nash-Williams, C. St. J. A. (1965) “On Eulerian and hamiltonian graphs and line graphs.” Canad. Math. Bull. 8, 701–709. MR 33.1 66.
Harary, Frank; Palmer, Ed (1965) “The number of graphs rooted at an oriented line.” ICC Bull. 4, 91–98. MR 33.1 71.
Harary, Frank; Palmer, Ed (1966) “Enumeration of locally restricted digraphs.” Canad. J. Math. 18, 853–860. MR 34.1 2498.
Harary, F.; Palmer, E.M. (1966) “Enumeration of self-converse digraphs.” Mathematika 13, 151–157. MR 34.1 2499.
Harary, F.; Palmer, E. (1966) “On the number of orientations of a given graph.” (Russian summary), Bull. Acad. Polon. Sci. Ser. Sci. Math. Astronom. Phys. 14, 125–128. MR 33.1 2562.
Harary, Frank; Trauth, Charles A., Jr. (1966) “Connectedness of products of two directed graphs.” SIAM J. Appl. Math. 14, 250–254. MR 36.2 5027.
Harary, Frank; Moser, Leo (1966) “The theory of round robin tournaments.” Amer. Math. Monthly 73, 231–246. MR 33.2 5512.
Harary, Frank; Palmer, Ed (1966) “Enumeration of mixed graphs.” Proc. Amer. Math. Soc. 17, 682–687. MR 33.1 72.
Harary, Frank (1967) “Graphical reconstruction.” A Seminar on Graph Theory, pp. 18–20. Holt, Rinehart and Winston, New York. MR 35.2 6582.
Harary, Frank; Palmer, Ed (1967) “On the problem of reconstructing a tournament from sub-tournaments.” Monatsh. Math. 71, 14–23. MR 35.1 86.
Harary, Frank (1967) “Enumeration of graphs and digraphs.” A Seminar on Graph Theory, pp. 34–41. Holt, Rinehart and Winston, New York. MR 36.1 1360.
Harary, Frank (1967) “Topological concepts in graph theory.” A Seminar on Graph Theory, pp. 13–17. Holt, Rinehart and Winston, New York. MR 35.2 5356.
Harary, Frank; Palmer, Edgar; Smith, Cedric (1967) “Which graphs have only self-converse orientations?” Canad. Math. Bull. 10, 425–429. MR 35.1 2791.
Harary, Frank (1969) “Graph theory.” Addison-Wesley Publishing co., Reading, Mass.-Menlo Park, Calif.-London, ix+274 pp. MR 41.1 1566.
Harary, Frank (1971) “Demiarcs: an atomistic approach to relational systems and group dynamics.” J. Mathematical Sociology 1, 195–205. MR 51.1 7955.
Harary, Frank; King, Clarence; Mowshowitz, Abbe; Read, Ronald C. (1971) “Cospectral graphs and digraphs.” Bull. London Math. Soc. 3, 321–328. MR 45.1 3249.
Harary, Frank; Manvel, Bennet (1971) “On the number of cycles in a graph.” Mat. Casopis Sloven. Akad. Vied 21, 55–63. MR 45.1 3249.
Harary, F.; Piff, M.J.; Welsh, D.J.A. (1972) “On the automorphism group of a matroid.” Discrete Math. 2, 163–171. MR 45.2 6693.
Harary, Frank (1972) “Recent results on generalized Ramsey theory for graphs.” Proc. Conf., Western Michigan Univ., Kalamazoo, Mich., pp. 125–138. Lecture Notes in Math., Vol. 303, Springer, Berlin. MR 49.2 7177.
Harary, Frank (1971) “On the history of the theory of graphs.” Proc. Third Ann Arbor Conf. on Graph Theory, Univ. of Michigan, Ann Arbor, Mich., pp. 1–17. Academic Press, New York, 1973. MR 50.2 9704.
Harary, Frank; Palmer, Edgar M. (1973) “Graphical enumeration.” Academic Press, New York-London, xiv+271 pp. MR 50.2 9682.
Harary, Frank (1973) “A survey of the reconstruction conjecture.” Proc. Capital Conf. on Graph Theory and Combinatorics, George Washington Univ., Washington, D.C., pp. 18–28. Lecture Notes in Math., Vol. 406, Springer, Berlin, 1974. MR 50.2 12818.
Harary, Frank; Schwenk, Allen J. (1974) “The communication problem on graphs and digraphs.” J. Franklin Inst. 297, 491–495. MR 50.1 1980.
Harary, Frank (1975) “On minimal feedback vertex sets of a digraph.” IEEE Trans. Circuits and Systems CAS-22, no. 10, 839–840. MR 52.2 10482.
Harary, Frank; Melter, Robert A. (1977) “Addendum to: “On the metric dimension of a graph”(Ars Combinatoria 2 (1976), 191–195).” Ars Combinatoria 4, 318. MR 57.1 5834.
Harary, Frank; Mowshowitz, Abbe; Schwenk, Allen (1977) “Line minimal Boolean forests.” Colloq. Math. 37, no. 1, 167–173. MR 57.1 5814.
Harary, Frank; Wallis, W.D.; Heinrich, Katherine (1977) “Decompositions of complete symmetric digraphs into the four oriented quadrilaterals.” Proc. Internat. Conf. Combinatorial Theory, Australian Nat. Univ., Canberra, pp. 165–173, Lecture Notes in Math., 686, Springer, Berlin, 1978. MR 82b:05068.
Harary, F.; Schwenk, A.J. (1978) “Generalized Ramsey theory for graphs. VII. Ramsey numbers for multigraphs and networks.” Networks 8, no. 3, 209–216. MR 80a:05149.
Harary, Frank; Robinson, Robert W.; Wormald, Nicholas C. (1978) “Isomorphic factorisations. V. Directed graphs.” Mathematika 25, no. 2, 279–285. MR 80m:05050.
Harary, Frank; Kommel, Helene J. (1978/79) “Matrix measures for transitivity and balance.” J. Math. Sociol. 6, no. 2, 199–210. MR 81a:05056.
Harary, Frank; Palmer, Edgar M. (1979) “The probability that a point of a tree is fixed.” Math. Proc. Cambridge Philos. Soc. 85, no. 3, 407–415. MR 80f:05020.
Harary, Frank (Editor) (1977) “Topics in graph theory.” Meeting held in New York, May 2–6, 1977. Annals of the New York Academy of Sciences, 328. New York Academy of Sciences, New York, 1979. ix+208 pp. MR 80j:05056.
Harary, Frank; Kabell, Jerald A. (1980) “An intuitive approach to interval numbers of graphs.” Math. Mag. 53, no. 1, 39–44. MR 81b:05092.
Harary, Frank (1979) “Some theorems about graphs from social sciences.” Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Areata, Calif.), pp. 41–47, Congress. Numer., XXVI, Utilitas Math., Winnipeg, Man., 1980. MR 81m:05118.
Harazisvili, A.B . (1974) “Realization of colored graphs in Hilbert space.” (Russian. Georgian and English summaries), Sakharth. SSR Mecn. Akad. Moambe 76, 53–56. MR 53.1 209.
Hardouin Duparc, J . (1975) “Quelques resultats sur “l’indice de transitivite” de certains tournois.” (English summary), Math. Sci. Humaines No. 51, 35–41, 87. MR 53.1 188.
Harner, C.C.; Entringer, R.C. (1972) “Arc colorings of digraphs.” J. Combinatorial Theory Ser. B 13, 219–225. MR 47.1 1656.
Harper, L.H. (1974) “The morphology of partially ordered sets.” J. Combinatorial Theory Ser. A 17, 44–58. MR 51.1 3008.
Harper, L.H. (1980) “A Sperner theorem for the interval order of a projective geometry.” J. Combin. Theory Ser. A 28, no. 1, 82–88. MR 81a:05028.
Harper, L.H. (1980) “The global theory of flows in networks.” Adv. in Appl. Math. 1, no. 2, 158–181. MR82j:05063.
Harris, Bernard; Schoenfeld, Lowell (1969) “A composition theorem for the enumeration of certain subsets of the symmetric semigroup.” Proc. Advanced Sem., Math. Research Center, Univ. of Wisconsin, Madison, Wis., pp. 215–254. Academic Press, New York, 1970. MR 42.1 2947.
Harris, B. [Harris, Bernard]; Schoenfeld, L. (1969) “A composition theorem for the enumeration of certain subsets of symmetric semigroups and the corresponding sets of labeled functional digraphs.” Proc. Colloq., Balatonfured, pp. 637–650. North-Holland, Amsterdam, 1970. MR 45.2 6699.
Harris, Bernard (Editor) (1969) “Graph theory and its applications.” Proceedings of an Advanced Seminar Conducted by the Mathematics Research Center, United States Army, at the University of Wisconsin, Madison, October 13–15, 1969. Publication No. 24 of the Mathematics Research Center, United States Army, the University of Wisconsin. Academic Press, New York-London, 1970. viii+262 pp. MR 41.2 8283.
Harrison, Michael A. (1966) “The number of isomorphism types of finite algebras.” Proc. Amer. Math. Soc. 17, 731–737. MR 34.1 118.
Harrison, Michael A. (1966) “Note on the number of finite algebras.” J. Combinatorial Theory 1, 395–397. MR 34.1 119.
Hartfiel, D.J.; Maxson, C.J. (1975) “The chainable matrix, a special combinatorial matrix.” Discrete Math. 12, 245–256. MR 42.1 139.
Hartfiel, D.J.; Maxson, C.J. (1975) “A study of minimally unilateral digraphs.” SIAM J. Appl. Math. 28, 607–610. MR 42.1 139.
Hartman, Jehuda (1979) “Bounds on the coarseness of the n-cube.” Canad. Math. Bull. 22, no. 2, 171–175. MR 82b:05073.
Hartnell, B.L . (1974) “Decomposition of Kxy *, x and y odd, into 2x-circuits.” Proceedings of the Fourth Manitoba Conference on Numerical Mathematics (Winnipeg, Man.), pp. 265–271. Congr. Numer., No. XII, Utilitas Math., Winnipeg, Man., 1975. MR 52.1 185.
Hartnell, B.; Milgram, M. (1974) “Decomposition of Kp *, for p a prime, into k-circuits.” Colloque sur la Theorie des Graphes (Paris). Cahiers Centre Etudes Recherche Oper. 17 (1975), no. 2–3–4, 221–223. MR 54.1 138.
Hartnell, B.L . (1975) “On unicyclic graphs having two disjoint maximal matchings.” Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 405–413. Congressus Numerantium, No. XIV, Utilitas Math., Winnipeg, Man. MR 52.2 13505.
Haskins, L.; Gudder, S. (1972) “Height on posets and graphs.” Discrete Math. 2, no. 4, 357–382. MR 46.2 5186.
Haskins, Loren; Rose, Donald J. (1973) “Toward characterization of perfect elimination digraphs.” SIAM J. Comput. 2, 217–224. MR 49.2 8895.
Hasse, Maria (1964/65) “Zur algebraischen Begrundung der Graphentheorie I.” Math. Nachr. 28, 275–290. MR 31.2 3356.
Hasse, Maria (1965) “Zur algebraischen Begrundung der Graphentheorie.” Math. Nachr. 30, 155–164. MR 33.2 5513.
Hasse, Maria; Reichel, Horst (1966) “Zur algebraischen Begrundung der Graphentheorie. III.” Math. Machr. 31, 335–345. MR 35.1 1498.
Hasse, Maria; Michler, Lothar (1969) “Uber die Faktoralgebren der freien Kategorien uber Grundgraphen.” Math. Nachr. 40, 125–130. MR 41.2 8320.
Havel, Ivan (1965) “On the completeness-number of a finite graph.” (Czech and Russian summaries), Casopis Pest. Mat. 90, 191–193. MR 33.1 67.
Havel, Vaclav (1967) “Coordinatization of parallel systems. II.” Comment. Math. Univ. Carolinae 8, 199–208. MR 36.1 771.
Heap, B.R.; Lynn, M.S. (1964) “A graph-theoretic algorithm for the solution of a linear Diophantine problem of Frobenius.” Numer. Math. 6, 346–354. MR 30.2 4689.
Heap, B.R. (1966) “Random matrices and graphs.” Numer. Math. 8, 114–122. MR 33.1 2565.
Heap, B.R. (1972) “The production of graphs by computer.” Graph theory and Computing, pp. 47–62. Academic Press, New York. MR 52.2 13506.
Hechler, Stephen H. (1972) “Directed graphs over topological spaces: Some set theoretical aspects.” Israel J. Math. 11, 231–248. MR 45.2 6662.
Hechler, S.H.; Kainen, P.C. (1974) “On the immersion of digraphs in cubes.” Israel J. Math. 18, 221–233. MR 50.2 12790.
Hecht, M.S.; Ullman, J.D. (1974) “Characterizations of reducible flow graphs.” J. Assoc. Comput. Mach. 21, 367–375. MR 56.2 11844.
Hedrlin, Z.; Mendelsohn, E. (1969) “The category of graphs with a given subgraph—with applications to topology and algebra.” Canad. J. Math. 21, 1506–1517. MR 41.2 5232.
Hedetniemi, S . (1971) “Characterizations and constructions of minimally connected graphs and minimally strong digraphs.” Proc. Second Louisiana Conf. on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 257–282. MR 47.2 8300.
Hegde, Malati; Sridharan, M.R. (1980) “Enumeration of labelled digraphs and hypergraphs.” Combinatorics and graph theory (Calcutta), pp. 276–283, Lecture Notes in Math., 885, Springer, Berlin, 1981. MR 83f:05029.
Heilmann, Ole J.; Kleitman, Daniel J.; Lieb, Elliott H.; Sherman, Seymour (1971/72) “Some positive definite functions on sets and their application to the Ising model.” Discrete Math. 1, no. 1, 19–27. MR 46.2 10342.
Heinrich, Peter (1979) “Eine Beziehung zwischen den Weg-Kreis-Systemen in einem gerichteten Graphen und den Unterdeterminanten seiner charakteristischen Matrix.” Math. Nachr. 93, 7–20. MR 81h:05100.
Heise, Ulrich; Heise, Werner; Kroll, Hans-Joachim (1971) “Uber die Existenz endlicher Mobius-m-Strukturen.” (Italian and English summaries), Rend. 1st. Mat. Univ. Trieste 3, 135–139 (1972). MR 50.1 8293.
Hell, Pavol; Nesetril, Jaroslav (1973) “Groups and monoids of regular graphs (and of graphs with bounded degrees).” Canad. J. Math. 25, 239–251. MR 49.1 123.
Hell, Pavol (1973) “Absolute retracts in graphs.” Proc. Capital conf. on Graph Theory and Combinatorics, George Washington Univ., Washington, D.C., pp. 291–301. Lecture Notes in Math., Vol. 406, Springer, Berlin, 1974. MR 53.1 5350.
Hell, Pavol (1974) “Absolute planar retracts and the four color conjecture.” J. Combinatorial Theory Ser. B 17, 5–10. MR 51.2 10149.
Hell. P . (1973) “Subdirect products of bipartite graphs.” Colloq. Keszthely, Vol. II, pp. 857–866. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR 51.1 7956.
Hell, P.; Nesetril, J. (1978) “Homomorphisms of graphs and of their orientations.” Monatsh. Math. 85, no. 1, 39–48. MR 80a:05110.
Hell, Pavol; Nesetril, Jaroslav (1979) “Cohomomorphisms of graphs and hypergraphs.” Math. Machr. 87, 53–61. MR 81b:05093.
Hell, P.; Kirkpatrick, D.G. (1981) “On generalized matching problems.” Inform. Process. Lett. 12, no. 1, 33–35. MR 83i:05059.
Hemminger, R.L. (1967) “Directed graphs with transitive abelian groups.” Amer. Math. Monthly 74, 1233–1234. MR 36.2 3678.
Hemminger, R.L. (1972) “On Whitney’s line graph theorem.” Amer. Math. Monthly 79, 374–378. MR 45.2 8562.
Hemminger, Robert L. (1972) “Line digraphs.” Proc. Conf., Western Michigan Univ., Kalamazoo, Mich., pp. 149–163. Lecture Notes in Math., Vol. 303, Springer, Berlin. MR 51.1 243.
Hemminger, Robert L.; Zelinka, Bohdan (1973) “Line isomorphisms on dipseudographs.” J. Combinatorial Theory Ser. B 14, 105–121. MR 47.1 3230.
Hemminger, R.L . (1975) “On the automorphism group of a line graph.” Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic. Univ., Boca Raton, Fla.), pp. 415–418. Congressus Numerantium, No. XIV, Utilitas Math., Winnipeg, Man. MR 53.1 192.
Hemminger, Robert L. (1974) “Digraphs with periodic line digraphs.” Studia Sci. Math. Hungar. 9, 27–31 (1975). MR 52.1 2948.
Hemminger, Robert L.; Klerlein, Joseph B. (1977) “Line pseudo-digraphs.” J. Graph Theory 1, no. 4, 365–377. MR 57.1 5812.
Hendy, M.D.; Foulds, L.R.; Penny, D. (1980) “Proving phylogenetic trees minimal with 1-clustering and set partitioning.” Math. Biosci. 51, no. 1–2, 71–88. MR 82h:05017.
Hering, Christoph (1967) “Endliche zweifach transitive Mobiusebenen ungerader Ordnung.” Arch. Math. (Basel) 18, 212–216. MR 35.1 3538.
Heron, A.P. (1973) “A property of the hyperplanes of a matroid and an extension of Dilworth’s theorem.” J. Math. Anal. appl. 42, 119–131. MR 51.2 12579.
Herzog, Marcel; Reid, K.B. (1976) “Regularity in tournaments.” Proc. Internat. Conf., Western Mich. Univ., Kalamazoo, Mich., pp. 442–453. Lecture Notes in Math., Vol. 642, Springer, Berlin, 1978. MR 58 #10572.
Hestenes, Marshall D. (1971) “On the use of graphs in group theory.” Proc. Third Ann Arbor Conf. on Graph Theory, Univ. of Michigan, Ann Arbor, Mich., pp. 97–128. Academic Press, New York, 1973. MR 50.2 12795.
Heuchenne, C. (1964) “Sur une certaine correspondance entre graphes.” Bull. Soc. Roy. Sci. Liege 33, 743–753. MR 30.2 5297.
Heuchenne, C. (1970) “Un algorithme general pour trouver un sous-ensemble d’un certain type a distance minimum d’une partie donnee.” Math. Sci. Humaines No. 30, 23–33. MR 43.1 1852.
Heuchenne, C . (1970) “Un algorithme general pour trouver un sous-ensemble d’un certain type a distance minimum d’une partie donnee.” Bull. Soc. Roy. Sci. Liege 39, fasc. 3–4, 118–130. MR 42.1 1672.
Hexel, E. (1981) “Uber ein kombinatorisches Problem von H. Sachs. [On a combinatorial problem of H. Sachs].” Wiss. Z. Tech. Hochsch. Ilmenau 27, no. 3, 69–80. MR 83g:05003.
Heydemann, M.-C.; Sotteau, D. (1976) “Line-graphs of hypergraphs. II.” Proc. Fifth Hungarian Colloq., Keszthely, Vol. I, pp. 567–582, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 80g:05052.
Heydemann, M.C. (1980) “On cycles and paths in digraphs.” Discrete Math. 31, no. 2, 217–219. MR 82g:05057.
Heydemann, M.-C . (1982) “Cycles in strong oriented graphs.” (French summary), Discrete Math. 38, no. 2–3, 185–190. MR 83m:05081.
Heydemann, M.-C . (1982) “Degrees and cycles in digraphs.” (French summary), Discrete Math. 41, no. 3, 241–251. MR 83m:05067.
Higgkvist, Roland; Thomassen, Carsten (1976) “On pancyclic digraphs.” J. Combinatorial Theory Ser. B 20, no. 1, 20–40. MR 52.2 10481.
Higgs, D.A. (1968) “Strong maps of geometries.” J. Combinatorial Theory 5, 185–191. MR 38.1 89.
Higgs, D.A. (1968) “Infinite graphs and matroids.” Proc. Third Waterloo Conf. on Combinatorics, pp. 245–253. Academic Press, New York, 1969. MR 43.1 81.
Higgs, D.A. (1969) “Matroids and duality.” Colloq. Math. 20, 215–220. MR 43.1 80.
Higman, D.G . (1970) “Partial geometries, generalized quadrangles and strongly regular graphs.” Atti del Convegno di Geometria Combinatoria e sue Applicazioni (Univ. degli Studi di Perugia, Perugia), pp. 263–293. 1st. Mat., Univ. Perugia, Perugia, 1971. MR 51.1 2945.
Hillman, A.P.; Grassl, R.M. (1981) “Polynomial ring generated by tableau shapes.” European J. Combin. 2, no. 1, 27–39. MR 82h:05007.
Hilton, A.J.W. (1974) “Analogues of a theorem of Erdos, Ko, and Rado on a family of finite sets.” Quart. J. Math. Oxford Ser. (2) 25, 19–28. MR 49.1 2406.
Hilton, A.J.W. (1976) “A theorem on finite sets.” Quart. J. Math. Oxford Ser. (2) 27, no. 105, 33–36. MR 53.1 146.
Hilton, A.J.W. (1981) “On ordered set systems and some conjectures related to the Erdos-Ko-Rado theorem and Turan’s theorem.” Mathematika 28, no. 1, 54–66. MR 83a:05006.
Hilton, A.J.W.; Rodger, C. (1980) “Graphs and configurations.” Proc. Colloq., Cerisy, (French), pp. 55–64, Presses Polytech. Romandes, Lausanne. MR 83b:05108.
Hirata, Tomio; Maruoka, Akira; Kumura, Masayuki (1979) “A polynomial time algorithm to find a path cover of a reducible flow graph.” Systems-Comput.-Controls 10, no$13, 71–78 (1981). MR 82h: 05039.
Hochberg, Murray (1972) “Restricted Sperner families and s-systems.” Discrete Math. 3, 359–364. MR 46.2 8850.
Hochberg, Murray (1978) “Doubly incomparable s-systems.” Second International Conference on Combinatorial Mathematics (New York), pp. 281–283, Ann. New York Acad. Sci., 319, New York Acad. Sci., New York, 1979. MR 81e:05007.
Hoffman, A.J.; McAndrew, M.H. (1965) “The polynomial of a directed graph.” Proc. Amer. Math. Soc. 16, 303–309. MR 33.1 68.
Hoffman, Alan J . (1972) “On limit points of spectral radii of non-negative symmetric integral matrices.” Proc. Conf., Western Michigan Univ., Kalamazoo, Mich., pp. 165–172. Lecture Notes in Math., Vol. 303, Springer, Berlin. MR 50.1 361.
Hoffman, Alan J.; Smith, John Howard (1974) “On the spectral radii of topologically equivalent graphs.” Proc. Second Czechoslovak Sympos., Prague, pp. 273–281. Academia, Prague, 1975. MR 53. 2 7834.
Hoffman, F. ; Kingsley, R.A.; Levow, R.B.; Mullin, R.C.; Thomas, R.S.D. (Editors) (1974) “Proceedings of the fifth Southeastern Conference on Combinatorics, Graph Theory and Computing.” Held at Florida Atlantic University, Boca Raton, Fla., February 25–March 1, 1974. Congressus Numerantium, No. X. Utilitas Mathematica Publishing, Inc., Winnipeg, Man. vii+688 pp. MR 50.1 4315.
Hoffman, F.; Mullin, R.C.; Levow, R.B.; Roselle, D.; Stanton, R.G.; Thomas, R.S.D. (Editors) (1975) “Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing.” Held at Florida Atlantic University, Boca Raton, Fla., February 17–20, 1975. Congressus Numerantium, No. XIV. Utilitas Mathematica Publishing, Inc., Winnipeg, Man. vii+648 pp. MR 52.1 5432.
Hoffman, F.; Lesniak, L.; Mullin, R.; Reid, K.B.; Stanton, R. (Editors) (1976) “Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory, and Computing.” Held at Louisiana State University, Baton Rouge, La., February 9–12, 1976. Congressus Numerantium, No. XVII. Utilitas Mathematica Publishing Inc., Winnipeg, Man. ix+546 pp. MR 54.1 2471.
Hoffman, Alan J .; Joffe, Peter (1976) “Nearest δ-matrices of given rank and the Ramsey problem for eigenvalues of bipartite 6-graphs.” (French summary), Colloq. Internat. CNRS, Univ. Orsay, Orsay, pp. 237–240, Colloques Internat. CNRS, 260, CNRS, Paris, 1978. MR 81b:05080.
Hoffman, F.; Lesniak-Foster, L.; McCarthy, D.; Mullin, R.C.; Reid, K.B.; Stanton, R.G. (Editors) (1977) “Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory, and Computing.” Held at Louisiana State University, Baton Rouge, La., February 28–March 3, 1977. Congressus Numerantium, No. XIX. Utilitas Mathematica Publishing, Inc., Winnipeg, Man. vii+685 pp. MR 57.1 5768.
Hoffman, A.J.; Schwartz, D.E. (1977) “On partitions of a partially ordered set.” J. Combinatorial Theory Ser. B 23, no. 1, 3–13. MR 57 #12244.
Hoffman, A.J.; Jamil, Basharat A. (1977/78) “On the line graph of the complete tripartite graph.” Linear and Multilinear Algebra 5, no. 1, 19–25. MR 81h:05112.
Hoffman, Frederick; McCarthy, D.; Mullin, Ronald C.; Stanton, Ralph G. (Editors) (1978) “Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing.” Held at Florida Atlantic University, Boca Raton, Fla., January 30–February 2, 1978. Congressus Numerantium, XXI. Utilitas Mathematica Publishing, Inc., Winnipeg, Man. x+694 pp. MR 80a-.05004.
Hoft, Hartmut; Howard, Paul (1973) “A graph theoretic equivalent to the axiom of choice.” Z. Math. Logik Grundlagen Math. 19, 191. MR 47.2 4831.
Holmes, R.A. (1970) “Graphical representations of complete metric spaces.” J. London Math. Soc. (2) 2, 727–735. MR 48.1 5022.
Holton, D.A . (1973) “Stability.” Proc. Second Australian Conf., Univ. Melbourne, Melbourne, pp. 53–55. Lecture Notes in Math., Vol. 403, Springer, Berlin, 1974. MR 51.1 2977.
Holton, D.A . (Editor) (1973) “Combinatorial mathematics.” Proceedings of the Second Australian Conference on Combinatorial Mathematics, University of Melbourne, 1973. Lecture Notes in Mathematics, Vol. 403. Springer-Verlag, Berlin-New York, 1974. vii+148 pp. MR 49.2 10558.
Holton, D.A.; Grant, Douglas D. (1975) “Products of graphs and stability.” J. Combinatorial Theory Ser. B 19, no. 1, 24–41. MR 52.2 13507.
Holton, D.A.; Stacey, K.C.; McAvaney, K.L. (1976) “The semi-stability of lexicographic products.” Combinatorial mathematics, V (Proc. Fifth Austral. Conf., Roy. Melbourne Inst. Tech., Mebourne), pp. 128–132. Lecture Notes in Math., Vol. 622, Springer, Berlin, 1977. MR 57 #9596.
Holton, D.A.; Seberry, Jennifer (Editors) (1977) “Combinatorial mathematics.” Proceedings of the International Conference on Combinatorial Theory, held at the Australian National University, Canberra, August 16–27, 1977. Lecture Notes in Mathematics, 686. Springer-Verlag, Berlin-New York; Australian Academy of Science, Canberra, 1978. ix+353 pp. MR 80a:05001.
Holton, D.A.; Little, C.H.C. (1980) “Elegant odd rings and nonplanar graphs.” Combinatorial mathematics, VIII (Geelong), pp. 234–268, Lecture Notes in Math., 884, Springer, Berlin, 1981.
Holton, D.A.; McKay, B.D.; Plummer, M.D. (1981) “A corollary to Perfect’s theorem.” Combinatorial mathematics, IX (Brisbane), pp. 294–299, Lecture Notes in Math., 952, Springer, Berlin-New York, 1982. MR 83m: 05082.
Holzmann, C.A.; Norton, P.G.; Tobey, M.D. (1973) “A graphical representation of matroids.” SIAM J. Appl. Math. 25, 618–627. MR 52.2 10458.
Homagk, Fritz (1969) “Ein intuitionistischer Beweis fur den Graphensatz von D. Koenig.” Compositio Math. 21, 292–294. MR 42.1 1696.
Homenko, N.P. [Homenko, M.P.]; Strok, V.V. (1971) “Combinatorics of imbeddings of partitions.” (Russian. English summary), Topological aspects of graph theory (Russian), pp. 272–290, 306–307. Izdanie Inst. Mat. Akad. Nauk Ukrain. SSR, Kiev. MR 52.2 13415.
Homenko, N.P. [Homenko, M.P.]; Javors’kii, E.B. (1971) “One-component imbeddings of graphs in orientable 2-manifolds.” (Russian. English summary), Topological aspects of graph theory (Russian), pp. 83–89, 300–301. Izdanie Inst. Mat. Akad. Nauk Ukrain. SSR, Kiev. MR 52.2 13454.
Homenko, M.P . (Editor) (1971) “Topological aspects of graph theory.” (Russian), Izdanie Inst. Mat. Akad. Nauk Ukrain. SSR, Kiev, 309 pp. MR 50.1 4357.
Homenko, M.P . (Editor) (1973) “ψtransformations of graphs.” (Ukrainian), Vidannja Inst. Mat. Akad. Nauk Ukrain. RSR, Kiev, 383 pp. MR 50.1 4358.
Homenko, M.P.; Ostroverhii, M.O.; Kuz’menko, V.O. (1973) “Maximum genus of graphs.” (Ukrainian. Russian and English summaries), ψ-transformations of graphs (Ukrainian), pp. 180–210, 366–367. Vidannja Inst. Mat. Akad. Nauk Ukrain. RSR, Kiev. MR 54.2 10057.
Homenko, N.P . (1973) “Method of ψ-transformations, and some applications of it.” (Ukrainian. Russian and English summaries), ψ-transformations of graphs (Ukrainian), pp. 35–96, 361–362. Vidannja Inst. Mat. Akad. Nauk Ukrain. RSR, Kiev. MR 54.1 124.
Homenko, N.P . [Homenko, M.P.] (1971) “Topological aspects of graph theory.” (Russian. English summary), Topological aspects of graph theory (Russian), pp. 5–63, 299. Izdanie Inst. Mat. Akad. Nauk Ukrain. SSR, Kiev. MR 55.1 2626.
Homenko, M.P.; Ostroverhii, M.O. (1973) “Genus of line graphs.” (Ukrainian. Russian and English summaries), ψ-transformations of graphs (Ukrainian), pp. 122–131, 363. Vidannja Inst. Mat. Akad. Nauk Ukrain. RSR, Kiev. MR 55.1 155.
Homenko, M.P . (1973) “The collection Topological aspects of graph theory.” (Ukrainian. Russian and English summaries), ψ-transformations of graphs (Ukrainian), pp. 352–359, 374. Vidannja Inst. Mat. Akad. Nauk Ukrain. RSR, Kiev. MR 57.1 5804.
Homenko, M.P.; Ostroverhii, M.O. (1973) “Hyperrelative genus of a graph.” (Ukrainian. Russian and English summaries), ψ-transformations of graphs (Ukrainian), pp. 168–179, 365. Vidannja Inst. Mat. Akad. Nauk Ukrain. RSR, Kiev. MR 58 #5396.
Homenko, N.P. [Homenko, M.P.]; Lysenko, N.V. (1977) “Some properties of ψ-transformations.” (Russian), Akad. Nauk Ukrain. SSR Inst. Mat. Preprint No. 25, a36 pp. MR 58 #10548.
Homenko, N.P. [Homenko, M.P.]; Ostroverhii, N.A. [Ostroverhii, M.O.] (1977) “2-cell imbedding of graphs into orientable 2-manifolds.” (Russian), Graph theory (Russian), pp. 54–62, Inst. Mat., Akad. Nauk Ukrain. SSR, Kiev. MR 80f-.05028.
Homenko, N.P.; Gluhov, A.D. (1980) “Single-component 2-cell embeddings and the maximum genus of a graph.” (Russian), Akad. Nauk Ukrain. SSR Inst. Mat. Preprint, no. 8. Nekotorye Topologiceskile i Kombinator. Svoistva Grafov, 5–23. MR 81m: 05065.
Hooi-tong, Loh (1970) “On a class of directed graphs - with an application to traffic-flow problems.” Operations Res. 18, 87–94. MR 42.1 131.
Hopcroft, John E.; Karp, Richard M. (1973) “An n5/2 algorithm for maximum matchings in bipartite graphs.” SIAM J. Comput. 2, 225–231. MR 49.1 2468.
Hopkins, Glenn; Staton, William (1982) “Extremal bipartite subgraphs of cubic triangle-free graphs.” J. Graph Theory 6, no. 2, 115–121. MR 83i:05041.
Hopkins, Glenn; Staton, William (1982) “Maximal bipartite subgraphs.” Ars Combin. 13, 223–226. MR 83j:05044.
Hopkins, L.B.; Trotter, W.T. (1980) “A bound on the interval number of a complete multipartite graph.” The theory and applications of graphs (Kalamazoo, Mich.), pp. 391–407, Wiley, New York, 1981. MR 83i:05042.
Horak, Peter (1982) “Enumeration of graphs maximal with respect to connectivity.” (Russian summary), Math. Slovaca 32, no. 1, 81–84. MR 83f:05030.
Horst, R . (1976) “Ein graphentheoretischer Algorithmus fur einige Fluβprobleme in Netzwerken mit Kantengewinnen.” (English summary), Computing 17, no. 2, 121–127. MR 55.1 2652.
Hosoya, Haruo (1973) “Topological index and Fibonacci numbers with relation to chemistry.” Fibonacci Quart. 11, no. 3, 255–266. MR 48.1 1996.
Howorka, Edward (1977) “A characterization of distance-hereditary graphs.” Quart. J. Math. Oxford Ser. (2) 28, no. 112, 417–420. MR 58 #5371.
Hsu, Harry T. (1975) “An algorithm for finding a minimal equivalent graph of a digraph.” J. Assoc. Comput. Mach. 22, 11–16. MR 58 #10573.
Hsu, Wen Lian (1979) “How to color claw-free perfect graphs.” Studies on graphs and discrete programming (Brussels), pp. 189–197, North-Holland Math. Stud., 59, North-Holland, Amsterdam, 1981. MR 83h:05037.
Hubaut, Xavier L. (1975) “Strongly regular graphs.” Discrete Math$113, no$14, 357–381. MR 53. 1 5375.
Hulme, Bernie L . (1975) “A lattice algebra for finding simple paths and cuts in a graph.” Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 419–428. Congressus Numerantium, No. XIV, Utilitas Math., Winnipeg, Man. MR 53.1 5368.
Hung, Stephen H.Y.; Mendelsohn, N.S. (1973) “Directed triple systems.” J. Combinatorial Theory Ser. A 14, 310–318. MR 47.1 3190.
Hull, Bradley (1975) “Two algorithms for matroids.” Discrete Math$113, no$12, 121–128. MR 52. 2 10459.
Hurst, C. A. (1964) “Applicability of the Pfaffian method to combinatorial problems on a lattice.” J. Mathematical Phys. 5, 90–100. MR 29.1 31.
Hutchinson, Joan P. (1974) “Eulerian graphs and polynomial identities for sets of matrices.” Proc. Nat. Acad. Sci. U.S.A. 71, 1314–1316. MR 50.1 2209.
Hutchinson, Joan P. (1975) “Eulerian graphs and polynomial identities for skew-symmetric matrices.” Canad. J. Math. 27, no. 3, 590–609. MR 53.2 7858.
Hutchinson, Joan P. (1975) “On words with prescribed overlapping subsequences.” Utilitas Math. 7, 241–250. MR 51.2 12602.
Hval, V . [Chval, Viliarro] (1974) “A certain identity for the determinant of a multidimensional matrix, and its application.” (Russian), Rev. Roumaine Math. Pures Appl. 19, 171–178. MR 51.1 203.
Hwang, F.K . (1973) “A group-testing problem.” Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 345–355. Utilitas Math., Winnipeg, Man. MR 52.1 6965.
Hwang, F.K . (1977) “Several problems on knockout tournaments.” Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 363–380. Congressus Numerantium, No. XIX, Utilitas Math., Winnipeg, Man. MR 58 #16374.
Hyyro, Seppo (1968) “Einige Bemerkungen uber Rekonstruktion des Graphen aus seinen Untergraphen.” Ann. Univ. Turku. Ser. A I No. 118, no. 7, 7 pp. MR 41.2 5234.
Illies, Norbert (1978) “A counterexample to the generalized Aanderaa-Rosenberg conjecture.” Information Processing Lett. 7, no. 3, 154–155. MR 58 #3678.
Ilzinja, I.G.; Fricnovic, G.F. (1972) “A certain approach to the solution of the problem of the shortest covering.” (Russian), Avtomat. i Vycisl. Tehn., no. 1, 18–19. MR 46.2 5157.
Imrich, W. (1967) “Kartesisches Produkt von Mengensystemen und Graphen.” Studia Sci. Math. Hungar. 2, 285–290. MR 36.1 1352.
Imrich, Wilfried (1969) “Graphen mit transitver Automorphismengruppe.” Monatsh. Math. 73, 341–347. MR 41.1 108.
Imrich, Wilfried (1971) “Uber das schwache Kartesische Produkt von Graphen.” (English summary), J. Combinatorial Theory Ser. B 11, 1–16. MR 43.2 6121.
Imrich, Wilfried (1972) “On products of graphs and regular groups.” Israel J. Math. 11, 258–264. MR 47.1 3234.
Imrich, Wilfried; Izbicki, Herbert (1975) “Associative products of graphs.” Monatsh. Math. 80, no. 4, 277–281. MR 53.2 7864.
Imrich, W . (1973) “On graphical regular representations of groups.” Infinite and finite sets (Colloq., Keszthely), Vol. II, pp. 905–925. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR 51.2 12594.
Imrich, W . (1976) “Graphical regular representations of groups of odd order.” Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely), Vol. II, pp. 611–621, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 80c:05081.
Ingleton, A.W . (1969) “Representation of matroids.” Combinatorial Mathematics and its Applications (Proc. Conf., Oxford), pp. 149–167. Academic Press, London, 1971. MR 43.2 4700.
Ingleton, A.W.; Piff, M.J. (1973) “Gammoids and transversal matroids.” J. Combinatorial Theory Ser. B 15, 51–68. MR 48.2 8276.
Ingleton, A.W.; Main, R.A. (1975) “Non-algebraic matroids exist.” Bull. London Math. Soc. 7, 144–146. MR 51.1 5346.
Ingleton, A.W . (1975) “Non-base-orderable matroids.” Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen), pp. 355–359. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976. MR 52.2 13442.
Ingleton, A.W . (1976) “Transversal matroids and related structures.” Higher combinatorics (Proc. NATO Advanced Study Inst., Berlin), pp. 117–131, NATO Adv. Study Inst. Ser., Ser. C: Math, and Phys. Sci., 31, Reidel, Dordrecht, 1977. MR 80b:05020.
Iri, Masao (1971) “Combinatorial canonical form of a matrix with applications to the principal partition of a graph.” Electron. Commun. Japan 54, no. 1, 30–37. MR 47.1 245.
Iri, Masao; Fujishige, Satoru (1981) “Use of matroid theory in operations research, circuits and systems theory.” Internat. J. Systems Sci. 12, no. 1, 27–54. MR 82a:05039.
Ismailov, S.M . (1971) “The number of arcs of a digraph of a given radius with a given number of vertices and strong components.” (Russian. Azerbaijani summary), Akad. Nauk Azerbaidzan. SSR Dokl. 27, no. 2, 8–12. MR 45.1 3250.
Ito, Tatsuro (1982) “Bipartite distance-regular graphs of valency three.” Linear Algebra Appl. 46, 195–213. MR 83j:05046.
Ivanescu, Petru L.; Rudeanu, Sergiu (1967) “Boolean methods in operations research.” (Czech summary), Ekonom.-Mat. Obzor 3, 422–445. MR 36.2 7416.
Ivanescu, P.L. [Hammer, P.L.]; Rudeanu, S. (1969) “A pseudo-Bollean viewpoint on systems of representatives.” Zastos. Mat. 10, 135–142. MR 39.2 6771.
Izbicki, Herbert (1960) “Graphentransformationen.” Monatsh. Math. 64, 135–175. MR 22.1 6731.
Izbicki, Herbert (1969) “Die Entropie η-transformieter gerichteter Graphen.” Osterreich. Akad. Wiss. Math.-Natur. Kl.S.-B. II 177, 227–235. MR 41.2 8303.
Izbicki, Herbert (1969) “Die Entropie ξ-transformierter gerichteter Graphe.” Osterreich. Akad. Wiss. Math.–Natur. Kl.S.-B. II 177, 215–225. MR 43.1 106.
Jachanova, J.; Zakova, H. (1973) “Polarities and order of a projective plane.” Grundlagen der Geometrie und algebraische Methoden (Internat. Kolloq., Padagog. Hochsch. “Karl Liebknecht”, Potsdam), pp. 130–133.Potsdamer forschungen, Reihe B, Heft 3, Padagog. Hochsch. “Karl Liebknecht”, Potsdam, 1974.
Jackson, W . (1977) “A characterization of the reducibility of non-negative matrices.” Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 381–384. Congressus Numerantium, No. XIX, Utilitas Math., Winnipeg, Man. MR 58 #16726.
Jackson, Bill (1979) “Paths and cycles in oriented graphs.” Combinatorics 79 (Proc. Colloq., Univ. Montreal, Montreal, Que.), Part I. Ann. Discrete Math. 8, 275–277. MR 82a:05051.
Jackson, Bill (1981) “Long paths and cycles in oriented graphs.” J. Graph Theory 5, no. 2, 145–157. MR 82i:05050.
Jackson, Bill (1981) “Cycles in bipartite graphs.” J. Combin. Theory Ser. B 30, no. 3, 332–342. MR 83h:05057.
Jackson, D.M.; Goulden, I.P. (1979) “Sequence enumeration and the de Brujin-van Aardenne-Ehrenfest-Smith-Tutte theorem.” Canad. J. Math. 31, no. 3, 488–495. MR 81j:05013.
Jacos, Vasil (1979) “S-cyclic directed graphs.” (Russian). With a loose English summary. Math. Slovaca 29, no. 3, 201–208. MR 81i:05076.
Jacques, A. (1969) “Constellations et graphes topologiques.” Combinatorial Theory and its Applications, II (Proc. Colloq., Balatonfured), pp. 657–673. North-Holland, Amsterdam, 1970. MR 45.2 6676.
Jaeger, F. (1979) “Flows and generalized coloring theorems in graphs.” J. Combin. Theory Ser. B 26, no. 2, 205–216. MR 81j:05059.
Jaeger, F.; Shank, H. (1981) “On the edge-coloring problem for a class of 4-regular maps.” J. Graph Theory 5, no. 3, 269–275. MR 83c:05056a.
Janowitz, M.F. (1972) “Constructible lattices.” J. Austral. Math. Soc. 14, 311–316. MR 47.2 4881.
Janusz, G.J. (1968) “Indecomposable modules for finite groups.” Theory of Finite Groups (Symposium, Harvard Univ., Cambridge, Mass.), pp. 149–157. Benjamin, New York, 1969. MR 40.1 1494.
Javors’kii, E.B . (1978) “Representations of directed graphs and ψ-transformations.” (Russian), Theoretical and applied questions of differential equations and algebra (Russian), pp. 247–250, 272, “Naukova Dumka”, Kiev. MR 81i:05060.
Jean, Michel (1967) “Relations monomorphes et classes universelles,” C.R. Acad. Sci. Paris Ser. A-B 264, A591–A593. MR 78.1 54.
Jean, Michel (1969) “An interval graph is a comparability graph.” J. Combinatorial Theory 7, 189–190. MR 39.2 4036.
Jean, Michel (1968) “Line-symmetric tournaments.” Recent Progress in Combinatorics (Proc. Third Waterloo Conf. on Combinatorics), pp. 265–271. Academic Press, New York, 1969. MR 40.2 5482.
Jeffries, Clark; Klee, Victor; van den Driessche, Pauline (1977) “When is a matrix sign stable?” Canad. J. Math. 29, no. 2, 315–326. MR 56.1 5603.
Jendrol, Stanislav (1974) “On the face-vector of a simple map.” Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague), pp. 311–314. Academia, Prague, 1975. MR 53.1 2726.
Jendrol, Stanislav; Ryjacek, Zdenek (1981) “3-polytopes of constant tolerance of edges.” Comment. Math. Univ. Carolin. 22, no. 4, 843–850. MR 83c:05051.
Jenkyns, T.A.; Nash-Williams, C.St.J.A. (1968) “Counterexamples in the theory of well-quasi-ordered sets.” Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich.), pp. 87–91. Academic Press, New York, 1969. MR 40.2 7156.
Jenkyns, Thomas A . (1976) “The efficacy of the “greedy” algorithm.” Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory, and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 341–350. Congressus Numerantium, No. XVII, Utilitas Math., Winnipeg, Man. MR 56.1 5303.
Jeurissen, R.H. (1981) “The incidence matrix and labelings of a graph.” J. Combin. Theory Ser. B 30, no. 3, 290–301. MR 83f:05048.
Jiricka, Josef (1975) “The number of projective trees with a given number of vertices.” Prague Bull. Math. Linguist. No. 24, 51–60. MR 55.1 5471.
Johnson, C.S., Jr.; McMorris, F.R. (1982) “A note on two comparability graphs.” (Russian summary), Math. Slovaca 32, no. 1, 61–62. MR 83c:05104.
Johnson, Donald B. (1975) “Finding all the elementary circuits of a directed graph.” SIAM J. Comput. 4, 77–84. MR 53.1 2010.
Johnson, David E.; Johnson, Johnny R. (1972) “Graph theory with engineering applications.” The Ronald Press Co., New York, x+392 pp. MR 49.1 98.
Johnson, Diane M.; Dulmage, A.L.; Mendelsohn, N.S. (1962) “Connectivity and reducibility of graphs.” Canad. J. Math. 14, 529–539. MR 25.2 3856.
Johnson, N.L. (1974) “Collineation groups of derived semifield planes.” Arch. Math. (Basel) 25, 400–404. MR 51.1 8949a.
Johnson, N.L. (1975) “Colineation groups of derived semifield planes.” Arch. Math. (Basel) 26, 101–106. MR 51.1 8949b.
Johnson, R.H. (1976) “Simple directed trees.” Discrete Math. 14, no. 3, 257–264. MR 58 #10540.
Jolivet, Jean-Loup (1972) “Sur la connexite des graphes orientes.” C.R. Acad. Sci. Paris Ser. A-B 274, A148–A150. MR 44.2 6530.
Jolivet, Jean-Loup (1974) “Indice de partition en chaines d’un graphe simple et pseudo-cycles hamiltoniens.” C.R. Acad. Sci. Paris Ser. A 279, 479–481. MR 53.2 10647.
Jolivet, J.L . (1974) “Graphes parfaits pour une propriete P.” Colloque sur la Theorie des Graphes (Paris). Cahiers Centre Etudes Recherche Oper. 17, no. 2–3–4, 253–256. MR 53.2 7841.
Jones, G.A . (1978) “Graph imbeddings, groups, and Riemann surfaces.” Algebraic methods in graph theory, Vol. I, II (Szeged), pp. 297–311, Colloq. Math. Soc. Janos Bolyai, 25, North-Holland, Amsterdam, 1981. MR 83b:05061.
Jones, Lee K. (1976) “Sur une loi de probabilite conditionelle de Kleitman.” Discrete Math. 15, no. 1, 107–108. MR 53.2 12970.
Joni, S.A.; Rota, G.-C. (1979) “Coalgebras and bialgebras in combinatorics.” Stud. Appl. Math. 61, no. 2, 93–139. MR 81c:05002.
Joni, S.A.; Rota, G.-C. (1980) “A vector space analog of permutations with restricted position.” J. Combin. Theory Ser. A 29, no. 1, 59–73. MR 83j:05005a.
Joni, S.A.; Rota, G.-C (1978) “On restricted bases for finite fields.” Combinatorial mathematics, optimal designs and their applications (Proc. Sympos. Combin. Math, and Optimal Design, Colorado State Univ., Fort Collins, Colo.). Ann. Discrete Math. 6 (1980), 215–217. MR 83j:05005b
Jonsson, W.; McKay, J. (1976) “More about the Mathieu group M22.” Canad. J. Math. 28, no. 5, 929–937. MR 55.1 139.
Joseph, A.W.; Bizley, M.T.L. (1960) “The two-pack matching problem.” J. Roy. Statist. Soc. Ser. B 22, 114–130. MR 22.2 7947.
Jucis, A.-A.A . [Jucys, A.-A.A.] (1980) “Tournaments and generalized Young tableaux.” (Russian), Mat. Zametki 27, no. 3, 353–359, 492. MR 81k:05007.
Jucovic, E. (1967) “Beitrag zur kombinatorischen Inzidenzgeometrie.” Acta Math. Acad. Sci. Hungar. 18, 255–259. MR 36.1 766.
Jucovic, E.; Trenkler, M. (1973) “A theorem on the structure of cell-decompositions of orientable 2-manifolds.” Mathematika 20, 63–82. MR 49.2 8903.
Jucovic, E. (1976) “On face-vectors and vertex-vectors of cell-decompositions of orientable 2-manifolds.” Math. Machr. 73, 285–295. MR 55.1 5478.
Jung, H. A. (1968) “Zu einem Satz von E.S. Wolk uber die Vergleichbarkeitsgraphen von ordnungstheoretischen Baumen.” Fund. Math. 63, 217–219. MR 38.2 3167.
Jung, H.A. (1978) “On a class of posets and the corresponding comparability graphs.” J. Combinatorial Theory Ser. B 24, no. 2, 125–133. MR 58 #10614.
Jung, H.A. (1981) “A note on fragments of infinite graphs.” Combinatorica 1, no. 3, 285–288. MR 83f:05027.
Jurak, V . (1973) “Zur Konstruktion von einigen Turnieren mit Punkten einiger transitiver endlicher projektiver Ebenen.” Grundlagen der Geometrie und algebraische Methoden (Internat. Kolloq., Padagog. Hochsch. “Karl Liebknecht”, Potsdam), pp. 125–129. Potsdamer Forschungen, Reihe B, Heft 3, Padagog. Hochsch.. “Karl Liebknecht”, Potsdam, 1974. MR 51.1 208
Jurak, V . (1973) “Remark about a construction of some tournaments with points of certain projective planes.” Acta Univ. Carolinae-Math, et Phys. 14, no. 2, 17–21, (1974). MR 49.2 7171.
Jurak, Veroslav (1974) “On a finite projective plane the points of which are nodes of a tournament.” Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague), pp. 323–326. Academia, Prague, 1975. MR 52.1 5448.
Jurkat, W.B.; Ryser, H.J. (1968) “Extremal configurations and decomposition theorems. I.” J. Algebra 8, 194–222. MR 36.2 3667.
Kadlecek, Jiri (1974) “Construction of a net without transversals over a non-planar near-field.” Czechoslovak Math. J. 24 (99), 301–310. MR 50.1 1107.
Kainen, Paul C . (1969) “Embeddings and orientations of graphs.” Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta.), pp. 193–196. Gordon and Breach, New York, 1970. MR 44.2 6531.
Kainen, Paul C . (1971) “Trivalent descriptions of graphs.” Proc. Second Louisiana Conf. on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 331–338. Louisiana State Univ., Baton Rouge, La. MR 48.1 178.
Kajitani, Yoji; Kanada, Hajime (1971) “Orientation of a graph and its applications.” Electron. Commun. Japan 54, no. 6, 25–32. MR 47.1 1677.
Kalbfleisch, J.G.; Stanton, R.G. (1969) “A combinatorial problem in matching.” J. London Math. Soc. 44, 60–64. MR 38.1 62.
Kalmanovic, A.M . (1967) “The semigroup of one-to-one partial endomorphisms of a graph.” (Russian), Vestnik Har’kov. Gos. Univ., no. 26, 54–64. MR 40.2 4171.
Kalmanovic, A.M . (1980) “Semiheaps of pairs of homomorphisms of Berge graphs.” (Russian), Modern algebra (Russian), pp. 37–49, Leningrad. Gos. Ped. Inst., Leningrad. MR 82c:05053.
Kam, John B.; Ullman, Jeffrey D (1976) “Global data flow analysis and iterative algorithms.” J. Assoc. Comput. Mach. 23, no. 1, 158–171. MR 53.2 9697.
Kamae, Takahiko (1967) “A systematic method of finding all directed circuits and enumerating all directed paths.” IEEE Trans. Circuit Theory CT-14, 166–172. MR 39.2 6788.
Kambayashi, Y . (ed.) (1981) “Proceedings of the conference on consecutive retrieval property.” Vols. 1 and 2, Reports 438 and 439 of Institute of Computer Science, Polish Academy of Sciences, Warsaw, July.
Kameda, T. (1969) “Note on Halin’s theorem on minimally connected graphs.” J. Combinatorial Theory Ser. B 17, 1–4. MR 53.1 189.
Kameda, T . (1974/75) “On the vector representation of the reachability in planar directed graphs.” Information Processing Lett. 3, 75–77. MR 53.1 189.
Kampen, G.R. (1976) “Orienting planar graphs.” Discrete Math$114, no$14, 337–341. Mfe 54. 1 5034.
Kantor, William M. (1970) “On a class of Jordan groups.” Math. z. 118, 58–68. MR 44. 2 5368.
Kantor, William M. (1972) “On incidence matrices of finite projective and affine spaces.” Math. Z. 124, 315–318. MR 51.2 13850.
Kantor, William M. (1974) “Dimension and embedding theorems for geometric lattices.” J. Combinatorial Theory Ser. A 17, 173–195. MR 49.2 10581.
Kantor, William M. (1975) “Envelopes of geometric lattices.” J. Combinatorial Theory Ser. A 18, 12–26. MR 50.2 9632.
Kantor, William M . (1973) “Some highly geometric lattices.” (Italian summary), Colloquio Internazionale sulle Teorie Combinatorie (Roma), Tomo I, pp. 183–191. Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome, 1976. MR 56.2 11832.
Karejan, Z.A.; Mosesjan, K.M. (1980) “The Hamiltonian completion number of a digraph.” (Russian. Armenian summary), Akad. Nauk Armjan. SSR Dokl. 70, no. 3, 129–132. MR 82c:05067.
Karejan, Z.A . (1979) “Arboricity of digraphs.” (Russian. Armenian summary), Trudy Vycisl. Centra Akad. Nauk Armjan. SSR i Erevan. Gos. Univ. Mat. Voprosy Kibernet. i Vycisl. Tehn. No. 9 Teorija Grafov, 59–63.MR 82h:05025.
Karp, Richard M. (1978) “A characterization of the minimum cycle mean in a digraph.” Discrete Math. 23, no. 3, 309–311. MR 80b:05039.
Karp, R.M . (1971/72) “A simple derivation of Edmonds1 algorithm for optimum branchings.” Networks 1, 265–272. MR 45.1 3251.
Karpovsky, M.G.; Mil’man, V.D. (1978) “On subspaces contained in subsets of finite homogeneous spaces.” Discrete Math. 22, no. 3, 273–280. MR 81g:05013.
Karteszi, Ferenc (1972) “Finite Mobius planes as solutions of a combinatorial extremum problem.” (Hungarian), Magyar Tud. Akad. Mat. Fiz. Oszt. Kozl. 21, 73–76. MR 47.2 6516.
Kasyanov, V.N. [Kasjanov, V.N.] (1973) “Some properties of fully reducible graphs.” Information Processing Lett. 2, 113–117. MR 56.2 8416.
Katetov, Miroslav (1972) “Baire classification and infinite perceptrons.” Comment. Math. Univ. Carolinae 13, 373–396. MR 49.1 2469.
Katona, G.; Korvin, G. (1966) “Functions defined on a directed graph.” Theory of Graphs (Proc. Colloq., Tihany), pp. 209–213. Academic Press, New York, 1968. MR 38.1 2057.
Katona, Gy. (1966) “On a conjecture of Erdos and a stronger form of Sperner’s theorem.” Studia Sci. Math. Hungar. 1, 59–63. MR 34.2 5690.
Katona, G.; Szemeredi, E. (1967) “On a problem of graph theory.” Studia Sci. Math. Hungar. 2, 23–28. MR 35.1 1505.
Katona, G.O.H.; Szasz, D.O.H. (1969) “Matching problems.” Combinatorial Theory and its Applications, II (Proc. Colloq., Balatonfured), pp. 695–703. North-Holland, Amsterdam, 1970. MR 46.1 3351.
Katona, G. (1969) “A generalization of some generalizations of Sperner’s theorem.” Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta.), pp. 197–200. Gordon and Breach, New York, 1970.
Katona, G.; Szasz, D. (1971) “Matching problems.” J. Combinatorial Theory Ser. B 10, 60–92. MR 46.1 798.
Katona, G.O.H. (1972) “A generalization of some generalizations of Sperner’s theorem.” J. Combinatorial Theory Ser. B 12, 72–81. MR 44.1 2620.
Katona, G.O.H. (1973) “Two applications (for search theory and truth functions) of Sperner type theorems.” Period. Math. Hungar. 3, 19–26. MR 49.1 53.
Katona, G. (1973) “A three part Sperner theorem.” Studia Sci. Math. Hungar. 8, 379–390. MR 50.29597.
Katona, G.O.H . (1976) “Continuous versions of some extremal hypergraph problems.” Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely), Vol. II, pp. 653–678, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 80e:05071.
Kaucky, Josef (1968) “Some more remarks on certain algebraic identities.” (Loose Russian summary), Mat. Casopis Sloven. Akad. Vied 18, 213–217. MR 39.1 82
Kaufmann, A.; Pichat, E. (1977) “Methodes mathematiques non numeriques et leurs algorithmes. Tome I.” Masson, Paris-New York-Barcelona, xiv+189 pp. MR 56.2 17190a.
Kaufmann, A.; Pichat, E. (1977) “Methodes mathematiques non numeriques et leurs algorithmes. Tome II.” Masson, Paris-New York-Barcelona. xiv+159 pp. MR 56.2 17190b.
Keating, Kevin (1982) “The conjunction of Cayley digraphs.” Discrete Math. 42, no. 2–3, 209–219. MR 83k:05053.
Kelly, J.B. (1966) “Polynomials and polyominoes.” Amer. Math. Monthly 73, 464–471. MR 33.1 105.
Kelly, Paul; Merriell, David (1968) “Directed graphs having all bisections.” J. Combinatorial Theory 4, 4–18. MR 36.1 1357.
Kel’mans, A.K.; Lomonosov, M.V.; Polesskii, V.P. (1976) “Minimal coverings in a matroid.” (Russian), Problemy Peredaci Informacii 12, no. 3, 94–107. MR 57 #16112.
Kendall, David G. (1969) “Incidence matrices, interval graphs and seriation in archeology.” Pacific J. Math. 28, 565–570. MR 39.1 1344.
Kennedy, Daniel (1975) “Majors of geometric strong maps.” Discrete Math. 12, no. 4, 309–340. MR 56.1 165.
Kennedy, John W.; Gordon, Manfred (1978) “Graph contractions and a generalized Mobius inversion.” Second International Conference on Combinatorial Mathematics (New York), pp. 331–348, Ann. New York Acad. Sci., 319, New York Acad. Sci., New York, 1979. MR 83b:05092.
Kesel’man, D. Ja . (1978) “A contourless orientation of graph edges.” (Russian. English summary insert), Kibernetika (Kiev), no. 2, 83–90. MR 58 #16375.
Kesel’man, D. Ya . [Kesel’man, D. Ja.] (1979) “Strip enumeration of the vertices of graphs of certain classes.” Kiberentika (Kiev), no. 6, 23–29 (Russian); translated as Cybernetics 15 (1979), no. 6, 797–804 (1980). MR 82a:05058.
Khomenko, N.P . [Khomenko, M.P.]; Lysenko, N.V. (1981) “Characteristic graphs of a family of colorings of n-dimensional simplicial complexes.” (Russian), Akad. Nauk Ukrain. SSR Inst. Math. Preprint, no. 2, Svoistva Grafov Nekotor. Klassov, 12–19, 30. MR 83e:05052.
Kilmoyer, Robert; Solomon, Louis (1973) “On the theorem of Feit-Higman.” J. Combinatorial Theory Ser. A 15, 310–322. MR 50.2 9625.
Kim, Ki Hang; Rogers, Douglas G.; Roush, Fred W. (1979) “Similarity relations and semiorders.” Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 577–594, Congress. Numer., XXIII–XXIV, Utilitas Math., Winnipeg, Man. MR 81i:05013.
King, C.A. (1972) “A graph-theoretic programming language.” Graph theory and computing, pp. 63–75. Academic Press, New York. MR 50.1 1982.
King, T.; Nemhauser, G.L. (1974) “Some inequalities on the chromatic number of a graph.” Discrete Math. 10, 117–121. MR 50.1 1953.
Kirkpatrick, P.B. (1975) “On homologies in finite combinatorial geometries.” Bull. Austral. Math. Soc. 13, no. 1, 85–99. MR 52.1 152.
Kislicyn, S.S . (1967) “Partially ordered sets and k-decomposability.” (Russian), Sibirsk. Mat. Z. 8, 1197–1201. MR 36.1 2513.
Kjeldsen, Kjell (1973) “Distributions modulo subgroups of GF(q).” J. Combinatorial Theory Ser. A 15, 112–114. MR 47.1 1630.
Klarner, David A. (1969) “The number of graded partially ordered sets.” J. Combinatorial Theory 6, 12–19. MR 38.2 4333.
Klarner, David A. (1970) “The number of classes of isomorphic graded partially ordered sets.” J. Combinatorial Theory 9, 412–419. MR 42.1 2989.
Klamer, D.A.; Rado, R. (1974) “Arithmetic properties of certain recursively defined sets.” Pacific J. Math. 53, 445–463. MR 50.2 9784.
Klarner, David; Pollack, Jordan (1980) “Domino tilings of rectangles with fixed width.” Discrete Math. 32, no. 1, 45–52. MR 81k:05008.
Klarner, D.A. (1981) “Mathematical crystal growth. II.” Discrete Appl. Math. 3, no. 2, 113–117. MR 83a:05018.
Klee, Victor (1968) “The greedy algorithm for finitary and cofinitary matroids.” Combinatorics (Proc. Sympos. Pure Math., Vol. XIX. Univ. California, Los Angeles, Calif.), pp. 137–152. Amer. Math. Soc., Providence, R.I., 1971. MR 48.2 10865.
Klein, M.; Tibrewala, R.K. (1973) “Finding negative cycles.” INFOR—Canad. J. Operational Res. and Information Processing 11, 59–65. MR 48.2 8292.
Kleitman, D.; Rothschild, B. (1970) “The number of finite topologies.” Proc. Amer. Math. Soc. 25, 276–282. MR 40.2 7157.
Kleitman, D.; Martin-Lof, A.; Rothschild, B.; Whinston, A. (1970) “A matching theorem for graphs.” J. Combinatorial Theory 8, 104–114. MR 41.2 6713.
Kleitman, D.J.; Wang, D.L. (1973) “Algorithms for constructing graphs and digraphs with given valences and factors.” Discrete Math. 6, 79–88. MR 48.1 5901.
Kleitman, D.J.; Milner, E.C. (1973) “On the average size of the sets in a Sperner family.” Discrete Math. 6, 141–147. MR 49.1 2407.
Kleitman, D . (1973) “The number of Sperner families of subsets of an n element set.” Infinite and finite sets (Colloq., Keszthely), Vol. II, pp. 989–1001. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR 51.1 7885.
Kleitman, D.J.; Rothschild, B.L. (1975) “Asymptotic enumeration of partial orders on a finite set.” Trans. Amer. Math. Soc. 205, 205–220. MR 51.1 5326.
Kleitman, D.; Markowsky, G. (1975) “On Dedekind’s problem: the number of isotone Boolean functions. II.” Trans. Amer. Math. Soc. 213, 373–390. MR 52.1 2995.
Kleitman, D.J. (1976) “A note on the parity of the number of crossings of a graph.” J. Combinatorial Theory Ser. B 21, no. 1, 88–89. MR 55.2 12556.
Kleitman, D.J. (1974) “A note on perfect elimination digraphs.” SIAM J. Comput. 3, 280–282. MR 55.2 12556.
Klerlein, Joseph B . (1975) “Characterizing line dipseudographs.” Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 429–442. Congressus Numerantium, No. XIV, Utilitas Math., Winnipeg, Man. MR 53.1 190.
Klerlein, Joseph B.; Starling, A. Gregory (1979) “Hamiltonian cycles in Cayley color graphs of some special groups.” Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 595–599, Congress. Numer., XXIII–XXIV, Utilitas Math., Winnipeg, Man. MR 81c:05049.
Klin, M.H.; Poschel, R. (1978) “The Konig problem, the isomorphism problem for cyclic graphs and the method of Schur rings.” Algebraic methods in graph theory, Vol. I, II (Szeged), pp. 405–434, Colloq. Math. Soc. Janos Bolyai, 25, North-Holland, Amsterdam, 1981. MR 83h:05047.
Knopfmacher, J. (1969) “Note oil finite topological spaces.” J. Austral. Math. soc. 9, 252–256. MR 38.2 6528.
Knuth, Donald E. (1967) “Oriented subtrees of an arc digraph.” J. Combinatorial Theory 3, 309–314. MR 35.2 5361.
Knuth, Donald E. (1970) “Notes on central groupoids.” J. Combinatorial Theory 8, 376–390. MR 41.1 3645.
Knuth, Donald E. (1974) “Wheels within wheels.” J. Combinatorial Theory Ser. B 16, 42–46. MR 49.1 2450.
Knuth, Donald E. (1975) “Random matroids.” Discrete Math. 12, no. 4, 341–358. MR 53.2 10623.
Kuntzmann, J . (1972) “Theorie des reseaux (graphes).” Dunod, aParis. xxiv+288 pp. MR 52.1 2965.
Koh, K.M.; Teh, H.H. (1974/75) “On directed postman problem.” (Chinese summary), Nanyang Univ. J. Part III 8/9, 14–26. MR 54.2 12569.
Koh, Khee-meng (1976) “Even circuits in directed graphs and Lovasz1s conjecture.” Bull. Malaysian Math. Soc. 7, no. 3, 47–52. MR 56.1 2863.
Koh, K.M.; Rogers, D.G.; Lim, C.K. (1979) “On graceful graphs. I. Sum of graphs.” Southeast Asian Bull. Math. 3, no. 1, 58. MR 83h:05071.
Koh, K.M.; Rogers, D.G.; Teo, H.K.; Yap, K.Y. (1980) “Graceful graphs: some further results and problems.” Proceedings of the Eleventh Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla.), Vol. II. Congr. Numer. 29, 559–571. MR 83h:05072a.
Koh, K.M.; Rogers, D.G.; Lee, P.Y.; Toh, C.W. (1979) “On graceful graphs. V. Unions of graphs with one vertex in common.” Nanta Math. 12, no. 2, 133–136. MR 83h:05072b.
Kohler, Norbert (1976) “Zerlegung total gerichteter Graphen in Kreise.” (English summary), Manuscripta Math. 19, no. 2, 151–164. MR 53.2 13021.
Koren, Michael (1976) “Graphs with degrees from prescribed intervals.” Discrete Math. 15, no. 3, 253–261. MR 54.1 169.
Korfhage, Robert R . (1974) “Discrete computational structures.” Academic Press, New York-London, xii+381 pp. MR 51.1 173.
Koronkevic, A.I . (1977) “Logical analysis of a directed graph and the ordering of its vertices.” (Russian), Mathematical modeling of complex systems (Russian), pp. 9–21. Akad. Nauk Ukrain. SSR Inst. Kibernet., Kiev. MR 58 #16376.
Korvin, G . (1966) “Some combinatorial problems on complete directed graphs.” (French summary), Theory of Graphs (Internat. Sympos., Rome), pp. 197–213. Gordon and Breach, New York; Dunod, Paris, 1967. MR 36.2 3677.
Kosaraju, S. Rao (1977) “On independent circuits of a digraph.” J. Graph Theory 1, no. 4, 379–382. MR 58 #346.
Koslinski, A . (1975) “Decompositions of n-angles onto the 2-component sums.” Acta Fac. Rerum Natur. Univ. Comenain. Math., Special No., 23–24. MR 50.1 4401.
Kosticyn, V.N . (1964) “On groups of involutions In k, containing multiple elements.” (Russian), Moskov. Oblast. Ped. Inst. Ucen. Zap. 149, 85–90. MR 36.2 5004.
Kosticyn, V.N . (1964) “On neutral groups of involutions Ink .” (Russian), Moskov. Oblast. Ped. Inst. Ucen. Zap. 149, 91–93. MR 36.2 5005.
Kotzig, Anton ( 1961/62) “Beitrag zur Theorie der endlichen gerichteten Graphen.” Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Nat. Reihe 10, 118–125. MR 24.A A52.
Kotzig, Anton (1966) “Cycles in a complete graph oriented in equilibrium.” (Russian summary), Mat.-Fyz. Casopis Sloven. Akad. Vied 16, 175–182. MR 34.1 2491.
Kotzig, Anton (1968) “Sur le nombre des 4-cycles dans un tournoi.” Mat. Casopis Sloven. Akad. Vied 18, 247–254. MR 40.2 4155.
Kotzig, Anton (1969) “The decomposition of a directed graph into quadratic factors consisting of cycles.” Acta Fac. Rerum Natur. Univ. Comenian. Math. Publ. 22, 27–29. MR 44.1 117.
Kotzig, Anton (1969) “Groupoids and partitions of complete graphs.” Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta.), pp. 215–221. Gordon and Breach, New York, 1970. MR 42.2 4446.
Kotzig, Anton (1975) “On the maximal order of cyclicity of antisymmetric directed graphs.” Discrete Math. 12, 17–25. MR 52.2 10483.
Kotzig, Anton (1975) “Transformations of edge-colourings of cubic graphs.” Discrete Math. 11, 391–399. MR 52.1 2942.
Kotzig, Anton (1978) “Problems and recent results on 1-factorizations of Cartesian products of graphs.” Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 457–460, Congress. Numer., XXI, Utilitas Math., Winnipeg, Man. MR 80i:05036.
Kotzig, Anton (1979) “1-factorizations of Cartesian products of regular graphs.” J. Graph Theory 3, no. 1, 23–34. MR 80c:05115.
Kotzig, Anton (1981) “Decompositions of complete graphs into isomorphic cubes.” J. Combin. Theory Ser. B 31, no. 3, 292–296. MR 83b:05103.
Kou, L.T.; Stockmeyer, L.J.; Wong, C.K. (1978) “Covering edges by cliques with regard to keyword conflicts and intersection graphs.” Comms. of the ACM, 21, 135–139.
Koubek, Vaclav (1977) “Graphs with given subgraphs represent all categories.” Comment. Math. Univ. Carolinae 18, no. 1, 115–127. MR 56.2 15484.
Koubek, V.; Rodl, V. (1981) “On number of covering arcs in orderings.” Comment. Math. Univ. Carolin. 22, no. 4, 721–733. MR 83g:05063.
Kovalev, M.M . (1980) “The partial-order method.” (Russian. English summary), Dokl. Akad. Nauk BSSR 24, no. 2, 113–116, 188. MR 82b:05050.
Kozyrev, V.P . (1972) “Graph theory.” (Russian), Probability theory. Mathematical statistics. Theoretical cybernetics, Vol. 10 (Russian), pp. 25–74, 144. (errata insert) Akad. Nauk SSSR Vsesojuz. Inst. Naucn. i Tehn. Informacii, Moscow. MR 52.1 2896.
Kratko, M.I . (1970) “Informational graphs.” (Russian), Sibirsk. Mat. Z. 11, 1093–1097, 1197. MR 44.1 2667.
Kratko, M.I . (1977) “A remark on an upper bound of the degree of information graphs.” (Russian), Sibirsk. Mat. Z. 18, no. 5, 1192–1193, 1208. MR 57.1 5822.
Kravcov, S.S . (1972) “Certain topological properties of the functions of the algebra of logic.” (Russian), Diskret. Analiz No. 21, 10–25, 95. MR 49.2 8871.
Krepl, Roman (1975) “On the existence of 3-webs without transversals.” (Czech. English and Russian summaries), Kniznice Odborn. Ved. Spisu Vysoke. Uceni Tech. v Brne B-56, 75–78. MR 53.1 5798.
Kreweras, G. (1972) “Sur les partitions non croisees d’un cycle.” Discrete Math. 1, no. 4, 333–350. MR 46.2 8852.
Kreweras, G . (1975) “Denombrements relatifs a une definition combinatoire fie la continuite sur un graphe.” (English summary), Math. Sci. Humaines No. 51, 13–24, 85. MR 53.2 7854.
Kreweras, G. (1976) “Les preordres totaux compatibles avec un ordre partiel.” Math. Sci. Humaines No. 53, 5–30. MR 54.2 10089.
Kreweras, G . (1979) “Sur les extensions lineaires d’une famille particuliere d’ordres partiels.” (English summary), Discrete Math. 27, no. 3, 279–295. MR 80k:05009.
Krishnamurthy, V. (1966) “On the number of topologies on a finite set.” Amer. Math. Monthly 73, 154–157. MR 34.1 1208.
Krishnamoorthy, V.; Partnasarathy, K.R. (1975) “Cospectral graphs and digraphs with given automorphism group.” J. Combinatorial Theory Ser. B 19, no. 3, 204–213. MR 53.1 2735.
Krishnamurthy, V. (1977) “On the enumeration of homeomorphism classes of finite topologies.” J. Austral. Math. Soc. Ser. A 24, no. 3, 320–338. MR 58 #16352.
Krivka, P. (1971) “On homomorphism perfect graphs.” Comment. Math. Univ. Carolinae 12, 619–626. MR 45.1 117.
Krol, M.J. (1974) “The chromatic number of some 2-connected graphs.” Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague), pp. 335–340. Academia, Prague, 1975. MR 53.1 5354.
Krusenstjerna-Hofstrom, U.; Toft, B. (1980) “Some remarks on Hadwiger’s conjecture and its relation to a conjecture of Lovasz.” The theory and applications of graphs (Kalamazoo, Mich.), pp. 449–459, Wiley, New York, 1981. MR 83b:05064.
Kruskal, Joseph B.; Posner, Edward C. (Editors) (1967) “Studies in applied mathematics. 4: Studies in combinatorics.” A collection of papers presented by invitation at the Symposium on combinatorial Mathematics sponsored by the Office of Naval Research at the Fall Meeting of SIAM at the Univ. of California at Santa Barbara, Calif., November 29–December 2, 1967. Society for Industrial and Applied Mathematics, Philadelphia, Pa., 1970. v+137 pp. MR 49.1 4784.
Kuhn, Harold W. (1968) “Approximate search for fixed points.” Computing Methods in Optimization Problems, 2 (Proc. Conf., San Remo), pp. 199–211. Academic Press, New York, 1969. MR 41.2 7826.
Kuksa, A.I . (1970) “Scheduling on graphs, and independent sets of graphs.” (Russian. English summary insert), Kibernetika (Kiev), no. 4, 92–95. MR 44.2 6550.
Kulli, V.R.; Akka, D.G. (1976) “Forbidden subgraphs for minimally nonouterplanar line graphs.” J. Karnatak Univ. Sci. 21, 94–102. MR 58 #5404.
Kulli, V.R.; Akka, D.G. (1977) “Forbidden subgraphs in planar repeated line graphs.” J. Karnatak Univ. Sci. 22, 1–4. MR 81a:05114.
Kulli, V.R.; Patil, H.P. (1978) “Graph equations for line graphs, middle graphs and entire graphs.” J. Karnatak Univ. Sci. 23, 25–28. MR 82b:05105.
Kulli, V.R.; Patil, H.P. (1976) “Critical graphs of k-minimally nonouterplanar graphs.” Proceedings of the Symposium on Graph Theory (Indian Statist. Inst., Calcutta), pp. 221–226. ISI Lecture Notes, 4, Macmillan of India, New Delhi, 1979. MR 80m:05026.
Kulli, V.R.; Akka, D.G.; Beineke, L.W. (1979) “On line graphs with crossing number 1.” J. Graph Theory 3, no. 1, 87–93. MR 80c:05066.
Kulli, V.R.; Akka, D.G. (1981) “On outerplanar repeated line graphs.” Indian J. Pure Appl. Math. 12, no. 2, 195–199. MR 82g:05044.
Kundu, Sukhamay; Lawler, Eugene L. (1973) “A matroid generalization of a theorem of Mendelsohn and Dulmage.” Discrete Math. 4, 159–163. MR 47.1 57.
Kunze, M.; Thierrin, G. (1981) “Maximal common subsequences of pairs of strings.” Proceedings of the Eleventh Manitoba Conference on Numerical Mathematics and Computing (Winnipeg, Man.), congr. Numer. 34 (1982), 299–311. MR 83m:05022.
Kuratowski, Kazimierz (1973) “My personal recollections connected with the research on some topological problems.” (Italian summary), Colloquio Internazionale sulle Teorie Combinatorie (Roma), Tomo I, pp. 43–47. Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome, 1976. MR 55.1 5357.
Kurepa, Djuro [Kurepa, Duro] (1968) “On some functions. Toplogical spaces, graphs ...” (Italian summary), Rend. Sem. Mat. Fis. Milano 38, 41–51. MR 39.1 2114.
(1979)“Graphs and combinatorics. III.” Proceedings of a Symposium held at the Research Institute for Mathematical Sciences, Kyoto University, Kyoto, December 24–25, 1979. Surikaisekikenkyusho Kokyuroku No. 397 Kyoto University, Research Institute for Mathematical Sciences, Kyoto, 1980, pp. i–ii and 1–248.
(1982)“Graph theory and its applications.” Proceedings of a Symposium held at the Research Institute for Mathematical Sciences, Kyoto University, Kyoto, July 19–21, 1982. Surikaisekikenkyusho Kokyuroku No. 471 (1982). Kyoto University, Research Institute for Mathematical Sciences, Kyoto, 1982, pp. i–iii and 1–258.
Labarthe, J.-J. (1980) “Graphical method for computing the determinant and inverse of a matrix. II. Generating functions for the [anbn00…]00…] representation matrices of SU(n).” J. Phys. A 13, no. 9, 2875–2880. MR 83e:05097.
Laborde, Jean-Marie (1979) “A propos d’un probleme d’algebre de Boole.” (English summary), Combinatorics 79 (Proc. Colloq., Univ. Montreal, Montreal, Que.), Part I. Ann. Discrete Math. 8 (1980), 127–128. MR 81k:05066.
Lafon, Monique (1972) “Geometries combinatories finies.” Ann. Inst. H. Poincare Sect. B (N.S.) 8, 307–317 MR 50.1 1934.
Lafon, Auge (1960) “Construction d’une geometrie projective finie sur une algebre.” J. Math. Pures Appl. (9) 39, 197–200. MR 22.2 9453.
Lagarias, J.C. (1977) “Discrete balancing games.” Bull. Inst. Math. Acad. Sinica 5, no. 2, 363–373. MR 57.1 155.
Lam, C.W.H.; van Lint, J.H. (1978) “Directed graphs with unique paths of fixed length.” J. Combinatorial Theory Ser. B 24, no. 3, 331–337. MR 58 #5344.
Lambin, N.V . (1969) “Antisymmetric partial graphs of a mixed or symmetric graph.” (Russian), Dokl. Akad. Nauk BSSR 13, 22. MR 40.2 4169.
Lambin, N.V.; Tanaev, V.S. (1970) “The contour-free orientation of composite graphs.” (Russian), Dokl. Akad. Nauk BSSR 14, 780–781. MR 43.1 3149.
Lambin, N.V . (1971) “The local minima of the critical path on the set of orientations of an undirected unigraph.” (Russian), Computer science in mechanical engineering (Russian), pp. 3–9. Akad. Nauk Beloruss. SSR Inst. Tehn. Kibernet., Minsk, (1972). MR 50.2 12806.
Lamprey, Roger; Barnes, Bruce [Barnes, Bruce H.] (1979) “Primitivity of products of digraphs.” Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., boca Raton, Fla.), pp. 637–644, Congress. Numer., XXIII–XXIV, Utilitas Math., Winnipeg, Man. MR 8le:05077.
Lamprey, R.H.; Barnes, B.H. (1981) “A new concept of primeness in graphs.” Networks 11, no. 3, 279–284. MR 83h:05073.
Landauer, Christopher (1975) “Triangulations and frieze patterns.” J. Geometry 6, no. 2, 155–183. MR 52.1 5551.
Lang, Rainer (1967) “Bibliographie.” Beitrage zur Graphentheorie (Kolloquium, Manebach), pp. 231–394. Teubner, Leipzig, 1968. MR 39.1 2644.
Laskar, Renu (1974) “Finite nets of dimension three. I.” J. Algebra 32, 8–25. MR 50.1 1935.
Laskar, Renu; Dunbar, Jean (1978) “Partial geometry of dimension three.” J. Combinatorial Theory Ser. A 24, no. 2, 187–201. MR 57.1 5792.
Laskar, R . (1976) “Decomposition of some composite graphs into Hamilton cycles.” Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely), Vol. II, pp. 705–716, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 81g:05078.
Las Vergnas, Michel (1970) “Sur la dualite en theorie des matroides.” C.R. Acad. Sci. Paris Ser. A-B 270, A804–A806. MR 42.2 7537.
Las Vergnas, Michel (1970) “Sur un theoreme de Rado.” C.R. Acad. Sci. Paris Ser. A-B 270, A733–A735. MR 42.1 2963.
Las Vergnas, Michel (1970) “Sur les systemes de representants distincts d’une familie d’ensembles.” C.R. Acad. Sci. Paris Ser. A-B 270, A501–A503. MR 42.1 1663.
Las Vergnas, Michel (1973) “Sur les circuits dans les sommes completees de graphes orientes.” Colloque sur la Theorie des Graphes (Bruxelles). Cahiers Centre Etudes Recherche Oper. 15, 231–244. MR 50.1 172.
Las Vergnas, Michel (1975) “Sur les extensions principales d’un matroide.” C.R. Acad. Sci. Paris Ser. A-B 280, A187–A190. MR 51.1 5347.
Las Vergnas, Michel (1975) “Matroides orientables.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 280, Ai, A61–A64. MR 51.1 7910.
Las Vergnas, Michel (1974) “Sur le nombre de circuits dans un tournoi fortement connexe.” Colloque sur la Theorie des Graphes (Paris). Cahiers Centre Etudes Recherche Oper. 17, no. 2–3–4, 261–265. MR 53.1 2734.
Las Vergnas, Michel (1976) “Sur les arborescences dans un graphe oriente.” (English summary), Discrete Math. 15, no. 1,27–39. MR 54.2 7300.
Las Vergnas, Michel (1975) “Extensions normales d’un matroide, polynome de Tutte d’un morphisme.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 280, no. 22, Ai, A1479–A1482. MR 54.2 7295.
Las Vergnas, Michel (1975) “On certain constructions for matroids.” Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen), pp. 395–404. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976. MR 54.1 5018.
Las Vergnas, M . (1973) “Degree-constrained subgraphs and matroid theory.” Infinite and finite sets (Colloq., Keszthely), Vol. III, pp. 1473–1502. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR 56.1 5365.
Las Vergnas, Michel (1977/78) “Acyclic and totally cyclic orientations of combinatorial geometries.” Discrete Math. 20, no. 1, 51–61. MR 57.1 2957.
Las Vergnas, Michel (1978) “Sur les activites des orientations d’une geometrie combinatoire.” Colloque Mathematiques Discretes: Codes et Hypergraphes (Brussels). Cahiers Centre Etudes Rech. Oper. 20, no. 3–4, 293–300. MR 81d:05019.
Las Vergnas, Michel (1981) “On products of matroids.” Discrete Math$136, no$11, 49–55. MR 83k: 05035.
Lauchli, H. (1971) “Coloring infinite graphs and the Boolean prime ideal theorem.” Israel J. Math. 9, 422–429. MR 44.2 5249.
Lavallee, Ivan (1978) “Rectangles maximaux dans une relation binaire quelconque.” Third Symposium on Operations Research (Univ. Mannheim, Mannheim), Section 2, pp. 157–171, Operations Research Verfahren, 32, Hain, Meisenheim, 1979. MR 81i:05077.
Lawler, Eugene L. (1975) “Matroid intersection algorithms.” Math. Programming 9, no. 1, 31–56. MR 51.2 12581.
Lawrence, Jim; Weinberg, Louis (1979) “Unions of oriented matroids.” Combinatorics 79 (Proc. Colloq., Univ. Montreal, Montreal, Que.), Part I. Ann. Discrete Math. 8 (1980), 29–34. MR 82a:05040.
Leclerc, Bruno (1977) “Hypergraphes uniformes preordonnes et arbres minimaux d’un graphe.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 284, no. 1, A5–A7. MR 55.2 12576.
Leclerc, Bruno (1978) “Matroides sur un ensemble preordonne. Bases minimales, circuits et cocircuits, parties commencantes.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 286, no. 6, A301–A304. MR 57 #12271.
Leclerc, Bruno (1981) “Description combinatoire des ultrametriques.” (English summary), Math. Sci. Humaines No. 73, 5–37, 127. MR 82m:05083.
Lee, P.A. (1977) “On the number of surjective functions and some combinatorial identities.” Bull. Malaysian Math. Soc. 8, no. 1, 35–44. MR 57.1 130.
Lee, Tony T. (1981) “Order-preserving representations of the partitions on the finite set.” J. Combin. Theory Ser. A 31, no. 2, 136–145. MR 83c:05011.
Leeb, K . (1973) “A full Ramsey-theorem for the Deuber-category.” Infinite and finite sets (Colloq., Keszthely), Vol. II, pp. 1043–1049. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR 51.1 7886.
Leeb, Klaus (1978) “Some remarks on this “n” that.” (Italian summary), Noncommutative structures in algebra and geometric combinatorics (Naples), pp. 111–114, Quad. “Ricerca Sci.”, 109, CNR, Rome, 1981. MR 83e:05021.
Lehel, Jeno (1981) “Generating all 4-regular planar graphs from the graph of the octahedron.” J. Graph Theory 5, no. 4, 423–426. MR 83c:05052.
Leifman, L. Ja.; Petrova, L.T. (1964) “Some algorithms for analyzing oriented graphs.” (Russian), Vycisl. Sistemy No. 11, 101–113. MR 29.1 2793.
Leiss, Ernst (1979) “A note on infinite graphs with actions.” Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 667–678, Congress. Numer., XXIII–XXIV, Utilitas Math., Winnipeg, Man. MR 81g:05062.
Lekain, Richard B.; Wallis, Jennifer Seberry (1974) “On the matrices used to construct Baumert-Hall arrays.” Combinatorial mathematics, III (Proc. Third Australian Conf., Univ. Queensland, St. Lucia), pp. 156–170. Lecture Notes in Math., Vol. 452, Springer, Berlin, 1975. MR 51.1 7906.
Lekkerkerker, C.B.; Boland, J. Ch. (1962) “Representation of a finite graph by a set of intervals on the real line.” Fund. Math., 51, 45–64.
Lempel, A.; Cederbaum, I. (1966) “Minimum feedback arc and vertex sets of a directed graph.” IEEE Trans. Circuit Theory CT-13, 399–403. MR 39.2 5423.
Lempel, A. (1968) “A note on orientation of graphs.” Amer. Math. Monthly 75, 865–867. MR 38.2 3168.
Lenormand, C.; Perrot, J.F. (1970) “Note sur le theoreme des demi-degres.” (Loose English summary), Rev. Francaise Informat. Recherche Operationnelle 4, Ser. R-2, 29–31. MR 42.2 7560.
Lenstra, H.W., Jr . (1973) “The acyclic subgraph problem.” Mathematisch Centrum, Afdeling Mathematische Besliskunde, BW 26/73. Mathematisch Centrum, Amsterdam, iv+45 pp. MR 53.2 7848.
Lenstra, J.K.; Rinnooy Kan, A.H.G. (1976) “On general routing problems.” Networks 6, no. 3, 273–280. MR 55.1 5192.
Lepesinskii, N.A.; Malysko, V.V. (1976) “Arc graphs, and the determination of elementary paths between pairs of vertices of a graph.” (Russian), Vesci Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk, no. 1, 5–8, 138.
Leron, Uri; Moran, Gadi (1979) “The full cycles in a Young coset.” J. Combin. Theory Ser. A 27, no. 2, 218–221. MR 81h:05077.
Lesniak, Linda M. [Lesniak-Foster, Linda]; Polimeni, Albert D.; Roberts, John (1976) “Asymmetric digraphs and degree sets.” Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory, and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 421–432. Congressus Numerantium, No. XVII, Utilitas Math., Winnipeg, Man. MR 56.2 15482.
Lesniak-Foster, Linda (1977) “On n-Hamiltonian line graphs.” J. Combinatorial Theory Ser. B 22, no. 3,263–273. MR 58 #5406.
Lesniak-Foster, L.; Williamson, James E. (1977) “On spanning and dominating circuits in graphs.” Canad. Math. Bull. 20, no. 2, 215–220. MR 57.1 2995.
Lesniak-Foster, Linda M. (1978) “On n-distant Hamiltonian line graphs.” Aequationes Math. 17, no. 2–3, 141–147. MR 58 #10597.
Levi, G. (1972) “A note on the derivation of maximal common subgraphs of two directed or undirected graphs.” Calcolo 9, 341–352 (1973). MR 49.2 11804.
Levi, G . (1974) “Graph isomorphism: a heuristic edge-partitioning-oriented algorithm.” (German summary), Computing (Arch. Elektron. Rechnen) 12, no. 4, 291–313. MR 54.1 2543.
Levinson, H.W. (1972) “On the genera of graphs of group presentations. III.” J. Combinatorial Theory Ser. B 13, 298–302. MR 47.2 6528.
Lewin, Mordechai (1973) “A note on line coverings of graphs.” Discrete Math. 5, 283–285. MR 51.1 5411.
Lewin, Mordechai (1974) “Matching-perfect and cover-perfect graphs.” Israel J. Math. 18, 345–347. MR 51.1 2997.
Lewin, Mordechai (1980) “On critical sets of edges in graphs.” Combinatorial mathematics, VIII (Geelong), pp. 269–271, Lecture Notes in Math., 884, Springer, Berlin-New York, 1981. MR 83i:05045.
Lewis, D.C. (1972) “A generalized Mobius inversion formula.” Bull. Amer. Math. Soc. 78, 558–561. MR 45.2 8533.
Li, Sok Hui [Li, Sok Hiu] (1976) “On a formula for the calculation of the total root-tree of a directed graph.” (Korean. English summary), Su-hak kwa Mul-li 20, no. 1, 14–18. MR 58 #5345.
Li, Sok Hui (1978) “On realization of a graph by trees.” (Korean. English summary), Cho-son In-min Kong-hwa-kuk Kwa-hak-won T’ong-bo 26, no. 5, 257–259. MR 80e:05056.
Liebeck, Hans (1975) “Digraphs and the construction of groups with specified automorphism group.” Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen), pp. 405–410. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976. MR 53.1 2736.
Liggett, Thomas M. (1977) “Extensions of the Erdos-Ko-Rado theorem and a statistical application.” J. Combinatorial Theory Ser. A 23, no. 1, 15–21. MR 56.1 145.
Lim, Chong Keang (1978) “Supercompact graphs.” Southeast Asian Bull. Math. 2, no. 1, 57. MR 81a:05115.
Lim, Chong Keang (1979) “Graphical regular representations of groups: a survey.” Proceedings of the First Franco-Southeast Asian Mathematical Conference (Singapore), Vol. II. Southeast Asian Bull. Math., Special Issue b, 288–294. MR 81h:05078.
Lim, Chong Keang; Peng, Yee Hock (1981) “On graphs without multicliqual edges.” J. Graph Theory 5, no. 4, 443–451. MR 83a:05120.
Lin, P.M . (1967) “Graphs with degeneracy in basic circuit matrices.” Proc. Fifth Annual Allerton Conf. on Circuit and System Theory (Monticello, 111.), pp. 627–634. Univ. of Illinois, Urbana, 111. MR 41.2 8156.
Lin, Y.-F.; Ratti, J.S. (1970) “The graphs of semirings.” J. Algebra 14, 73–82. MR 42.1 3128.
Lindner, Charles C. (1971) “Construction of quasigroups using the singular direct product.” Proc. Amer. Math. Soc. 29, 263–266. MR 43.2 6354.
Lindstrom, Bernt (1969) “Determinants on semilattices.” Proc. Amer. Math. Soc. 20, 207–208. MR 39.1 102.
Lindstrom, Bernt (1971) “On Mobius functions and a problem in combinatorial number theory.” Canad. Math. Bull. 14, 513–516. MR 47.2 4916.
Lindstrom, Bernt (1973) “On the vector representations of induced matroids.” Bull. London Math. soc. 5, 85–90. MR 49.1 95.
Linial, Nathan (1978) “Covering digraphs by paths.” Discrete Math. 23, no. 3, 257–272. MR 80f:05046.
Linial, Nathan (1981) “Extending the Greene-Kleitman theorem to directed graphs.” J. Combin. Theory Ser. A 30, no. 3, 331–334. MR 82h:05026.
Lins, Sostenes (1982) “Graph-encoded maps.” J. Combin. Theory Ser. B 32, no. 2, 171–181. MR 83e:05049.
Linskiy, V.S. [Linskii, V.S.]; Kornev, M.D. (1972) “Construction of optimum schedules for parallel processors.” Izv. Akad. Nauk SSR Tehn. Kibernet., no. 3, 166–167 (Russian); translated as Engrg. Cybernetics 10, no. 3, 506–514. MR 49.1 6673.
Liouville, Bernard (1978) “Sur la connectivite des produits de graphes.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 286, no. 8, A363–A365. MR 58 #383.
Liouville, Bernard (1981) “Problemes hamiltoniens et somme de graphes.” (English summary), [Hamiltonian problems and the sum of graphs], Rev. Roumaine Math. Pures Appl. 26, no. 1, 79–88. MR 83c:05086.
Lipski, Witold, Jr.; Nakano, Takeo (1976/77) “A note on the consecutive l’s property (infinite case).” Comment. Math. Univ. St. Paul. 25, no. 2, 149–152. MR 55.2 12531.
Lipski, W . (1981) “The consecutive retrieval property, interval graphs, and related topics-a survey.” in T. Kambayashi (ed.), Proceedings of the Conference on Consecutive Retrieval Property, Report 438, Institute of Computer Science, Polish Academy of Sciences, Warsaw, 110–141.
Liskovec, V.A.; Feinberg, V.Z. (1968) “The order of the centralizer of a transformation.” (Russian), Dokl. Akad. Nauk BSSR 12, 596–598. MR 38.2 5905.
Liskovec, V.A . (1969) “Enumeration of rooted digraphs with a source.” (Russian), Vesci Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk, no. 5, 23–32. MR 44.2 3927.
Liskovec, V.A . (1970) “The number of strongly connected oriented graphs.” (Russian), Mat. Zametki 8, 721–732. MR 43.1 1890.
Liskovec, V.A . (1971) “The number of initially connected digraphs.” (Russian), Dokl. Akad. Nauk BSSR 15, 293–294. MR 45.1 1802.
Liskovec, V.A . (1971) “The number of Eulerian digraphs and homogeneous tournaments.” (Russian), Vesci Akad. Navuk BSSR Ser. Fiz.-Mat. Navuj, no. 1, 22–27. MR 44.2 6551.
Liskovec, V.A . (1973) “Enumeration of rooted digraphs with a source. II. The Redfie1d-Robinson Method.” (Russian), Vesci Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk, no. 3, 35–44, 136. MR 50.1 180.
Liskovec, V.A . (1973) “On the enumeration of strongly connected directed graphs.” (Russian), Dokl. Akad. Nauk BSSR 17, 1077–1080, 1163. MR 49.1 4849.
Liskovec, V.A . (1975) “The number of maximal vertices of a random acyclic digraph.” (Russian. English summary), Teor. Verojatnost. i Primenen. 20, no. 2, 412–421. MR 52.1 1822.
Liskovets, V.A . (1978) “A census of nonisomorphic planar maps.” Algebraic methods in graph theory, Vol. I, II (Szeged), pp. 479–494, Colloq. Math. Soc. Janos Bolyai, 25, North-Holland, Amsterdam, 1981. MR 83a:05073.
Little, Charles H.C. (1973) “Kasteleyn’s theorem and arbitrary graphs.” Canad. J. Math. 25, 758–864. MR 48.1 5923.
Little, Charles H.C . (1973) “An extension of Kasteleyn’s method of enumerating the 1-factors of planar graphs.” Combinatorial mathematics (Proc. Second Australian Conf., Univ. Melbourne, Melbourne), pp. 63–72. Lecture Notes in Math., Vol. 403, Springer, Berlin, 1974. MR 52.1 2950.
Little, Charles H.C . (1974) “A conjecture about circuits in planar graphs.” Combinatorial mathematics, III (Proc. Third Australian Conf., Univ. Queensland, St. Lucia), pp. 171–175. Lecture Notes in Math., Vol. 452, Springer, Berlin, 1975. MR 52.1 2954.
Little, C.H.C.; Holton, D.A. (1976) “A new characterization of planar graphs.” Bull. Amer. Math. Soc. 83, no. 1, 137–138 (1977). MR 56.1 170.
Little, Charles H.C. (1976) “On the number of parity sets in a graph.” Canad. J. Math. 28, no. 6, 1167–1171. MR 55.1 2644.
Little, C.H.C . (Editor) (1976) “Combinatorial mathematics. V.” Proceedings of the Fifth Australian Conference, held at the Royal Melbourne Institute of Technology, Melbourne, August 24–26, 1976. Lecture Notes in Mathematics, Vol. 622. Springer-Verlag, Berlin-New York, 1977. vi+213 pp. MR 56.2 8372.
Little, Charles H.C. (1980) “A characterization of planar cubic graphs.” J. Combin. Theory Ser. B 29, no. 2, 185–194. MR 81k:05045.
Little, C.H.C.; Holton, D.A. (1982) “Rings of bonds in graphs.” J. Combin. Theory Ser. B 33, no. 1, 1–6. MR 83m:05084.
Liu, Yan Pei (1981) “The maximum orientable genus of some kinds of graphs.” (Chinese), Acta Math. Sinica 24, no. 6, 817–832. MR 83j:05033.
Liu, Zhen Hong; Ma, Zhong Fan; Zhu, Yong Jin; Cai, Mao Cheng (1980) “Minimum spanning trees with degree constraints.” (Chinese), Acta Math. Appl. Sinica 3, no. 1, 1–12. MR 82a:05045.
Ljubcenko, G.G . (1978) “Isomorphy of graphs.” (Russian), Theoretical and applied questions of differential equations and algebra (Russian), pp. 165–169, 267, “Naukova Dumka”, Kiev. MR 82c:05078.
Locke, S.C. (1982) “Maximum k-colorable subgraphs.” J. Graph Theory 6, no. 2, 123–132. MR 83i:05046.
Lomonosov, M.V.; Polesskii, V.P. (1972) “A lower bound for the reliability of networks.” (Russian), Problemy Peredaci Informacii 8, vyp. 2, 47–53. MR 48.1 1812.
Lorea, M . (1974) “Hypergraphes et matroides.” Colloque sur la Theorie des Graphes (Paris). Cahiers Centre Etudes Recherche Oper. 17, no. 2-3-4, 289–291. MR 53.2 7829.
Lorenc, A.A . [Lorencs, A.] (1965) “The simplification of quasi-monotone functions.” (Russian), Avtomat. i Vycisl. Tehn. 11, 29–42. MR 40.1 1291.
Lorenc, A.A.; Sranka, R.K. (1966) “Certain questions of extension of an incompletely defined function to a quasi-monotone function.” (Russian), Avtomat. i Vycisl. Tehn. 15, 31–41. MR 40.1 1292.
Lorigny, Jacques (1974) “Lougueur de cheminement de graphes d’ entree-sortie.” C.R. Acad. Sci. Paris Ser. A 279, 351–354. MR 52.2 10484.
Lorimer, Peter (1973) “Finite projective planes and sharply 2-transitive subsets of finite groups.” Proceedings of the Second International Conference on the Theory of Groups (Australian Nat. Univ., Canberra), pp. 432–436. Lecture Notes in Math., Vol. 372, Springer, Berlin, 1974. MR 50.2 13216.
Lossers, O.P.; van Lint, J.H.; Nuij, W. (1974) “Finitely generated bijections of {0,1}Z.” T.H.-Report 74-WSK-01. Department of Mathematics, Technological University, Eindhoven, ii+9 pp. MR 50.1 173.
Lovasz, L . (1966) “On covering of graphs.” in P. Erdos and G. Katona (eds.), Proceedings of the Colloquium held at Tihany, Hungary Academic Press, New York, 1968, 231–236.
Lovasz, L. (1972) “A characterization of perfect graphs.” J. Combinatorial Theory Ser. B 13, 95–98. MR 46.2 8885.
Lovasz, Laszlo (1971) “A brief survey of matroid theory.” (Hungarian), Mat. Lapok 22, 249–267 (1972). MR 49.1 4815.
Lovasz, L. (1973) “Connectivity in digraphs.” J. Combinatorial Theory Ser. B 15, 174–177. MR 48.1 3786.
Lovasz, L . (1972) “Minimax theorems for hypergraphs.” Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ.,. Columbus, Ohio), pp. 111–126. Lecture Notes in Math., Vol. 411, Springer, Berlin, 1974. MR 53.2 10648.
Lovasz, L.; Plummer, M.D. (1977) “On minimal elementary bipartite graphs.” J. Combinatorial Theory Ser. B 23, no. 1, 127–138. MR 58 #16402.
Lovasz, L . (1977) “Flats in matroids and geometric graphs.” Combinatorial surveys (Proc. Sixth British Combinatorial Conf., Royal Holloway Coll., Egham), pp. 45–86. Academic Press,London. MR 58 #310.
Lovasz, L.; Sos, Vera T. (Editors) (1978) “Algebraic methods in graph theory. Vol. I, II.” Papers from the Conference held in Szeged, August 24–31, 1978. Colloquia Mathematica Societatis Janos Bolyai, 25. North-Holland Publishing Co., Amsterdam-New York, 1981. 847 pp. MR 82k:05002.
Lovasz, L.; Nesetril, J.; Pultr, A. (1980) “On a product dimension of graphs.” J. Combin. Theory Ser. B 29, no. 1, 47–67. MR 82b:05085.
Lozanov, Cavdar G. (1974) “Minimal systems of axioms that define a finite projective plane.” (Bulgarian. Russian and English summaries), B″lgar. Akad. Nauk. Izv. Mat. Inst. 15, 63–70. MR 52.1 2923.
Lozovanu, D.D . (1978) “The problem of finding the diameter, radius and center of a doubly-connected directed tree.” (Russian), Bui. Akad. Stiince RSS Moldoven., no. 3, 23–27, 93. MR 80b:05023.
Lozovanu, D.D. (1981) “Optimal subgraphs in a weighted digraph.” Kibernetika (Kiev), no$12, i, 16–19, 149 (Russian. English summary); translated as Cybernetics 17, no. 2, 172–176. MR 82k:05055.
Lovasz, Laszlo (1977) “Topological and algebraic methods in graph theory.” Graph theory and related topics (Proc. Conf., Univ. Waterloo, Waterloo, Ont.), pp. 1–14, Academic Press, New York, 1979. MR 81b:05096.
Lubell, David (1975) “Local matching in the function space of a partial order.” J. Combinatorial Theory Ser. A 19, no. 2, 154–159. MR 51.2 12553.
Lucas, Dean (1975) “Weak maps of combinatorial geometries.” Trans. Amer. Math. Soc. 206, 247–279. MR 51.1 7911.
Lucchesi, C.L.; Younger, D.H. (1978) “A minimax theorem for directed graphs.” J. London Math. Soc. (2) 17, no. 3, 369–374. MR 80e:05062.
Ludwigs, Helmut J . (1980) “Properties of ordered graph grammars.” Graph-theoretic concepts in computer science (Proc. Sixth Internat. Workshop, Bad Honnef), pp. 70–79, Lecture Notes in Comput. Sci., 100, Springer, Berlin, 1981. MR 82h:05044.
Lukin, V.F.; Zabalockii, V.N. (1975) “A generalized algorithm for the numeration of permutations and combinations.” (Russian), Coding theory and information modeling, No. 2 (Russian), pp. 210–216, 250. Izdat. “Nauka” Kazah. SSR, Alma-Ata. MR 57 #16094.
Lundina, D.S . (1966) “A stronger form of Rado’s theorem.” (Russian), Sibirsk. Mat. Z 7, 718–819. MR 33.1 2568.
Lundgren, J.R.; Maybee, J.S. (1983) “A characterization of graphs of competition number m.” Discrete Applied Math., 6, in press.
Luneburg, Heinz (1971) “Kombinatorik.” Elemente der Mathematik vom hoheren Standpunktaus, Band VI. Birkhauser Verlag, Basel-Stuttgart. 108 pp. MR 49.1 49.
Lunnon, Fred (1969) “The IU function: The size of a free distributive lattice.” Combinatorial Mathematics and its Applications (Proc. Conf., Oxford), pp. 173–181. Academic Press, London, 1971. MR 43.2 4689.
Lyle, Bill (1978) “A linear-algebra problem from algebraic coding theory.” Linear Algebra Appl. 22, 223–233. MR 80a:05013.
Ma, Chung Fan [Ma, Zhong Fan]; Cai, Mao Cheng (1982) “The maximum number of arc-disjoint arborescences in a tournament.” J. Graph Theory 6, no. 3, 295–302. MR 83i:05035.
Maas, C. (1983) “Some results about the interval number of a graph.” Discrete Applied Math., 6, 99–102.
Mader, W . (1972) “Wohlquasigeordnete Klassen endlicher Graphen.” (English summary), J. Combinatorial Theory Ser. B 12, 105–122. MR 45.2 6665.
Mader, W. (1979) “Eine Reduktionsmethode fur den Kantenzusammenhang in Graphen.” Math. Nachr. 93, 187–204. MR 81m:05093.
Mader, W. (1981) “On a property of n-edge-connected digraphs.” Combinatorica 1, no. 4, 385–386. MR 83f:05025.
Mader, W . (1982) “Konstruktion aller n-fach kantenzusammenhangenden Digraphen.” (English summary) [Construction of all n-fold edge-connected digraphs], European J. Combin. 3, no. 1, 63–67. MR 83g:05045.
Maehara, H . (1983) “Space graphs and sphericity.” Discrete Math., to appear.
Maghout, Khaled (1959) “Sur la determination des nombres de stabilite et due nombre chromatique d’un graphe.” C.R. Acad. Sci. Paris 248, 3522–3523. MR 21.2 4115.
Magrupov, T.M . (1976) “A new approach to the construction of a minimal tree.” (Russian), Voprosy Kibernet. (Tashkent) Vyp. 85, 3–12, 113. MR 57.1 2923.
Maheo, Maryvonne (1980) “Strongly graceful graphs.” Discrete Math. 29, no. 1, 39–46. MR 82j:05093.
Mahmoodian, Ebadollah S . (1978) “A critical case method of proof in combinatorial mathematics.” Bull. Iranian Math. Soc. No. 8, 1L–26L. MR 80d:05046.
Mahnke, Heide (1972) “The necessity of non-Abelian groups in the case 0 of the Heawood map–coloring theorem.” J. Combinatorial Theory Ser. B 13, 263–265. MR 48.1 141.
Makowski, Andrzej (1965) “Remark on results of Gilbert, Miheev and Sperner.” Mat. Vesnik 2 (17), 211–212. MR 35.2 5327.
Maksimenko, Ju. F . (1964) “Some topological methods of studying linear structures.” (Russian), Izv.Akad. Nauk SSSR Tehn. Kibernet., no. 2, 102–113. MR 31.1 1768.
Malle, Gunther (1980) “Edge orientations on cubic graphs with a maximum number of pairs of oppositely oriented edges.” Discrete Math. 31, no. 3, 293–296. MR 811:05117.
Malle, Gunther (1982) “On maximum bipartite subgraphs.” J. Graph Theory 6, no. 2, 105–113. MR 831:05047.
Malysko, V.V . (1976) “Some algorithms for the analysis of directed graphs.” (Russian), Vesci Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk, no. 5, 33–36, 140. MR 58 #347.
Malysko, V.V . (1977) “A search for elementary contours using arc graphs.” (Russian), Vesci Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk, no. 2, 102–103, 143. MR 58 #348.
Malysko, V.V . (1977) “Some properties of arc graphs.” (Russian), Vestnik Beloruss. Gos. Univ. Ser. I, no. 3, 7–9, 92. MR 58 #5346.
Malyshko, V.V.; Yanchenko, S.S. (1981) “Algorithm for the optimal reconstruction of a digraph.” Kibernetika (Kiev), no. 1, 60–62, 150 (Russian); translated as Cybernetics 17, no. 1, 63–66. MR 83m:05068.
Manaster, Alfred B.; Rosenstein, Joseph G. (1972) “Effective matchmaking (recursion theoretic aspects of a theorem of Philip Hall).” Proc. London Math. Soc. (3) 25, 615–654. MR 47.1 3161.
Manca, P . (1971) “Sulla ricerca dei digrafi fortemente connessi aventi uno stesso grafo di supporto e di lunghezza generalizzata minima o massima.” (English summary), Calcolo 8, 139–147. MR 46.2 8892.
Mann, Henry (1973) “Additive group theory—a progress report.” Bull. Amer. Math. Soc. 79, 1069–1075. MR 48.1 4157.
Manvel, Bennet (1968) “On reconstruction of graphs.” The Many Facets of Graph Theory (Proc. Conf., Western Mich. Univ., Kalamazoo, Mich.), pp. 207–214. Springer, Berlin, 1969. MR 41.1 3313.
Manvel, Bennet (1968) “Reconstruction of unicyclic graphs.” Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich.), pp. 103–107. Academic Press, New York, 1969. MR 41.1 1572.
Manvel, B.; Stockmeyer, P.K.; Welsh, D.J.A. (1970) “On removing a point of a digraph.” Studia Sci. Math. Hungar. 5, 299–301. MR 44.1 2668.
Manvel, Bennet (1973) “Reconstructing the degree pair sequence of a digraph.” J. Combinatorial Theory Ser. B 15, 18–31. MR 48.1 1963.
Manvel, Bennet (1974) “Some basic observations on Kelly’s conjecture for graphs.” Discrete Math. 8, 181–185. MR 51.1 278.
Marcu, Danut (1980) “On the gradable digraphs.” An. Stiint. Univ. “Al. I. Cuza” Iasi Sect. I a Mat. (N.S.) 26, no. 1, 185–187. MR 82k:05056.
Marcu, Danut (1980) “Some remarks concerning the kernels of a strong connected digraph.” An. Stiint. Univ. “Al, I. Cuza” Iasi Sect. I a Mat. (N.S.) 26, no. 2, 417–418. MR 821:05040.
Marcu, Danut (1981) “Some results concerning the even cycles of a connected digraph.” (Romanian summary), Studia Univ. Babes-Bolyai Math. 26, no. 1, 24–28. MR 83e:05058.
Markosjan, A.G . (1971) “The internal stability number in a Cartesian product of graphs.” (Russian. Armenian summary), Akad. Nauk Armjan. SSR Dokl. 52, 14–18. MR 45. 99.
Markosjan, A.G.; Markosjan, S.E. (1977) “Algorithm for the decomposition of a digraph into a diforest.” (Russian. Armenian summary), Akad. Nauk Armjan. SSR Dokl. 65, no. 3, 129–131. MR 58 #16377.
Markosjan, S.E . (1968) “Bases of arcs of a progressively and regressively finite oriented graph.” (Russian. Armenian summary), Akad. Nauk Armjan. SSR Dokl. 46, no. 1, 3–9. MR 38.2 3169.
Markosjan, S.E . (1968) “Matrix criterion of the uniqueness of an arc basis and the determination of a certain basis.” (Russian. Armenian summary), Akad. Nauk Armjan. SSR Dokl. 46, no. 2, 60–66. MR 38.1 2058.
Markosjan, S.E . (1970) “Bases of arcs of a certain class of finite directed graphs.” (Russian. Armenian summary), Akad. Nauk Armjan. SSR Dokl. 50, 134–138. MR 44.2 6552.
Markosjan, S.E . (1975) “Perfect and critical graphs.” (Russian. Armenian summary), Akad. Nauk Armjan. SSR Dokl. 60, no. 4, 218–223. MR 53.2 10659.
Markosjan, S.E.; Karapetjan, I.A. (1976) “Perfect graphs.” (Russian. Armenian summary), Akad. Nauk Armjan. SSR Dokl. 63, no. 5, 292–296. MR 56.2 8427.
Markov, A.A . (1969) “A combinatorial characterization of finite bases of pure free semigroups.” (Russian. Loose English summary), Mat. Caspois Sloven. Akad. Vied 19, 158–165. MR 46.1 1933.
Markova, E.V . (1975) “Block designs, graphs, codes and plans of an experiment.” (Russian), Voprosy Kibernet. Vyp. 10, 4–30. MR 54.2 10040.
Markowsky, George (1973) “Some combinatorial aspects of lattice theory.” Proceedings of the University of Houston Lattice Theory Conference (Houston, Tex.), pp. 36–68. Dept. Math., Univ. Houston, Houston, Tex. MR 53.1 219.
Markowsky, George; Tarjan, Robert Endre (1976) “Lower bounds on the lengths of node sequences in directed graphs.” Discrete Math. 16, no. 4, 329–337. MR 57 #18784.
Marcus, Daniel A. (1981) “Closed factors of normal Z-semimodules.” Pacific J. Math. 93, no. 1, 121–146. MR 83a:05026.
Marcu, Danut (1976) “An algorithm for determining the strongly connected components of a finite directed graph.” (Russian. English summary), Stud. Cere. Mat. 28, no. 1, 57–60. MR 54.1 5035.
Marcu, Danut (1976) “An application of vector spaces to the calculation of the number of connected components of a finite directed graph.” (Romanian. English summary), Stud. Cere. Mat. 28, no. 2, 199–203. MR 57 #16125.
Marcu, Danut (1976) “Considerations on certain vector spaces associated with finite directed graphs.” (Romanian. English summary), Stud. Cerc. Mat. 28, no. 4, 445–464. MR 58 #5706.
Marcu, Danut (1978) “A method for finding the kernel of a digraph.” An. Univ. Bucuresti Mat. 27, 41–43. MR 80a:05102.
Marcu, Danut (1978) “Sur la connexite semi-forte d’un digraphe.” An. Stiint. Univ. “AI. I. Cuza” Iasi Sect. I a Mat. (N.S.) 24, no. 1, 173–174. MR 81a:05057.
Marcu, Danut (1979) “On certain vector spaces associated to the oriented finite graphs.” An. Stiint. Univ. “AI. I. Cuza” Iasi Sect. I a Mat. (N.S.) 25, no. 1, 175–181. MR 81e:05078.
Marcu, Danut (1979) “A method for finding the strongly connected components of a digraph.” An. Stiint. Univ. “Al. I. Cuza” Iasi Sect. I a Mat. (N.S.) 25, no. 2, 417–418. MR 81e:68083.
Marcu, Danut (1979) “A method for finding the strong components of a digraph.” (Romanian summary), Studia Univ. Babes-Bolyai Math. 24, no. 2, 22–24. MR 81h:05071.
Marcu, Danut (1981) “No tournament is tradable.” An. Univ. Bucuresti Mat. 30, 27–28. MR 83c:05069.
Marcu, Danut (1982) “On the even elementary circuits and cycles of a digraph.” (Romanian summary), Bul. Inst. Politehn. Bucuresti Ser. Chim.-Metal. 44, no. 1, 21–26. MR 83m:05069.
Marcus, Marvin (1969) “Inequalities for matrix functions of combinatorial interest.” SIAM J. Appl. Math. 17, 1023–1031. MR 41.2 5390.
Marczyk, A.; Skupien, Z. (1974) “Characterizing line graphs of general graphs.” (Russian summary), Bull. Acad. Polon. Sci. Ser. Sci. Math. Astronom. Phys. 22, 235–241. MR 49.2 7188.
Marczyk, A.; Skupien, Z. (1981) “Characterizations of different line graphs of graphs.” Combinatorial mathematics, IX (Brisbane), pp. 358–364, Lecture Notes in Math., 952, Springer, Berlin-New York, 1982. MR 83k:05094.
Markosjan, A.J . (1972) “Certain theorems on the Cartesian product of graphs.” (Russian. Armenian summary), Akad. Nauk Armjan. SSR Dokl. 54, 70–76. MR 47.1 3256.
Markosjan, S.E . (1967) “A criterion for uniqueness of the base of arcs of finite oriented graphs.” (Russian. Armenian and English summaries), Izv. Akad. Nauk Armjan. SSR Ser. Mat. 2, no. 6, 399–403. MR 36.2 5028.
Markosjan, S.E . (1969) “Some theorems on arc bases of oriented graphs.” (Russian. Armenian and English summaries), Izv. Akad. Nauk Armjan. SSR Ser. Mat. 4, no. 4, 288–295. MR 2983.
Markowsky, George (1980) “The level polynomials of the free distributive lattices.” Discrete Math. 29, no. 3, 275–285. MR 81e:05054.
Marshall, Clifford W . (1971) “Applied graph theory.” Wiley-Interscience [A division of John Wiley and Sons, Inc.], New York-London-Sydney. xiii+322 pp. MR 48.1 1951.
Martelli, Alberto (1974) “An application of regular algebra to the enumeration of cut sets in a graph.” Information processing 74 (Proc. IFIP Congress, Stockholm), pp. 511–515. North-Holland, Amsterdam. MR 54.2 12392.
Martelli, Alberto (1976) “A Gaussian elimination algorithm for the enumeration of cut sets in a graph.” J. Assoc. Comput. Mach. 23, no. 1, 58–73. MR 55.1 195.
Martin, George E. (1971) “Symmetric gobos in a finite projective plane.” J. Combinatorial Theory Ser. A 11, 201–207. MR 44.1 3192.
Martini, Giulia Barbara (1975) “Somme cartesiane di n-grafi e loro matrici associate.” Riv. Mat. Univ. Parma (4) 1, 79–87. MR 58 #16378.
Martynjuk, V.V . (1971) “Certain applications of the closure operation in the analysis of graphs.” (Russian), Z. Vycisl. Mat. i Mat. Fiz. 11, 1605–1607. MR 47.1 1663.
Martynjuk, V.V . (1973) “Transitively equivalent directed graphs.” (Russian. English summary insert), Kibernetika (Kiev), no. 1, 39–43. MR 50.1 4370.
Marusic, Dragan (1981) “On vertex symmetric digraphs.” Discrete Math. 36, no. 1, 69–81. MR 83a:05068.
Marx, Morris L. (1969) “The Gauss realizability problem.” Proc. Amer. Math. Soc. 22, 610–613. MR 39.2 6297.
Masgras, V.V . (1973) “Applications of graph theory to number theory.” (Romanian. French summary), Stud. Cere. Mat. 25, 533–545. MR 51.1 279.
Mason, J.H . (1972) “Matroids: unimodal conjectures and Motzkin’s theorem.” Combinatorics (Proc. Conf. Combinatorial Math., Math. Inst., Oxford), pp. 207–220. Inst. Math. Appl., Southend-on-Sea. MR 50.1 1939.
Mason, J.H. (1972) “On a class of matroids arising from paths in graphs.” Proc. London Math. Soc. (3) 25, 55–74. MR 47. 1 58.
Masuyama, Motosaburo (1973) “A test for graph isomorphism.” Rep. Statist. Appl. Res. Un. Japan. Sci. Engrs. 20, no. 2, 1–24. MR 47.1 58.
Masuyama, Motosaburo (1974) “A test for digraph isomorphism.” Rep. Statist. Appl. Res. Un. Japan. Sci. Engrs. 21, no. 1, 33–35. MR 51.1 244.
Masuyama, Motosaburo (1974) “On a test for isomorphism of linear graphs associated with experimental designs.” Sankhya Ser. A 36, no. 1, 53–62. MR 52.1 5468.
Mateti, Prabhaker; Deo, Narsingh (1976) “On algorithms for enumerating all circuits of a graph.” SIAM J. Comput. 5, no. 1, 90–99. MR 52.2 16106.
Mathias, A.R.D. (1977) “A solution of a problem of B. Rotman.” Colloq. Math. 38, no. 1, 39. MR 57.1 129.
Matijasevic, Ju. V . (1974) “A certain scheme for proofs in discrete mathematics.” (Russian. English summary), Zap. Naucn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 40, 94–100, 158. MR 51.1 78.
Matjuskov, V.V . (1962) “The vertex function of directed graphs.” (Russian), Dokl. Akad. Nauk SSSR 146, 37–40. MR 25.2 5009.
Matsumoto, T. (1976) “On several geometric aspects of nonlinear networks.” J. Franklin Inst. 301, no. 1 /2, 203–225. MR 54.2 12393.
Matsui, Kineo (1972) “Equivalence transformations of directed graphs.” Electron. Commun. Japan 55, no. 4, 16–22. MR 53.1 7632.
Matsui, Kineo; Hirayama, Kazuo (1978) “Some properties of the minimum feedback arc set for a directed graph.” Mem. Defense Acad. 18, no. 2, 79–85. MR 80j:05070.
Matthews, Laurence (1977) “Matroids on the edge sets of directed graphs.” Optimization and operations research (Proc. Workshop, Univ. Bonn, Bonn), pp. 193–199, Lecture Notes in Econom. and Math. Systems, 157, Springer, Berlin, 1978. MR 80a:05103.
Matthews, Laurence R. (1978) “Matroids from directed graphs.” Discrete Math. 24, no. 1, 47–61. MR 81e:05055.
Matyushkov, V.V . (1982) “The modular product of graphs and its properties.” (Russian), Mat. Issled. No. 66, 105–112, 194. MR83j:05074.
Maurer, Stephen B. (1975) “Intervals in matroid basis graphs.” Discrete Math. 11, 145–159. MR 55.2 10296.
Maurer, Stephen B.; Rabinovitch, Issie; Trotter, William T., Jr. (1980) “A generalization of Turan’s theorem to directed graphs.” Discrete Math. 32, no. 2, 167–189. MR 82c:05061.
Maurer, Stephen B. (1979) “Vertex colorings without isolates.” J. Combin. Theory Ser. B 27, no. 3, 294–319. MR 82c:05049.
Maurer, Willi (1975) “On most effective tournament plans with fewer games than competitors.” Ann. Statist. 3, 717–727. MR 51.1 7929.
Mautner, Friederich Ignaz (1974) “Formules de trace explicites pour certains operateurs de Hecke.” C.R. Acad. Sci. Paris Ser. A 278, 207–209. MR 49.1 2673.
Maybee, John S. (1980) “Sign solvable graphs.” Discrete Appl. Math. 2, no. 1, 57–63. MR 81g:05063.
Mayer, Jean (1969) “Le probleme des regions voisines sur les surfaces closes orientables.” J. Combinatorial Theory 6, 177–195. MR 38.2 3177.
Mayoh, B.H. (1966) “Simple structures defined on a transitive and reflexive graph.” Rev. Roumaine Math. Pures Appl. 11, 43–51. MR 33.2 5519.
McAvaney, K.L . (1979) “A conjecture on two-point deleted subgraphs of Cartesian products.” Combinatorial mathematics, VII (Proc. Seventh Australian Conf., Univ. Newcastle, Newcastle), pp. 172–185, Lecture Notes in Math., 829, Springer, Berlin, 1980. MR 82i:05065.
McCarthy, P.J. (1975) “Matchings in graphs. II.” Discrete Math. 11, 141–145. MR 51.1 280.
McCarthy, Donald J.; Quintas, Louis V. (1977) “The construction of minimal-line graphs with given automorphism group.” Topics in graph theory (New York), pp. 144–156, Ann. New York Acad. Sci., 328, New York Acad. Sci., New York, 1979. MR 81c:05050.
McCarthy, P.J. [McCarthy, Paul J.] (1978) “Matchings in infinite graphs.” Czechoslovak Math. J. 28(103), no. 2, 245–251. MR 58 #5409.
McDiarmid, Colin (1972) “Strict gammoids and rank functions.” Bull. London Math. Soc. 4, 196–198. MR 47.2 6521.
McDiarmid, Colin (1973) “An application of a reduction method of R. Rado to the study of common transversals.” Mathematika 20, 83–86. MR 49.1 2409.
McDiarmid, C.J.H. (1973) “Independence structures and submodular functions.” Bull. London Math. Soc. 5, 18–20. MR 49.2 8872.
McDiarmid, Colin J.H. (1973) “A note on a theorem of R. Rado on independent transversals.” Bull. London Math. Soc. 5, 315–316. MR 49.1 2408.
McDiarmid, C.J.H. (1974) “Path-partition structures of graphs and digraphs.” Proc. London Math. Soc. (3) 29, 750–768. MR 54.2 7321.
McDiarmid, C.J.H. (1975) “An exchange theorem for independence structures.” Proc. Amer. Math. Soc. 47, 513–514. MR 51.1 215.
McDiarmid, Colin J.H. (1975) “Extensions of Menger’s theorem.” Quart. J. Math. Oxford Ser. (2) 26, no. 102, 141–157. MR 51.1 7930.
McDiarmid, Colin (1975) “On separated separating sets and Menger’s theorem.” Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen), pp. 455–459. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976. MR 53.1 2746.
McDiarmid, Colin J.H. (1975) “Rado’s theorem for polymatroids.” Math. Proc. Cambridge Philos. Soc. 78, no. 2, 263–281. MR 52.1 153.
McDiarmid, Colin (1979) “Clutter percolation and random graphs.” Combinatorial optimization, II (Proc. Conf., Univ. East Anglia, Norwich). Math. Programming Stud. No. 13 (1980), 17–25. MR 81m:05119.
McEliece, Robert J.; Posner, Edward C. (1971) “Hide and seek, data storage, and entropy.” Ann. Math. Statist. 42, 1706–1716. MR 53.1 7615.
McEliece, Robert J.; Taylor, Herbert (1973) “Covering tori with squares.” J. Combinatorial Theory Ser. A 14, 119–124. MR 47.1 4149.
McFall, John, D . (1979) “Characterizing hypercubes.” Combinatorics 79 (Proc. Colloq., Univ. Montreal, Montreal, Que.), Part II. Ann. Discrete Math. 9, 237–241. MR 83c:05105.
McFarland, Robert L. (1973) “A family of difference sets in non-cyclic groups.” J. Combinatorial Theory Ser. A 15, 1–10. MR 47.1 3198.
McKay, B.D.; Stanton, R.G. (1978) “The current status of the generalised Moore graph problem.” Combinatorial mathematics, VI (Proc. Sixth Austral. Conf., Univ. New England, Armidale), pp. 21–31, Lecture Notes in Math., 748, Springer, Berlin, 1979. MR 81i:05085.
McKay, Brendan D . (1980) “Practical graph isomorphism.” Proceedings of the Tenth Manitoba Conference on Numerical Mathematics and Computing, Vol. I (Winnipeg, Man.). Congr. Numer. 30 (1981), 45–87. MR 83e:05061.
McKee, T.A. (1975) “Logical and graph-theoretic characterizations of the self–dual sentences of projective geometry.” J. Geometry 6, 77–88. MR 51.2 10069.
McKee, T.A. (1979) “A self-dual language for graph theory.” J. Combin. Theory Ser. B 27, no. 1, 60–66. MR 83c:05045.
McKenzie, D.S. (1975) “The description and group properties of linear graphs.” J. Phys. A 8, no. 11, 1746–1754. MR 53.1 5362.
McMorris, F.R.; Myers, G.T. (1983) “Some uniqueness results for upper bound graphs.” Discrete Math., 44, 321–323.
McMorris, F.R.; Zaslavsky, T. (1982) “Bound graphs of a partially ordered set.” J. Comb. Inf. Syst. Science, 7, 134–138.
McQuistan, R.B.; Lichtman, S.J.; Levine, L.P. (1972) “Occupation statistics for parallel dumbbells on a 2xN lattice space.” J. Mathematical Phys. 13, 242–248. MR 45.1 82.
Meeusen, W.; Cuyvers, L. (1975) “Clique detection in directed graphs: a new algorithm.” J. Comput. Appl. Math. 1, no. 3, 185–203. MR 52.1 118.
Meijer, H.G. (1973) “On a distribution problem in finite sets.” Nederl. Akad. Wetensch. Proc. Ser. A 76 = Indag. Math. 35, 9–17. MR 47.2 4806.
Melikhov, A.N. [Melihov, A.N.]; Bershteyn, L.S. [Berstein, L.S.]; Karelin, V.P. (1968) “Isomorphism of graphs and finite automata.” Izv. Akad. Nauk SSR Tehn. Kibernet., no. 1, 128–134 (Russian); translated as Engrg. Cybernetics, no. 1, 124–129. MR 39.2 8025.
Melihov, A.N. (1971) “Directed graphs and finite automata.” (Russian), Izdat. “Nauka”, Moscow, 416 pp. MR 51.1 7693.
Mel’nikov, L.S.; Mel’nikova, E.P. (1973) “Variations on a theme: metrics in tournaments.” (Russian), Diskret. Analiz No. 22, 39–52, 80. MR 48.2 10878.
Mendelsohn, N.S. (1966) “Hamiltonian decomposition of the complete directed n-graph.” Theory of Graphs (Proc. Colloq., Tihany), pp. 237–241. Academic Press, New York, 1968. MR 38.2 4361.
Mendelsohn, N.S. (1969) “Directed graphs with the unique path property.” Combinatorial Theory and its Applications, II (Proc. Colloq., Balatonfured), pp. 783–799. North-Holland, Amsterdam, 1970. MR 45.2 6690.
Mendelsohn, N.S . (1968) “A combinatorial method for embedding a group in a semigroup.” Combinatorics (Proc. Sympos. Pure Math., Vol. XIX, Univ. California, Los Angeles, Calif.), pp. 157–164. Amer. Math. Soc., Providence, R.I., 1971. MR 48.1 159.
Metel’skii, N.N.; Kornienko, N.M. (1979) “Metrization of a class of graphs.” (Russian. English summary), Dokl. Akad. Nauk BSSR 23, no. 1, 5–7, 91. MR 80b:05026.
Metropolis, N.; Stein, M.L.; Stein, P.R. (1973) “On finite limit sets for transformations on the unit interval.” J. Combinatorial Theory Ser. A 15, 25–44. MR 47.2 5183.
Metropolis, N.; Rota, Gian-Carlo (1978) “On the lattice of faces of the n–cube.” Bull. Amer. Math. Soc. 84, no. 2, 284–286. MR 57.1 2961.
Metropolis, N.; Nicoletti, G.; Rota, Gian-Carlo (1981) “A new class of symmetric functions.” Mathematical analysis and applications, Part B, pp. 563–575, Adv. in Math. Suppl. Stud., 7b, Academic Press, New York. MR 83c:05005.
Meyer, Bernd (1982) “On the lattices of cutsets in finite graphs.” European J. Combin. 3, no. 2, 153–157. MR 83k:05071.
Meyer, John F. (1972) “Algebraic isomorphism invariants for graphs of automata.” Graph theory and computing, pp. 123–152. Academic Press, New York. MR 54.2 7305.
Meyer auf der Heide, Friedhelm (1981) “A comparison of two variations of a pebble game on graphs.” Theoret. Comput. Sci. 13, no. 3, 315–322. MR 82j:05065.
Meyer, Karlhorst (1974) “Verbande von taktischen Konfigurationen.” Abh. Math. Sem. Univ. Hamburg 41, 75–81. MR 56.1 5333.
Meyers, William James (1978/79) “Topological sorting and well-formed strings.” Fund. Inform. (4) 2, no. 2, 199–209. MR 81c:05029.
Meyniel, M. (1973) “Une condition suffisante d’existence d’un circuit Hamiltonien dans un graphe oriente.” J. Combinatorial Theory Ser. B 14, 137–147. MR 47.2 6546.
Meyniel, H. (1976) “On the perfect graph conjecture.” Discrete Math. 16, no. 4, 339–342. MR 55.2 12568.
Mikola, Milan (1974) “The maximum and minimum connectivity of a digraph.” (Slovak, Russian and German summaries), Prace Stud. Vys. Skoly Doprav. v Ziline Ser. Mat.-Fyz. Cislo 1, 13–19. MR 53.2 10640.
Mikola, Milan (1976) “The extremal connectivity of the strictly weak digraph.” Math. Slovaca 26, no. 2, 115–118. MR 54.2 12564.
Milancej, Taduesz; Gruszczynski, Walerian (1972) “Generation of directed cotrees formulated in Wang’s algebra.” Electron. Lett. 8, 491–492. MR 48.2 8293.
Miller, Donald J. (1968) “The categorical product of graphs.” Canad. J. Math. 20, 1511–1521. MR 38.1 73.
Miller, Donald J. (1970) “Weak Cartesian product of graphs.” Colloq. Math. 21, 55–74. MR 43.1 92.
Miller, J.C.P . (1973) “On the enumeration of partially ordered sets of integers.” Combinatorics (Proc. British Combinatorial Conf., Univ. Coll. Wales, Aberystwyth), pp. 109–124. London Math. Soc. Lecture Note Ser., No. 13, Cambridge Univ. Press, London, 1974. MR 50.1 1904.
Milliken, Keith R. (1975) “Ramsey’s theorem with sums or unions.” J. Combinatorial Theory Ser. A 18, 276–290. MR 51.2 10106.
Milliken, Keith R. (1979) “A Ramsey theorem for trees.” J. Combin. Theory Ser. A 26, no. 3, 215–237. MR 80j:05090.
Milner, E.C. (1975) “Independent transversals for countable set systems.” J. Combinatorial Theory Ser. A 19, no. 2, 125–133. MR 51.2 10108.
Minty, George J . (1975) “On the axiomatic foundations of the directed linear graphs, electrical networks and network-programming.” Studies in graph theory, Part II, pp. 246–300. Studies in Math., Vol. 12, Math Assoc. Amer., Washington, D.C. MR 52.2 13473.
Mirsky, L. (1966) “Transversals of subsets.” Quart. J. Math. Oxford Ser. (2) 17, 58–60. MR 34.1 2477.
Mirsky, L. (1967) “Systems of representatives with repetition.” Proc. Cambridge Philos. Soc. 63, 1135–1140. MR 36.1 58.
Mirsky, L. (1974) “Partitioned transversals.” Glasgow Math. J. 15, 14–16. MR 50.2 12741.
Mitchell, A.R.; Mitchell, R.W. (1975) “A note on topologies on finite sets.” Fibonacci Quart. 13, no. 4, 356, 368. MR 52.1 2912.
Molchanov, V.A . (1982) “Semigroups of graph colorings.” (Russian), Izv. Vyssh. Uchebn. Zaved. Mat., no. 3, 26–33. MR 83i:05031.
Monjardet, B. (1973) “Hypergraphs and Sperner’s theorem.” Discrete Math. 5, 287–289. MR 48.1 5870.
Monjardet, B . (1974) “Systemes de blocage.” Colloque sur la Theorie des Graphes (Paris). Cahiers Centre Etudes Recherche Oper. 17, no. 2–3–4, 293–294. MR 53.1 147.
Moon, J.W. (1963) “An extension of Landau’s theorem on tournaments.” Pacific J. Math. 13, 1343–1345. MR 27.2 5697.
Moon, J.W. (1964) “Tournaments with a given automorphism group.” Canad. J. Math. 16, 485–589. MR 29.1 603.
Moon, J.W. (1966) “On sub tournaments of a tournament.” Canad. Math. Bull. 9, 297–301. MR 34.1 95.
Moon, J.W.; Pullman, N.J. (1967) “On the powers of tournament matrices.” J. Combinatorial Theory 3, 1–9. MR 35.2 4128.
Moon, J.W.; Moser, L. (1967) “Generating oriented graphs by means of team comparisons.” Pacific J. Math. 21, 531–535. MR 36.1 79.
Moon, John W . (1968) “Topics on tournaments.” Holt, Rinehart and Winston, New York-Montreal, Que.-London, viii+104 pp. MR 41.1 1574.
Moon, J.W. (1969) “On cycles in tournaments.” Mat. Casopis Sloven. Akad. Vied 19, 121–125. MR 46.1 1635.
Moon, J.W . (1969) “Some mapping problems for tournaments.” Graph Theory and its Applications (Proc. Advanced Sem., Math. Research Center, Univ. of Wisconsin, Madison, Wis.), pp. 133–148. Academic Press, New York, 1970. MR 44.1 118.
Moon, J.W. (1972) “Embedding tournaments in simple tournaments.” Discrete Math. 2, no. 4, 389–395. MR 46.1 1636.
Moon, J.W. (1972) “The minimum number of spanning paths in a strong tournament.” Publ. Math. Debrecen 19, 101–104 (1973). MR 48.2 8294.
Moon, J.W. (1976) “A problem on arcs without bypasses in tournaments.” J. Combinatorial Theory Ser. B 21, no. 1, 71–75. MR 55.1 165.
Moon, J.W. (1979) “Tournaments whose subtournaments are irreducible or transitive.” Canad. Math. Bull. 22, no. 1, 75–79. MR 80h:05028.
Moore, John I., Jr. (1977) “Interval hypergraphs and D-interval hypergraphs.” Discrete Math. 17, no. 2, 173–139. MR 55.2 10333.
Moravek, Jaroslav (1970) “A note upon minimal path problem.” J. Math. Anal. Appl. 30, 702–717. MR 43.2 4710.
Morris, P.A . (1974) “On self complementary graphs and digraphs.” Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 583–590. Congressus Numerantium, No. X, Utilitas Math., Winnipeg, Man. MR 51.1 245.
Morrison, Donald R. (1969) “Matching algorithms.” J. Combinatorial Theory 6, 20–32. MR 39.1 76.
Mosesjan, K.M . (1972) “A minimal graph that is not strongly basable.” (Russian. Armenian summary), Akad. Nauk Armjan. SSR Dokl. 54, 8–12. MR 46.1 1637.
Mosesjan, K.M . (1973) “Basis graphs of certain orderings.” (Russian. Armenian summary), Akad. Nauk Armjan. SSR Dokl. 57, 264–270. MR 52.2 10508.
Mosesjan, K.M . (1979) “Properties of some orientations of graphs.” (Russian. Armenian summary). Trudy Vycisl. Centra Akad. Nauk Armjan. SSR i Erevan. Gos. Univ. Mat. Voprosy Kibernet. i Vycisl. Tehn. No. 9 Teorija Grafov, 37–44. MR 82j:05066.
Motzkin, Theodore S. (1975) “Sets for which no point lies on many connecting lines.” J. Combinatorial Theory Ser. A 18, 345–348. MR 51.1 2946.
Mowshowitz, Abbe (1968) “Entropy and the complexity of graphs. I. An index of the relative complexity of a graph.” Bull. Math. Biophys. 30, 175–204. MR 39.2 5399.
Mowshowitz, Abbe (1968) “Entropy and the complexity of graphs. II. The information content of digraphs and infinite graphs.” Bull. Math. Biophys. 30, 225–240. MR 39.2 5400.
Mowshowitz, Abbe (1968) “Entropy and the complexity of graphs. III. Graphs with prescribed information content.” Bull. Math. Biophys. 30, 387–414. MR 39.2 5401.
Mowshowitz, Abbe (1971) “Graphs, groups and matrices.” Proceedings of the Twenty-Fifth Summer Meeting of the Canadian Mathematical Congress (Lakehead Univ., Thunder Bay, Ont.), pp. 509–522. Lakehead Univ., Thunder Bay, Ont. MR 49.1 2451.
Mowshowitz, Abbe (1972) “The characteristic polynomial of a graph.” J. Combinatorial Theory Ser. B 12, 177–193. MR 45.2 5011.
Mowshowitz, Abbe (1971) “The adjacency matrix and the group of a graph.” New directions in the theory of graphs (Proc. Third Ann Arbor Conf. on Graph Theory, Univ. of Michigan, Ann Arbor, Mich.), pp. 129–148. Academic Press, New York, 1973. MR 50.2 9679.
Mukhopadhyay, A. (1967) “The square root of a graph.” J. Comb. Theory, 2, 290–295.
Mulder, H.M. (1980) “The interval function of a graph.” Mathematical Centre Tracts, 132. Mathematisch Centrum, Amsterdam, iii+191 pp. MR 82h:05045.
Mulder, Martyn (1979) “(0,λ)-graphs and n-cubes.” Discrete Math. 28, no. 2, 179–188. MR 81m:05120.
Muller, Heinrich {1981) “Oriented hypergraphs, stability numbers and chromatic numbers.” Discrete Math. 34, no. 3, 319–320. MR 82i:05056.
Muller, Vladimir; Nesetril, Jaroslav; Pelant, Jan (1975) “Either tournaments or algebras?” Discrete Math. 11, 37–66. MR 50.2 9675.
Muller, Vladimir; Pelant, Jan (1978) “The number of Hamiltonian circuits.” J. Combinatorial Theory Ser. B 24, no. 2, 223–227. MR 58 #5377.
Munn, W.D . (1972/73) “Free inverse semigroups.” Semigroup Forum 5, 262–269. MR 48.1 447.
Muracchini, Luigi; Ghirlanda, Anna Maria (1965) “Sui grafi segnati ed i grafi commutati.” Statistica (Bologna) 25, 677–680. MR 33.2 7272.
Murchland, John D . (1969) “Construction of a basis of elementary circuits and cocircuits in a directed graph.” Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta.), pp. 285–288. Gordon and Breach, New York, 1970. MR 42.1 2984.
Murchland, John David (1970) “A fixed matrix method for all shortest distances in a directed graph and for the inverse problem.” Universitat (TH) Fridericiana zu Karlsruhe, Karlsruhe, ii+60 pp. MR 48.1 154.
Murty, U.S.R. (1971) “On the number of bases of a matroid.” Proc. Second Louisiana Conf. on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 387–410. Louisiana State Univ., Baton rouge, La. MR 54.2 10053.
Murty, U.S.R. (1974) “Extremal critically connected matroids.” Discrete Math. 8, 49–58. MR 50.1 1940.
Murty, U.S.R . (1976) “Extremal matroids with forbidden restrictions and minors (synopsis).” Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory, and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 463–468. Congressus Numerantium, No. XVII, Utilitas Math., Winnipeg, Man. MR 56.1 2851.
Mutafciev, Ljuben R . (1978) “Random mappings with constraints over the corresponding graphs.” (Russian), Serdica 4, no. 2–3, 105–110. MR 81c:60010.
Mutafciev, Ljuben R. [Mutafchiev, Lyuben R.] (1981) “Epidemic processes on random graphs and their threshold function.” Serdica 7, no. 2, 153–159. MR 83m:05122.
Mycielski, Jan (1961) “Some remarks and problems on the colouring of infinite graphs and the theorem of Kuratowski.” (Russian summary, unbound insert), Acta Math. Acad. Sci. Hungar. 12, 125–129. MR 24.A A546.
Myers, G.T . (1982) “Upper bound graphs of partially ordered sets.” Ph.D. Thesis, Bowling Green State Univ., Bowling Green, Ohio.
Naddef, D.; Pulleyblank, W.R. (1981) “Hamiltonicity and combinatorial polyhedra.” J. Combin. Theory Ser. B 31, no. 3, 297–312. MR 83c:05087.
Nagy, Zsigmond (1972) “A certain constructive estimate of the Ramsey number.” (Hungarian). Mat. Lapok 23, 301–302 (1974).
Naik, R.; Shrikhande, S.S.; Rao, S.B.; Singhi, N.M. (1978) “Intersection graphs of k-uniform hypergraphs.” Combinatorial mathematics, optimal designs and their applications (Proc. Sympos. Combin. Math, and Optimal Design, Colorado State Univ., Fort Collins, Colo.). Ann. Discrete Math. 6, 275–279. MR 81m:05104.
Naik, Ranjan N.; Rao, S.B.; Shrikhande, S.S.; Singhi, N.M. (1982) “Intersection graphs of k–uniform linear hypergraphs.” European J. Combin. 3, no. 2, 159–172. MR 83m:05106.
Nakano, Takeo (1973) “A characterization of intervals; the consecutive (one’s or retrieval) property.” Comment. Math. Univ. St. Paul. 22, fasc. 1, 49–59. MR 48.1 5871.
Nakayama, Akira (1981) “Relations entre matroides et une operation sur un ensemble fini. [Relations between matroids and an operation on a finite set].” TRU Math. 17, no. 1, 123–128. MR 83a:05050.
Narayana, T.V.; Mathsen, R.M.; Williams, J.G. (Editors) (1980) “Combinatorics, representation theory and statistical methods in groups.” Young Day Proceedings. Lecture Notes in Pure and Applied Mathematics, 57. Marcel Dekker, Inc., New York, xii+170 pp. MR 81h:05003.
Narushima, Hiroshi (1974) “Order maps and cardinal congruence classes on partitions.” Proc. Fac. Sci. Tokai Univ. 9, 1–13. MR 50.1 4325.
Narushima, Hiroshi (1979) “A survey of enumerative combinatorial theory and a problem.” Proc. Fac. Sci. Tokai Univ. 14, 1–10. MR 80i:05011.
Narushima, Hiroshi (1981) “A method for counting the number of chains in a partially ordered set.” Proc. Fac. Sci. Tokai Univ. 16, 3–20. MR 83a:05019a.
Kusaka, Yukio; Fukuda, Hiroaki; Narushima, Hiroshi (1981) “The number tables of the command flow numbers on a Boolean lattice and a partition lattice.” Proc. Fac. Sci. Tokai Univ. 16, 21–27. MR 83a:05019b.
Nash-Williams, C. St. J. A. (1960) “On orientations, connectivity and odd-vertex-pairings in finite graphs.” Canad. J. Math. 12, 555–567. MR 22.2 9455.
Nash-Williams, C. St. J. A . (1960/61) “Decomposition of the n-dimensional lattice-graph into Hamiltonian lines.” Proc. Edinburgh Math. Soc. (2) 12, 123–131. MR 24.A A56.
Nash-Williams, C. St. J. A. (1965) “On well-quasi-ordering infinite trees.” Proc. Cambridge Philos. Soc. 61, 697–720. MR 31.1 90.
Nash-Williams, C. St. J. A. (1961) “Decomposition of finite graphs into open chains.” Canad. J. Math. 13, 157–166. MR 23A A74.
Nash-Williams, C. St. J. A. (1963) “On well-quasi-ordering trees.” Theory of Graphs and its Applications (Proc. Sympos. Smolenice), pp. 83–84. Publ. House Czechoslovak Acad. Sci., Prague, 1964. MR 30.2 3465.
Nash-Williams, C. St. J. A. (1966) “Euler lines in infinite directed graphs.” Canad. J. Math. 18, 692–714. MR 34.1 96.
Nash-Williams, C. St. J. A. (1967) “On well-quasi-ordering trees.” A Seminar on Graph Theory, pp. 79–82. Holt, Rinehart and Winston, New York. MR 35.2 5354.
Nash-Williams, C. St. J. A. (1968) “On better-quasi-ordering transfinite sequences.” Proc. Cambridge Philos. Soc. 64, 273–290. MR 36.2 5001.
Nash-Williams, C. St. J. A. (1968) “Hamiltonian circuits in graphs and digraphs.” The Many Facets of Graph Theory (Proc. Conf., Western Mich. Univ., Kalamazoo, Mich.), pp. 237–243. Springer, Berlin, 1969. MR 40.2 5484.
Nash-Williams, C. St. J. A. (1968) “Well-balanced orientations of finite graphs and unobtrusive odd-vertex-pairings.” Recent Progress in Combinatorics (Proc. Third Waterloo Conf. on Combinatorics), pp. 133–149. Academic Press, New York, 1969. MR 40.2 7146.
Nash-Williams, C. St. J. A.; Tutte, W.T. (1977) “More proofs of Menger’s theorem.” J. Graph Theory 1, no. 1, 13–17. MR 57.1 174.
Nash-Williams, C. St. J. A. (1982) “A glance at graph theory. I.” Bull. London Math. Soc. 14, no. 3, 177–212. MR 83h:05033a.
Nash-Williams, C. St. J. A. (1982) “A glance at graph theory. II.” Bull. London Math. Soc. 14, no. 4, 294–328. MR 83h:05033b.
Nastansky, L.; Selkow, S.M.; Stewart, N.F. (1974) “Cost-minimal trees in directed acyclic graphs.” (German summary), Z. Operations Res. Ser. A-B 18, A59–A67. MR 51.1 2984.
Nebesky, Ladiskav (1974) “A theorem on line graphs.” Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague), pp. 399–403. Academia, Prague, 1975. MR 52.2 10509.
Nebesky, Ladislav (1976) “Projective weakly connected digraphs with no directed cycle.” Rev. Roumaine Math. Pures Appl. 21, no. 2, 215–217. MR 55.2 7830.
Nebesky, Ladislav (1978) “A projectivity theorem for weakly connected digraphs.” Prague studies in mathematical linguistics, Vol. 6, pp. 209–213, North-Holland, Amsterdam. MR 80a:05104.
Nebesky, Ladislav (1978) “On pancyclic line graphs.” Czechoslovak Math. J. 28(103), no. 4, 650–655. MR 80a:05137.
Nebesky, Ladislav (1981) “Hypergraphs and intervals.” Czechoslovak Math. J. 31(106), no. 3, 469–474. MR 83c:05106.
Neggers, Joseph (1976) “On the number of isomorphism classes of certain types of finite algebras.” Kyungpook Math. J. 16, no. 2, 141–147. MR 54.2 7273.
Neggers, Joseph (1976) “On the number of isomorphism classes of certain types of actions and binary systems.” Kyungpook Math. J. 16, no. 2, 161–176. MR 54.2 7274.
Nemirovskiy, A.M . [Nemirovskii, A.M.] (1968) “Identification of simple elementary paths of antisymmetric graphs.” Izv. Akad. Nauk SSSR Tehn. Kibernet., no. 3, 60–65 (Russian); translated as Engrg. Cybernetics, no. 3, 49–54 (1969). MR 39.2 4051.
Nenov, Nedyalko D . (1981) “A constant connected with Ramsey (3,4)-graphs.” (Russian), Serdica 7, no. 4, 366–371 (1982). MR 83f:05051.
Nesetril, Jaroslav; Rodl, Vojtech (1974) “Partitions of subgraphs.” Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague), pp. 413–423. Academia, Prague, 1975. MR 55.1 2666.
Nesetril, Jaroslav (1977) “Riga P-point.” Comment. Math. Univ. Carolinae 18, no. 4, 675–683. MR 58 #241.
Nesetril, Jaroslav; Pultr, Ales (1978) “On classes of relations and graphs determined by subobjects and factorobjects.” Discrete Math. 22, no. 3, 287–300. MR 80k:05086.
Nesetril, J.; Pultr, A. (1978) “Product and other representations of graphs and related characteristics.” Algebraic methods in graph theory, Vol. I, II (Szeged), pp. 571–598, Colloq. Math. Soc. Janos Bolyai, 25, North-Holland, Amsterdam, 1981. MR 83g:05071.
Nettleton, R.E.; Green, M.S. (1960) “Moebius function on the lattice of dense subgraphs.” J. Res. Nat. Bur. Standards Sect. B 64B, 41–47. MR 22.1 2562.
Neumaier, A . (1981) “On a class of edge-regular graphs.” Geometries and groups (Berlin), pp. 223–230, Lecture Notes in Math., 893, Springer, Berlin. MR 83e:05068.
Neumann Lara, Victor (1971) “Seminuclei of a digraph.” (Spanish), An. Inst. Mat. Univ. Nac. Autonoma Mexico 11, 55–62. MR 47.2 6536.
Neumann, Peter M . (1973) “Finite permutation groups, edge-coloured graphs and matrices.” Topics in group theory and computation (Proc. Summer School, University Coll., Galway), pp. 82–118. Academic Press, London, 1977. MR 57 #12653.
Nguyen Mong Hy (1972) “Regular polygons on an affine Galois plane of order nine.” (Hungarian. Italian summary), Mat. Lapok 22, 323–329 (1972). MR 51.1 6572.
Nguyen Huy Xuong (1975) “Graphes regulierement representables sur le tore.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 281, no. 16, Ai, A683–A685. MR 53.2 9217.
Nguyen Huy Xuong (1976) “Sur les immersions d’un graphe dans les surfaces orientables.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 283, no. 10, Ai, A745–A747. MR 55.2 13429.
Nguyen Huy Xuong (1976) “Sur quelques classes de graphes possedant des proprietes topologiques remarquables.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 283, no. 11, Ai, A813–A816. MR 54.2 12560.
Nieminen, J . (1974) “A linear pseudo-Boolean viewpoint on matching and other central concepts in graph theory.” (Polish summary), Zastos. Mat. 14, 365–369. MR 50.2 12277.
Nieminen, J . (1974/75) “Some applications of graph theory in the theory of hypergraphs.” (Polish summary), Zastos. Mat. 14, no. 4, 607–612. MR 52.2 13513.
Nieminen, Juhani (1976) “Weak balance: a combination of Heider’s theory and cycle and path-balance.” (Polish and Russian summaries), Control Cybernet. 5, no. 1, 69–73. MR 55.1 2639.
Nieminen, Juhani (1978) “Applications of lattice theory and ideals to graph theory.” Demonstratio Math. 11, no. 4, 929–935 (1979). MR 80c:05090.
Nieminen, J . (1980) “Products of graphs and congruence relations.” (Serbo-Croatian summary), Glas. Mat. Ser III. 15(35), no. 1, 17–24. MR 81h:05113.
Nieminen, Juhani (1981) “Graphs of generalized lattices.” Serdica 7, no. 1, 79–84. MR 83b-.05106.
Nigmatullin, R.G . (1968) “The matchings of a graph.” (Russian), Kazan. Gos. Univ. Ucen. Zap. 128, kn. 2, 91–94. MR 44.1 1595.
Nijenhuis, Albert; Wilf, Herbert S. (1972) “Induced Markov chains and the permanent function.” Nederl. Akad. Wetensch. Proc. Ser. A 75 = Indag. Math 34, 93–99. MR 47.1 1830.
Nijenhuis, Albert; Wilf, Herbert S. (1972) “Induced Markov chains and the permanent function.” Nederl. Akad. Wetensch. Proc. Ser. A 75 = Indag. Math 34, 93–99. MR 47.1 1830.
Nincak, Jan (1973) “On a conjecture by Nash-Williams.” Comment. Math. Univ. Carolinae 14, 135–138. MR 52.1 2949.
Niven, Ivan (1969) “Formal power series.” Amer. Math. Monthly 76, 871–889. MR 40.2 5606.
Noltemeier, H . (1976) “Reduktion von Prazedenzstrukturen.” (English summary), Z. Operations Res. Ser. A-B 20, no. 5, A151–A159. MR 55.2 7831.
Norman, Robert Z.; Rabin, Michael O (1959) “An algorithm for a minimum cover of a graph.” Proc. Amer. Math. Soc. 10, 315–319. MR 21.2 5583.
Nowicki, Tadeusz; Standzak, Wieslaw (1976) “Connections between trees and cut-sets in a connected one-graph. Theoretical foundations and algorithms for generating trees and cut-sets.” (Polish. Russian, English, French and German summaries), Arch. Elektrotech. (Warsaw) 25, no. 1, 3–11. MR 57 #11955.
Numata, Jun (1972) “A matching transformation of a bipartite graph.” Information Processing in Japan 12, 15–20. MR 47.2 6559.
Nurlybaev, A.N . (1977) “The neighborhood of the element in the problem of overlapping Cartesian products.” (Russian), Coding theory and the optimization of complex systems (Russian), pp. 179–181, 243, “Nauka” Kazah. SSR, Alma-Ata. MR 80d:05007.
Nydl, Vaclav (1981) “Finite graphs and digraphs which are not reconstructible from their cardinality restricted subgraphs.” Comment. Math. Univ. Carolin. 22, no. 2, 281–287. MR 83a:05104.
Olaru, E. (1973) “Uber perfekte und kritisch imperfekte Graphen.” (Romanian summary), An. Sti. Univ. “AI. I. Cuza” Iasi Sect. I a Mat. (N.S.) 19, no. 2, 477–486. MR 54.1 5053.
Olaru, Elefterie (1980) “α-zerlegbare Graphen.” (French and Romanian summaries) [α -decomposable graphs], Bui. Univ. Galati Fasc. II Mat. Fiz. Mec. Teoret. 3, 39–45. MR 83i:05048.
Olive, Gloria (1979) “Binomial functions and combinatorial mathematics.” J. Math. Anal. Appl. 70, no. 2, 460–473. MR 81a:05011.
Opsut, R.J. (1982) “On the computation of the competition number of a graph.” SIAM J. on Algebraic and Discrete Methods, 3, 420–428.
Opsut, R.J.; Roberts, F.S. (1981) “On the fleet maintenance, mobile radio frequency, task assignment, and traffic phasing problems.” in G. Chartrand, Y. Alavi, D.L. Goldsmith, L. Lesniak-Foster, and D.R. Lick (eds.), The Theory and Application of Graphs, Wiley, New York, 479–492.
Opsut, R.J.; Roberts, F.S. (1983) “I-colorings, I-phasings, and I-intersection assignments for graphs, and their applications.” Networks, in press, (a)
Opsut, R.J.; Roberts, F.S. (1983) “Optimal I-intersection assignments for graphs: a linear programming approach.” Networks, in press, (b)
Ore, Oystein (1960) “Sex in graphs.” Proc. Amer. Math. Soc. 11, 533–539. MR 22.2 7957.
Ore, Oystein (1961) “Incidence matchings in graphs.” J„ Math. Pures Appl. (9) 40, 123–127. MR 25.1 25.
Ore, Oystein (1974) “Graphen und ihre Anwendungen.” Ernst Klett Verlag, Stuttgart, 119 pp. MR 80m:05002.
Orlin, J. (1977) “Contentment in graph theory: covering graphs with cliques.” Proc. of the Koninklijke Nederlandse Akademie van Wetenschappen, Amsterdam, Series A, 80, 406–424.
Orlin, James B. (1978) “Line-digraphs, arborescences, and theorems of Tutte and Knuth.” J. Combin. Theory Ser. B 25, no. 2, 187–198. MR 80a:05105.
Ostanello-Borreani, Anna (1968) “Osservazioni sulle matroidi trasversali.” (English summary), Boll. Un. Mat. Ital. (4) 1, 397–402. MR 38.2 5655.
Ostrand, Phillip A. (1972) “On distinct representatives and mapping theorems.” J. Math. Anal. Appl. 40, 207–213. MR 47.1 1623.
Ostroverhii, N.A. [Ostroverhii, M.O.]; Strok, V.V.; Homenko, N.P. [Homenko, M.P.] (1971) “Diameter critical graphs and digraphs.” (Russian. English summaries), Topological aspects of graph theory, pp. 214–271, 306. Izdanie Inst. Mat. Akad. Nauk Ukrain. SSR, Kiev. MR 57.1 2996.
Ostroverhii, M.O.; Kuz’menko, V.O. (1973) “Maximum genus of the Cartesian, the strong Cartesian and the lexicographic product of two graphs.” (Ukrainian. Russian and English summaries), ψ-ransformation of graphs (Ukrainian), pp. 211–223, 367. Vidannja Inst. Mat. Akad. Nauk Ukrain. RSR, Kiev. MR 54.2 10058.
Overbeck-Larisch, Maria (1974) “Hamiltonsche Linien in Digraphen.” (English summary), Tagung, Math. forschungsinst. Oberwolfach, Oberwolfach, pp. 109–116. International Series of Numerical Mathematics, Vol. 29, Birkhauser, Basel, 1975. MR 55.2 12569.
Ott, Udo (1975) “Endliche zyklische Ebenen.” Math. Z. 144, no. 3, 195–215. MR 52.1 1516.
Overbeck-Larisch, Maria (1976) “Hamiltonian paths in oriented graphs.” J. Combinatorial Theory Ser. B 21, no. 1, 76–80. MR 56.2 8417.
Overbeck-Larisch, Maria (1977) “A theorem on pancyclic-oriented graphs.” J. Combinatorial Theory Ser. B 23, no. 2–3, 168–173. MR 57.1 2976.
Pacault, Jean Francois (1974) “Computing the weak components of a directed graph.” SIAM J. Comput. 3, 56–61. MR 51.2 12593.
Paige, Michael R. (1975) “Program graphs, an algebra, and their implication for programming.” IEEE Trans. Software Engrg. SE-1, no. 3, 286–291. MR 52.2 12385.
Palasti, I. (1966) “On the strong connectedness of directed random graphs.” Studia Sci. Math. Hungar. 1, 205–214. MR 34.2 7403.
Palka, Z . (1982) “Isolated trees in a random graph.” (Polish summary), Zastos. Mat. 17, no. 2, 309–316. MR 83k:05042.
Palmer, Edgar M. (1970) “Asymptotic formulas for the number of self-complementary graphs and digraphs.” Mathematika 17, 85–90. MR 45.1 1803.
Palmer, E.M.; Robinson, R.W. (1973) “Enumeration under two representations of the wreath product.” Acta Math. 131, 123–143. MR 53.2 13026.
Palmer, E.M.; Schwenk, A.J. (1977) “The number of self-complementary achiral necklaces.” J. Graph Theory 1, no. 4, 309–315. MR 58 #5356.
Palmer, V. Dewayne (1981) “On the connectivity of regular random digraphs.” Utilitas Math. 20, 293–299. MR 83e:05076.
Pana, Stefan (1961) “A study of the topology of dipoles. I.” (Russian), Rev. Math. Pures Appl. 6, 553–588. MR 26.1 3045.
Pane, Stefan [Pana, Stefan] (1961) “A study of the topology of dipoles. II.” (Russian), Rev. Math. Pures Appl. 6, 761–792. MR 26.1 3046.
Papadimitriou, Christos H . (1976) “On the complexity of edge traversing.” J. Assoc. Comput. Mach. 23, no. 3, 544–554. MR 54.1 4613.
Papaioannou, Alexis (1981) “A Hamiltonian game.” Graph theory (Cambridge), pp. 171–178, North-Holland Math. Stud., 62, North-Holland, Amsterdam-New York, 1982. MR 83k:05074.
Parchmann, Rainer (1975) “On the cardinalities of finite topologies.” Discrete Math. 11, 161–172. MR 50.2 9602.
Parker, E.T. (1975) “The maximum number of digraph-distinct ordered quadruples on six marks.” J. Combinatorial Theory Ser. A 19, no. 2, 245–246. MR 53.1 2716.
Parker, Monique (1964) “Representation de tout groupe comme groupe d’automorphismes d’une relation.” Acad. Roy. Belg. Bull. CI. Sci. (5) 50, 1227–1233. MR 31.2 3489.
Parodi, Maurice (1970) “Sur certaines equations fonctionnelles a indeterminee matricielle.” C.R. Acad. Sci. Paris Ser. A-B 271, A113–A116. MR 42.2 6013.
Parsons, T.D. (1976) “Pursuit–evasion in a graph.” Theory and applications of graphs (Proc. Internat. Conf., Western Mich. Univ., Kalamazoo, Mich.), pp. 426–441. Lecture Notes in Math., Vol. 642, Springer, Berlin, 1978. MR 58 #10622.
Parsons, T.D. (1977) “Orthogonality graphs.” Ars Combinatoria 3, 165–207. MR 57 #9611.
Parthasarathy, K.R. (1964) “Enumeration of paths in digraphs.” Psychometrika 29, 153–165. MR 29.2 6488.
Parthasarathy, K.R.; Sridharan, M.R. (1969) “Enumeration of self-complementary graphs and digraphs.” J. Mathematical and Physical Sci. 3, 410–414. MR 41.2 8308.
Parthasarathy, K.R.; Ravindra, G. (1976) “The strong perfect-graph conjecture is true for K1,3 -free graphs.” J. Combinatorial Theory Ser. B 21, no. 3, 212–223. MR 5512 10308.
Parthasarathy, K.R.; Choudum, S.A. (1976) “The edge clique cover number of products of graphs.” J. Mathematical and Physical Sci. 10, no. 3, 255–261. MR 54.2 12579.
Parthasarathy, K.R.; Ravindra, G. (1979) “The validity of the strong perfect-graph conjecture for (K4-e)-free graphs.” J. Combin. Theory Ser. B 26, no. 1, 98–100. MR 80m:05045.
Patterson, S.J. (1975) “The Laplacian operator on a Riemann surface.” Compositio Math. 31, no. 1, 83–107. MR 52.1 5575.
Paul, A.J., Jr . (1967) “Generation of directed trees and 2-trees without duplication.” IEEE Trans. Circuit Theory CT-14, 354–356. MR 41.2 8304.
Paul, Jerome L. (1975) “The q-regularity of lattice point paths in Rn.” Bull. Amer. Math. Soc. 81, 492–494; addendum, ibid. 81, 1136. MR 51.1 2926
Paul, Jerome L . (1980) “Path length chromatic numbers of Zn.” Proceedings of the Eleventh Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla.), Vol. II. Congr. Numer. 29, 713–715. MR 82i:05035.
Payan, Charles (1974) “Sur une classe de problemes de couverture.” C.R. Acad. Sci. Paris Ser. A 278, 233–235. MR 49.1 4870.
Payan, Charles; Nguyen Huy Xuong (1979) “Graphes d’intervalle d’immersion 1.” (English summary), Combinatorics 79 (Proc. Colloq., Univ. Montreal, Montreal, Que.), Part I. Ann. Discrete Math. 8 (1980), 137–141. MR 81m:05067.
Payne, Stanley E . (1973) “A maximal determinant problem.” Report No. ARL 73-0195. Aerospace Research Laboratories, Air Force Systems Command, United States Air Force, Wright-Patterson Air Force Base, Ohio, v+28 pp. MR 48.2 11158.
Payne, SE . (1975) “Skew-translation generalized quadrangles.” Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 485–504. Congressus Numerantium, No. XIV, Utilitas Math., Winnipeg, Man. MR 53.1 169.
Pearl, Martin (1973) “Matrix theory and finite mathematics.” International Series in Pure and Applied Mathematics. McGraw-Hill Book Co., New York-Dusseldorf-Johannesburg. xii+450 pp. MR 49.1 311.
Peck, G.W. (1980) “Hamiltonian cycles of adjacent triples.” Stud. Appl. Math. 63, no. 3, 275–278. MR 82g:05062.
Peck, G.W. (1981) “A Helly theorem for sets.” SIAM JJ. Algebraic Discrete Methods 2, no. 3, 306–308. MR 83g:05004.
Pellerin, Arthur, Laskar, Renu (1975) “Cubic graphs on twelve vertices and the line graph of a finite affine plane.” Discrete Math. 12, 27–36. MR 51.1 5340.
Perepelica, V.A . (1973) “An asymptotic approach to the solution of certain extremal problems on graphs.” (Russian), Problemy Kibernet. No. 26, 291–314, 328. MR 50.1 1971.
Perfect, Hazel (1966) “Symmetrized form of P. Hall’s theorem on distinct representatives.” Quart. J. Math. Oxford Ser. (2) 17, 303–306. MR 35.1 75.
Perfect, Hazel (1969) “A generalization of Rado’s theorem on independent transversals.” Proc. Cambridge Philos. Soc. 66, 513–515. MR 39.2 5382.
Perl, J . (1974) “Graphenalgorithmen und Uberdeckungsprobleme.” (English summary), Computing (Arch. Elektron. Rechnen) 13, no. 2, 107–113. MR 53.1 199.
Perl, Y.; Shiloach, Y. (1978) “Finding two disjoint paths between two pairs of vertices in a graph.” J. Assoc. Comput. Mach. 25, no. 1, 1–9. MR 58.1 8474.
Perl, Y.; Zaks, S. (1981) “Deficient generalized Fibonacci maximum path graphs.” Discrete Math. 34, no. 2, 153–164. MR 82h:05027.
Perrin, D. [Perrin, Dominique]; Schutzenberger, M.-P. (1981) “A conjecture on sets of differences of integer pairs.” J. Combin. Theory Ser. B 30, no. 1, 91–93. MR 83b:05082.
Peteanu, Vasile (1972) “A generalization of the notion of center of a graph.” (Romanian. French summary), Rev. Anal. Numer. Teoria Aproximatiei 1, 83–86. MR 54.2 10075.
Petersdorf, M.; Sachs, H. (1969) “Uber Spektrum, Automorphismengruppe und Teiler eines Graphen.” Wiss. Z. Techn. Hochsch. Ilmenau 15, Heft 4 /5, 123–128. MR 42.2 4447.
Petrov, A.E . (1975) “Certain properties of sets of coordinates on planted trees with numbered arcs.” (Russian), Dokl. Akad. Nauk SSSR 223, no. 4, 803–805. MR 52.2 10464.
Pfaltz, John L. (1971) “Convexity in directed graphs.” J. Combinatorial Theory Ser. B 10, 143–152. MR 44.1 2669.
Pfaltz, John L. (1972) “Graph structures.” J. Assoc. Comput. Mach. 19, 411–422. MR 47.1 4481.
Picard, Claude Francois (1970) “Produit et somme de certains graphes quasi–fortement connexes inferieurement.” C.R. Acad. Sci. Paris Ser. A-B 271, A145–A148. MR 43.1 1888.
Picard, Claude-Francois (1974) “Arbre minimal d’une somme de graphes.” Colloque sur la Theorie des Graphes (Paris). Cahiers Centre Etudes Recherche Oper. 17 (1975), no. 2–3–4. MR 53.2 7831.
Pichat, E . (1967) “Decompositions et ecritures minimales des fonctions booleennes.” Colloque sur les Techniques de Calcul et les Calculateurs (Bucarest). Bull. Math. Soc. Sci. Math. R.S. Roumanie (N.S.) 12(60) (1968), no. 2, 143–151. MR 39.2 6799.
Pichat, E. (1977) “The disengagement algorithm or a new generalization of the exclusion algorithm.” Discrete Math. 17, no. 1, 95–106. MR 56.2 13769.
Piehler, Joachim (1972) “Zur Bestimmung aller Kreise in gerichteten Graphen.” (English and French summaries), Math. Operationsforsch. Statist. 3, Heft 5, 339–342. MR 49.1 121.
Piff, M.J. (1971) “Properties of finite character of independence spaces.” Mathematika 18, 201–208. MR 46.2 5151.
Piliposjan, T.E . (1979) “Length of a class of directed trees on a plane.” (Russian. Armenian summary), Trudy Vycisl. Centra Akad. Nauk Armjan. SSR i Erevan. Gos. Univ. Mat. Voprosy Kibernet. i Vycisl. Tehn. No. 9 Teorija Grafov, 64–70. MR 82h:05028.
Piper, Fred (1974) “On relative difference sets and projective planes.” Glasgow Math. J. 15, 150–154. MR 51.1 7907.
Pippenger, Nicholas (1977) “Superconcentrators.” SIAM J. Comput. 6, no. 2, 298–304. MR 56.1 5074.
Pippenger, Nicholas (1979) “The minimum number of edges in graphs with prescribed paths.” Math. Systems Theory 12, no. 4, 324–346. MR 81e:05079.
Pippert, R.E.; Beineke, L.W. (1974) “An acyclic cell–growth problem.” Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague), pp. 441–454. Academia, Prague, 1975. MR 52.1 5474.
Pjatnickaja, G.N.; Sinicyn, I.G. (1979) “Infinite turnpikes in a graph and optimal placement of figures of the same type in an infinite narrow strip.” (Russian), Z. Vycisl. Mat. i Mat. Fiz. 19, no. 5, 1304–1312, 1358. MR 81d:52013.
Plantholt, Mike (1981) “The chromatic index of graphs with a spanning star.” J. Graph Theory 5, no. 1, 45–53. MR 83f:05023.
Platonov, M.L . (1979) “Combinatorial numbers of a class of mappings and their applications.” “Nauka”, Moscow, 152 pp. MR 83m:05018.
Piatt, C.R. (1976) “Planar lattices and planar graphs.” J. Combinatorial Theory Ser. B 21, no. 1, 30–39. MR 55.1 2683.
Plemmons, R.J. (1970) “Graphs associated with a group.” Proc. Amer. Math. Soc. 25, 273–275. MR 41.2 8306.
Plemmons, R.J. (1972) “Graphs and nonnegative matrices.” Linear Algebra and Appl. 5, 283–292. MR 47.1 1664.
Plesnik, Jan; Znam, Stefan (1974) “Strongly geodetic directed graphs.” Acta Fac. Rerum Natur. Univ. Comenian. Math. Publ. 29, 29–34. MR 51.1 246.
Plesnik, Jan (1975) “Critical graphs of given diameter.” (Slovak and Russian summaries), Acta Fac. Rerem Natur. Univ. Comenain. Math. 30, 71–93. MR 53.1 2755.
Plesnik, Jan (1975) “Diametrically critical tournaments.” Casopis Pest. Mat. 100, no. 4, 361–370. MR 52. 2 13474.
Plummer, M.D.; Wilson, E.L. (1973) “On cycles and connectivity in planar graphs.” Canad. Math. Bull. 16, 283–288. MR 48.1 1987.
Pnueli, A.; Lempel, A.; Even, S. (1971) “Transitive orientation of graphs and identification of permutation graphs.” Canad. J. Math. 23, 160–175. MR 45.1 1800.
Podewski, K.-P.; Steffens, K. (1977) “Uber Translationen und den Satz von Menger in unendlichen Graphen.” Acta Math. Acad. Sci. Hungar. 30, no. 1–2, 69–84. MR 58 #5381.
Poenaru, Valentin (1960) “Quelques considerations sur la theorie des graphes.” (Romanian. Russian and French summaries), Com. Acad. R.P. Romine 10, 1079–1081. MR 23A A1549.
Pohl, Ira (1970) “Heuristic search viewed as path finding in a graph.” Artificial Intelligence 1, no. 3, 193–204. MR 45.1 3252.
Polat, Norbert (1976) “Treillis de separation des graphes.” Canad. J. Math. 28, no. 4, 725–752. MR 58 #16424.
Poljak, S.; Rodl, V. (1981) “On the arc-chromatic number of a digraph.” J. Combin. Theory Ser. B 31, no. 2, 190–198. MR 82j:05059.
Poljak, S.; Rodl, V.; Turzik, D. (1981) “Complexity of representation of graphs by set systems.” Discrete Applied Math., 3, 301–312.
Poljak, Svatopluk; Turzik, Daniel (1982) “A polynomial algorithm for constructing a large bipartite subgraph, with an application to a satisfiability problem.” Canad. J. Math. 34, no. 3, 519–524. MR 83j:05048.
Pollack, Richard M.; Shapiro, Harold N.; Sparer, Gerson H. (1974) “On the graphs of I. Katai.” Comm. Pure Appl. Math. 27, 669–713. MR 51.2 12672.
Pollatschek, M.A . (1973) “A necessary and sufficient condition for the existence of Hamiltonian paths and circuits and its application to the traveling-salesman problem.” Sechste Oberwolfach-Tagung uber Operations Research, Teil II, pp. 88–101. Operations Research Verfahren, Band XIX, Hain, Meisenheim am Glan, 1974. MR 55.1 5196.
Poole, George; Boullion, Thomas (1972) “Berge’s theorem for infinite tournaments.” Indust. Math. 22, 39–43. MR 47.2 4845.
Popadie, Milan S. (1970) “On the number of antichains of finite power sets.” Mat. Vesnik 7 (22), 199–203. MR 41.2 8252.
Popescu, Emil (1975) “Hamiltonian paths in a graph: applications to the solution of certain problems of production.” (Romanian), Gaz. Mat. Publ. Lunara Pentru Tineret 80, no. 6, 202–206. MR 52.1 2958.
Popov, V.A.; Lysenko, E.V.; Skibenko, I.T.; Sycev, A.V. (1977) “Synthesis of universal linear transformations.” (Russian), Avtomat. Sistemy Upravlenija i Pribory Avtomat. Vyp. 41, 50–53, 2. MR 58 #15720.
Postaru, A.I . (1975) “Concerning a problem of Lame on graphs.” (Russian), Prikl. Mat. i Programmirovanie Vyp. 14, 137–155, 161. MR 58 #5382.
Pouzet, Maurice (1978) “Sur certains tournois reconstructibles. Application a leurs groupes d’automorphismes.” Discrete Math. 24, no. 2, 225–229. MR 80b:05033.
Powers, David L. (1982) “Exceptional trivalent Cayley graphs for dihedral groups.” J. Graph Theory 6, no. 1, 43–55. MR 83e:05062.
Praeger, Cheryl E. (1976) “Doubly transitive permutation groups involving the one–dimensional projective special linear group.” Bull. Austral. Math. Soc. 14, no. 3, 349–358. MR 54.2 7595.
Price, W.L. (1977) “A topological transformation algorithm which relates the Hamiltonian circuits of a cubic planar map.” J. London Math. Soc. (2) 15, no. 2, 193–196. MR 56.2 8411.
Primenko, E.A. (1979) “Number of equivalence classes with respect to certain subgroups of a symmetric group.” Kibernetika (Kiev), no. 6, 19–22 (Russian); translated as Cybernetics 15, no. 6, 793–797 (1980). MR 82g:05009.
Promel, H.J.; Voigt, B. (1981) “Partition theorems for parameter systems and graphs.” Discrete Math. 36, no. 1, 83–96. MR 83a:05102.
Pudlak, Pavel; Tuma, Jiri (1980) “Every finite lattice can be embedded in a finite partition lattice.” Algebra Universalis 10, no. 1, 74–95. MR 81e:06013.
Puharev, N.K . (1968) “The construction of separate classes of regular finite spaces.” (Russian), Izv. Vyss. Ucebn. Zaved. Matematika, no. 2 (69), 85–88. MR 36.2 7017.
Puhov, G.E.; Sarasidze, G.K. (1975) “A principle for simulating combinatorial problems of discrete mathematics.” (Russian), Dokl. Akad. Nauk SSSR 225, no. 5, 1038–1040. MR 52.2 16894.
Pulleyblank, W.R . (1972) “Multi optimization in matching problems.” Proceedings of the Second Manitoba Conference on Numerical Mathematics (Univ. Manitoba, Winnipeg, Man.), pp. 317–326. Congressus Numerantium, No. VII, Utilitas Math., Winnipeg, Man., 1973. MR 50.2 9692.
Pulleyblank, W.; Edmonds, Jack (1974) “Facets of 1-matching polyhedra.” Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio), pp. 214–242. Lecture Notes in Math., Vol. 411, Springer, Berlin, 1974. MR 51.1 7960.
Pullman, N.J. (1969) “Products of Boolean matrices.” Combinatorial Theory and its Applications, III (Proc. Colloq., Balatonfured), pp. 919–927. North-Holland, Amsterdam, 1970. MR 45.2 6646.
Pultr, A. (1963) “An analogon of the fixed-point theorem and its application for graphs.” Comment. Math. Univ. Carolinae 4, 121–131. MR 32.2 5545.
Pultr, A.; Vinarek, J. (1977/78) “Productive classes and subdirect irreducibility, in particular for graphs.” Discrete Math. 20, no. 2, 159–176. MR 58 #5419.
Pultr, A . (1976) “On productive classes of graphs determined by prohibiting given subgraphs.” Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely), Vol. II, pp. 805–820, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 80e:05093.
Pultr, Ales (1979) “On linear representations of graphs.” Fundamentals of computation theory (Proc. Conf. Algebraic, Arith. and Categorical Methods in Comput. Theory, Berlin/Wendisch-Rietz), pp. 362–369, Math. Research, 2, Akademi-Verlag, Berlin. MR 8lg:05079.
Purdy, G. (1977) “A result on Sperner collections.” Utilitas Math. 12, 95–99. MR 58 #252.
Putcha, Mohan S.; Schoenfeld, Alan H. (1976) “Applications of algebraic and combinatoric techniques to a problem in geometry.” J. Pure Appl. Algebra 7, no. 2, 235–237. MR 52.2 10446.
Pym, J.S. (1969) “The linking of sets in graphs.” J. London Math. Soc. 44, 542–550. MR 38.2 3172.
Quitte, Claude (1977) “Interpretation topologique des methodes combinatoires utilisees par Ringel et Youngs.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 285, no. 12, A741–A743. MR 58 #18404.
Rabinowitz, J.H.; Proulx, V.K . (1983) “An asymptotic approach to the channel assignment problem.” mimeographed, Mitre Corp., Bedford, MA. (Submitted to SIAM J. on Algebraic and Discrete Methods).
Rado, P.A. (1970) “A note on paths in complete direct graphs.” Bull. London Math. Soc. 2, 66–68. MR 41.2 8305.
Rado, R. (1967) “Note on the transfinite case of Hall’s theorem on representatives.” J. London Math. Soc. 42, 321–324. MR 35.1 2758.
Rado, R. (1967) “A theorem on chains of finite sets.” J. London Math. Soc. 42, 101–106. MR 35.1 1491.
Rado, R. (1971) “A theorem on chains of finite sets. II.” Acta Arith. 18, 257–261. MR 44.2 6509.
Rado, Richard (1974) “Families of sets.” Proceedings of the International Congress of Mathematicians (Vancouver, B.C.), Vol. 2, pp. 491–496. Canad. Math. Congress, Montreal, Que., 1975. MR 54.2 10022.
Rado, Richard (1975) “The cardinal module and some theorems of families of sets.” Ann. Mat. Pura Appl. (4) 102, 135–154. MR 51.1 163.
Rado, Richard (1976) “Sequential partition relations.” (French summary), Problemes combinatoires et theorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay), pp. 339–341, Colloques Internat. CNRS, 260, CNRS, Paris, 1978. MR 81k:05003.
Rado, Richard (1981) “Theorems of intervals of ordered sets.” Discrete Math. 35, 199–201. MR 821:05037.
Radosavljevic, Zoran S. (1981) “Inequivalent regular factors of regular graphs on 8 vertices.” Publ. Inst. Math. (Beograd) (N.S.) 29 (43), 171–190. MR 83e:05088.
Rahilly, Alan (1972) “A class of finite projective planes.” Proceedings of the First Australian conference on Combinatorial Mathematics (Univ. Newcastle, Newcastle), pp. 31–37. Univ. of Newcastle Res. Associates, Newcastle, 1972. MR 50.1 6894.
Raj kow-Kryzwicki, Jacek (1981) “Structural numbers and graphs.” Demonstratio Math. 14, no. 2, 483–500. MR 83j:05075.
Ralston, Anthony (1982) “de Bruijn sequences—a model example of the interaction of discrete mathematics and computer science.” Math. Mag. 55, no. 3, 131–143. MR 83f:05005.
Ramachandran, S. (1979) “A test for legitimate decks.” Discrete Math. 25, no. 2, 165–173. MR 80d:05038.
Ramachandran, S. (1981) “On a new digraph reconstruction conjecture.” J. Combin. Theory Ser. B 31, no. 2, 143–149. MR 82k:05083.
Ramachandran, S. (1981) “On a new digraph reconstruction conjecture.” J. Combin. Theory Ser. B 31, no. 2, 143–149. MR 82k:05083.
Rao, P.R.; Vartak, M.N. (1981) “On the characterization of the line graphs of some graph products.” Ars Combin. 11, 107–121. MR 82m:05084.
Rao, S.B.; Ramachandra Rao, A. (1971/72) “The number of cut vertices and cut arcs in a strong directed graph.” Acta Math. Acad. Sci. Hungar. 22, 411–421. MR 45.1 3253.
Rao, Siddani Bhaskara (Editor) (1980) “Combinatorics and graph theory.” Proceedings of the Second Symposium held at the Indian Statistical Institute, Calcutta, February 25–29, 1980. Lecture Notes in Mathematics, 885. Springer-Verlag, Berlin-New York, 1981. vii+500 pp. MR 83c:05002.
Rao, S.B.; Singhi, N.M.; Vijayan, K.S. (1980) “The minimal forbidden subgraphs for generalized line-graphs.” Combinatorics and graph theory (Calcutta), pp. 459–472, Lecture Notes in Math., 885, Springer, Berlin-New York, 1981. MR 83i:05062.
Rao, S.B.; Singhi, N.M.; Vijayan, K.S. (1980) “Spectral characterization of the line graph of K1 n.” Combinatorics and graph theory (Calcutta), pp. 473–480, Lecture Notes in Math., 885, Springer, Berlin-New York, 1981. MR 83i:05063.
Ramachandra Rao, A . (Editor) (1976) “Proceedings of the Symposium on Graph Theory.” Held at the Indian Statistical Institute, Calcutta, December 20–25, 1976. ISI Lecture Notes, 4. Macmillan Co. of India, Ltd., New Delhi, 1979. vii+304 pp. MR 80j:05055.
Rao, S.B. (1975) “The dot composition of infinite graphs.” J. Indian Math. Soc. (N.S.) 39, 181–187 (1976). MR 54.2 12580.
Rao, Siddani Bhaskara (1976) “Explored, semi-explored and unexplored territories in the structure theory of self-complementary graphs and digraphs.” Proceedings of the Symposium on Graph Theory (Indian Statist. Inst., Calcutta), pp. 10–35, ISI Lecture Notes, 4, Macmillan of India, New Delhi, 1979. MR 81a:05036.
Ravindra, G. (1977) “Well-covered graphs.” J. Combinatorics Information Syst. Sci. 2, no. 1, 20–21. MR 57 #9612.
Ravindra, G.; Parthasarathy, K.R. (1977/78) “Perfect product graphs.” Discrete Math. 20, no. 2, 177–186. MR 58 #10567.
Ravindra, G. (1978) “Perfectness of normal products of graphs.” Discrete Math. 24, no. 3, 291–298. MR 80m:05046.
Ray-Chaudhuri, Dijen K . (Editor) (1978) “Relations between combinatorics and other parts of mathematics.” Proceedings of the Symposium in Pure Mathematics of the American Mathematical Society held at the Ohio State University, Columbus, Ohio, March 20–23, 1978. Proceedings of Symposia in Pure Mathematics, XXXIV. American Mathematical Society, Providence, R.I., 1979. xiii+378 pp. MR 80a:05005.
Ray-Chaudhuri, D.K. (1967) “Characterization of line graphs.” J. Combinatorial Theory 3, 201–214. MR 35.2 4119.
Ray-Chaudhuri, D.K. (1968) “Combinatorial information retrieval systems for files.” SIAM J. Appl. Math. 16, 973–992. MR 38.2 6885.
Raynaud, Herve (1968) “Sur les graphes aleatoires.” (English summary), Ann. Inst. H. Poincare Sect. B (N.S.) 4, 255–329. MR 40.2 5486.
Raynaud, H. (1973) “Sur le circuit Hamiltonien bi-colore dans les graphes orientes.” Period. Math. Hungar. 3, 289–297. MR 51.1 2986.
Razen, R.A . (1977) “Transversals and finite topologies.” Combinatorial mathematics (Proc. Internat. Conf. Combinatorial Theory, Australian Nat. Univ., Canberra), pp. 248–254, Lecture Notes in Math., 686, Springer, Berlin, 1978. MR 80c:05008.
Razen, R. (1979) “Ordered partitions and codes generated by circulant matrices.” J. Combin. Theory Ser. A 27, no. 3, 333–341. MR 81g:05016.
Razuvaev, A.G . (1969) “A certain problem of a plane topological graph.” (Russian), Gor’kov. Gos. Univ. Ucen. Zap. Vyp. 105, 64–65. MR 46.1 82.
Read, R.C. (1963) “On the number of self-complementary graphs and digraphs.” J. London Math. Soc. 38, 99–104. MR 26.2 4339.
Read, R.C.; Wormald, N.C. (1980) “Catalogues of graphs and digraphs.” Discrete Math. 31, no. 2, 224. MR 81h:05117.
Read, R.C.; Rotem, D.; Urrutia, J. (1982) “Orientations of circle graphs.” J. Graph Theory 6, no. 3, 325–341. MR 83k:05097.
Recski, A. (1974) “Enumerating partitional matroids.” Stud. Sci. Math. Hungar. 9, 247–249 (1975). MR 52.1 154.
Recski, A . (1973) “On partitional matroids with applications.” Infinite and finite sets (Colloq., Keszthely), Vol. III, pp. 1169–1179. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR 52.2 10461.
Recski, Andras (1975) “On the sum of matroids. II.” Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen), pp. 515–520. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976. MR 53.2 13004.
Reid, K.B . (1969) “Two applications of Turan’s theorem to asymmetric digraphs.” Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta.), pp. 351–353. Gordon and Breach, New York, 1970. MR 42.2 5861.
Reid, K.B. (1974) “The number of graphs on N vertices with 3 cliques.” J. London Math. Soc. (2) 8, 94–98. MR 51.1 2979.
Reid, K.B.; Thomassen, C. (1976) “Strongly self-complementary and hereditarily isomorphic tournaments.” Monatsh. Math. 81, no. 4, 291–304. MR 55.1 2640.
Reimann, Jozsef (1972) “Statistical investigations of symmetric semigroups.” Mini-Conference on Semigroup theory (Jozsef Attila Univ., Szeged), pp. 61–63. Jozsef Attila Univ., Szeged, 1973. MR 53.1 5792.
Reischer, Corina; Simovici, Dan A. (1971) “On the matrix equation PAPT = B in the two-element Boolean algebra and some applications in graph theory.” (Romanian summary), An. Sti. Univ. “AI. I. Cuza” Iasi Sect. I a Mat. (N.S.) 17, 263–274. MR 46.2 5145.
Rempel, J.; Schwolow, K.–H. (1977) “Ein Verfahren zur Faktorisierung des charakteristischen Polynoms eines Graphe.” Wiss. Z. Techn. Hochsch. Ilmenau 23, no. 4, 25–39. MR 57 #9593.
Renyi, Alfred (1967) “Probabilistic methods in combinatorial mathematics.” Combinatorial Mathematics and its Applications (Proc. Conf., Univ. North Carolina, Chapel Hill, N.C.), pp. 1–13. Univ. North Carolina Press, aChapel Hill, N.C., 1969. MR 40.1 1287.
Renyi, Alfred (1973) “Uniform flows in cascade graphs.” Probability and information theory, II, pp. 1–18. Lecture Notes in Math., Vol. 296, Springer, Berlin. MR 51.1 248.
Reva, V.N . (1979) “Smith functions and optimization on permutations consistent with a partial order.” (Russian. English summary), Issled. Operacii i ASU No. 14, 54–61. MR 81c:90049.
Revjakin, A.M . (1976) “One-point extensions of combinatorial geometries.” (Russian), Kombinatornyi Anal. Vyp. 4, 64–68. MR 57 #16113.
Rybnikov, K.A . (Editor) (1980) “Problems of combinatorial analysis.” (Russian), Mathematics: Recent Publications in foreign Science, 19.“Mir”, Moscow, 252 pp. MR 82d:05005.
Reynaud, Francoise (1975) “Theorie des ecoulements dans les graphes orientes sans circuit.” Discrete Math. 12, 37–53. MR 51.1 5378.
Ribeill, G . (1973) “Equilibre, equivalence, ordre et preordre a distance minimum d’un graphe complet.” (English summary), Math. Sci. Humaines No. 43, 71–106. MR 51.1 7943.
Ribenboim, P . (1973) “Graphs with algebraic structures.” Report of the Algebra Group, pp. 155–185. Queen’s Papers in Pure and Appl. Math., No. 36, Queen’s Univ., Kingston, Ont. MR 50.1 6916.
Ribenboim, P. (1979) “Vector space graphs.” Nanta Math. 12, no. 2, 125–132. MR 81h:05114.
Richalet, Jacques (1965) “Calcul operationnel dans un anneau fini.” C.R. Acad. Sci. Paris 260, 3541–3543. MR 31.1 1197.
Richard, Jean (1971) “Sur un type d’equations liees a certains problemes combinatoires.” C.R. Acad. Sci. Paris Ser. A-B 272, A203–A206. MR 43.1 2003.
Richardson, W.R.H . (1973) “Decomposition of chain-groups and binary matroids.” Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 463–476. Utilitas Math., Winnipeg, Man. MR 54.2 7296.
Richman, Daniel J . (1978/79) “The singular graph of lower triangular, nilpotent matrices.” Linear and Multilinear Algebra 6, no. 1, 37–49. MR 58 #10961.
Richter, Bernd (1972) “Eine Anwendung des Satzes uber induzierte Morphismen in der Kombinatorik.” J. Reine Angew. Math. 252, 139–145. MR 44.2 6515.
Richter, Bernd (1974) “Induktive Systeme in der Kombinatorik.” Arch. Math. (Basel) 25, 329–336. MR 50.1 134.
Ringel, G. (1963) “Extremal problems in the theory of graphs.” Theory of Graphs and its Applications (Proc. Sympos. Smolenice), pp. 85–90. Publ. House Czechoslovak Acad. Sci., Prague, 1964. MR 31.2 4021.
Ripoli, E. (1974) “Su un notevole sottogruppo delle proiettivita sopra una retta in un piano su un quasicorpo d’ordine 16.” Matematiche (Catania) 29, 54–63. MR 51.1 2947.
Rival, Ivan; Sands, Bill (1980) “On the adjacency of vertices to the vertices of an infinite subgraph.” J. London Math. Soc. (2) 21, no. 3, 393–400. MR 81i:05094.
Rivest, Ronald L.; Vuillemin, Jean (1975) “A generalization and proof of the Aanderaa-Rosenberg conjecture.” Seventh Annual ACM Symposium on Theory of Computing (Albuquerque, N.M.), pp. 6–11. Assoc. Comput. Mach., New York. MR 55.1 6953.
Robert, Pierre (1968) “Sur 1’axiomatique des systems generateurs, des rangs,… Applications a certains problemes combinatoires.” Bull. Soc. Math. France Suppl. Mem. 14, 192 pp. MR 38.1 101.
Roberts, F.S. (1969) “Indifference graphs.” in F. Harary (ed.), Proof Techniques in Graph Theory, Academic Press, N.Y., 139–146.
Roberts, F.S. (1969) “On the boxicity and cubicity of a graph.” in W.T. Tutte (ed.), Recent Progress in Combinatorics, Academic Press, New York, 301–310.
Roberts, F.S.; Baker, K.A.; Fishburn, P.C. (1970) “A new characterization of partial orders of dimension two.” Annals of N.Y. Acad, of Sci., Vol. 175, 23–24.
Roberts, F.S. (1970) “On nontransitive indifference.” Jour. of Math. Psychology, Vol. 7, 243–258.
Roberts, F.S. (1971) “Homogeneous families of semiorders and the theory of probabilistic consistency.” Jour. of Math. Psychology, Vol. 8, 248–263.
Roberts, F.S. (1971) “On the compatability between a graph and a simple order.” Jour. of Combinatorial Theory, Vol. 11, 28–38.
Roberts, F.S.; Spencer, J.H. (1971) “A characterization of clique graphs.” J. Comb. Theory, 10B, 102–108.
Roberts, F.S.; Baker, K.A.; Fishburn, P.C. (1972) “Partial orders of dimension 2.” Networks, Vol. 2, 11–28.
Roberts, F.S. (1972) “What if utility functions do not exist?” Theory and Decision, Vol. 3, 126–139.
Roberts, Fred S . (1973) “Structural characterizations of stability of signed digraphs under pulse processes.” Graphs and combinatorics (Proc. Capital Conf. on Graph Theory and Combinatorics, George Washington Univ., Washington, D.C.), pp. 330–338. Lecture Notes in Math., Vol. 406, Springer, Berlin, 1974. MR 50.2 12792.
Roberts, Fred S.; Brown, Thomas A. (1975) “Signed digraphs and the energy crisis.” Amer. Math. Monthly 82, 577–594. MR 51.1 5195.
Roberts, F.S . (1976) “Discrete mathematical models with applications to social, biological and environmental problems.” Prentice-Hall, Englewood Cliffs, N.J., Feb.
Roberts, F.S. (1978) “Graph theory and its applications to problems of society.” NSF-CBMS Monograph #29, SIAM Publications, Philadelphia.
Roberts, F.S. (1978) “Food webs, competition graphs, and the boxicity of ecological phase space.” in Y. Alavi and D. Lick (eds.), Theory and Application of Graphs, Springer-Verlag Lecture Notes, #642, 477–490.
Roberts, F.S. (1979) “Measurement theory, with applications to decisionmaking, utility, and the social sciences.” Addison Wesley, Reading, MA. (Book in the Encyclopedia of Mathematics and its Applications series).
Roberts, F.S. (1979) “Graph theory and the social sciences.” in R. Wilson and L. Beinecke (eds.), Applications of Graph Theory, Academic Press, 255–291.
Roberts, F.S. (1979) “Indifference and seriation.” in F. Harary (ed.), Advances in Graph Theory, N.Y. Acad, of Sciences, 171–180.
Roberts, F.S. (1979) “On the mobile radio frequency assignment problem and the traffic light phasing problems.” Annals, N.Y. Acad, of Sci., Vol. 319, 466–483.
Roberts, F.S.; Opsut, R.J. (1981) “On the fleet maintenance, mobile radio frequency, task assignment, and traffic phasing problems.” in G. Chartrand, et al. (eds.), The Theory and Applications of Graphs, Wiley, New York, 479–492.
Roberts, F.S.; Cozzens, M.B. (1982) “Double semiorder and double indifference graphs.” SIAM Jour, on Algebraic and Discrete Methods, Vol. 3, 566–583.
Roberts, F.S. (1983) “Applications of edge coverings by cliques.” Discrete Applied Math., to appear.
Roberts, F.S.; Steif, J. (1983) “A characterization of competition graphs of arbitrary digraphs.” Discrete Applied Math., Vol. 6, 323–326.
Roberts, F.S.; Cozzens, M.B. (1983) “Computing the boxicity of a graph by covering its complement by cointerval graphs.” Discrete Applied Math., Vol. 6, 217–228.
Roberts, F.S.; Opsut, R.J. (1983) “i-colorings, I-phasings, and I-intersection assignments for graphs, and their applications.” Networks, Vol. 13, 327–345.
Roberts, F.S.; Opsut, R.J. (1983) “Optimal I-intersection assignments for graphs: a linear programming approach.” Networks, Vol. 13, 317–326.
Roberts, F.S. (1984) “Applied combinatorics.” Prentice-Hall, Englewood Cliffs, N.J.
Roberts, F.S. (1984) “Applications of the theory of meaningfulness to order and matching experiments.” in E. DeGreef and J. Van Buggenhaut (eds.), Trends in Mathematical Psychology, Elsevier-North-Holland, Amsterdam, 283–292.
Roberts, F.S. “On the theory of meaningfulness of ordinal comparisons in measurement.” Measurement, to appear.
Roberts, F.S.; Cozzens, M.B. “k-Suitable sets of arrangements and the boxicity of a graph.” J. Comb. amp; Info. Sci., to appear.
Roberts, John (1976) “A sufficient condition for k-path Hamiltonian digraphs.” Bull. Amer. Math. Soc. 82, no. 1, 63–65. MR 53.1 200.
Roberts, Leigh (1974) “All erections of a combinatorial geometry and their automorphism groups.” Combinatorial mathematics, III (Proc. Third Australian Conf., Univ. Queensland, St. Lucia), pp. 210–213. Lecture Notes in Math., vol. 452, Springer, Berlin, 1975. MR 51.2 10134.
Roberts, Fred S. (1976) “Food webs, competition graphs, and the boxicity of ecological phase space.” Theory and applications of graphs (Proc. Internat. Conf., Western Mich. Univ., Kalamazoo, Mich.), pp. 477–490. Lecture Notes in Math., Vol. 642, Springer, Berlin, 1978. MR 58 #20617.
Robinson, D.F. (1972) “Optimization of finite sets.” Proceedings of the First Australian Conference on Combinatorial Mathematics (Univ. Newcastle, Newcastle), pp. 39–52. Univ. of Newcastle Res. Associates, Newcastle. MR 50.2 12230.
Robinson, D.F. (1974) “Directed graphs in operational research.” New Zealand Oper. Res. 2, no. 1, 1–15. MR 53.2 10317.
Robinson, David Foster; Foulds, Les R. (1980) “Digraphs: theory and techniques.” Gordon & Breach Science Publishers, New York, xv+256 pp. MR 81k:05055.
Robinson, Robert W. (1970) “Enumeration of acyclic digraphs.” Proc. Second Chapel Hill Conf. on Combinatorial Mathematics and its Applications (Univ. North Carolina, Chapel Hill, N.C.), pp. 391–399. Univ. North Carolina, Chapel Hill, N.C. MR 43.1 1891.
Robinson, Robert W. (1971) “Counting labeled acyclic digraphs.” New directions in the theory of graphs (Proc. Third Ann Arbor Conf. on Graph Theory, Univ. of Michigan, Ann Arbor, Mich.), pp. 239–273. Academic Press, New York, 1973. MR 51.1 249.
Robinson, Robert W. (1977) “Counting strong digraphs.” J. Graph Theory 1, no. 2, 189–190. MR 56.1 180.
Robinson, R.W. (1976) “Counting unlabeled acyclic digraphs.” Combinatorial mathematics, V (Proc. Fifth Austral. Conf., Roy. Melbourne Inst. Tech., Melbourne), pp. 28–43. Lecture Notes in Math., Vol. 622, Springer, Berlin, 1977. MR 57 #16129.
Robinson, R.W. (1977) “Asymptotic number of self-converse oriented graphs.” Combinatorial mathematics (Proc. Internat. Conf. Combinatorial Theory, Australian Nat. Univ., Canberra), pp. 255–266, Lecture Notes in Math., 686, Springer, Berlin, 1978. MR 80m:05069.
Robinson, R.W. (1981) “Counting graphs with a duality property.” Combinatorics (Swansea), pp. 156–186, London Math. Soc. Lecture Note Ser., 52, Cambridge Univ. Press, Cambridge. MR 83c:05071.
Rodionov, V.I. (1982) “Some recursive relations in finite topologies.” (Russian), Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 114, 174–179, 221. MR 83k:05010.
Rohmel, Joachim (1975) “On smooth incidence structures with constant block size and a characterization of finite projective spaces.” J. Combinatorial Theory Ser. A 18, 226–230. MR 50.2 9626.
Romanowicz, Zbigniew (1972) “A remark on a theorem of Richardson.” (Polish. English and Russian summaries), Prace Nauk. Inst. Mat. Fiz. Teoret. Politechn. Wroclaw. No. 4 Ser. Studia i Materialy No. 4 Grafy i Siece, 43–46.
Romanowicz, Zbigniew (1972) “Characterizations of sets and their applications to theory of graphs.” (Polish and Russian summaries), Prace Nauk. Inst. Mat. Fiz. Teoret. Politechn. Wroclaw. Ser. Studia i Materialy No. 6 Zagadnienia kombinatoryczne, 3–11. MR 53.2 12963.
Roos, C. (1980) “On the feasibility of certain intersection matrices.” Delft Progr. Rep. 5, no. 4, 215–226. MR 83a:05096.
Rose, Donald J.; Tarjan, R. Endre; Lueker, George S. (1976) “Algorithmic aspects of vertex elimination on graphs.” SIAM J. Comput. 5, no. 2, 266–283. MR 53.2 12077.
Rosen, Barry K. (1975) “Deriving graphs from graphs by applying a production.” Acta Informat. 4, no. 4, 337–357. MR 53.2 7868.
Rosen, Robert (1965) “Some comments on re-establishability.” Bull. Math. Biophys. 27, special issue, 11–14. MR 33.2 3960.
Rosenberg, Ivo (1973) “The number of maximal closed classes in the set of functions over a finite domain.” J. Combinatorial Theory Ser. A 14, 1–7. MR 47.1 3189.
Rosenblatt, David (1973) “Note to the editor: “On the graphs and asymptotic forms of finite Boolean relation matrices and stochastic matrices”.” (Naval Res. Logist. Quart. 4 (1957), 151–167). J. Appl. Probability 10, 914. MR 50.1 362.
Rosenfeld, M. [Rosenfeld, Moshe] (1972) “Antidirected Hamiltonian paths in tournaments.” J. Combinatorial Theory Ser. B 12, 93–99. MR 44.1 2670.
Rosenfeld, M. [Rosenfeld, Moshe] (1978) “Distance geometry and graphs.” Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 639–648, Congress. Numer., XXI, Utilitas Math., Winnipeg, Man. MR 80j:05060.
Rosengren, Karl Erik (1975) “Ordered pairs of arcs and demiarcs.” J. Mathematical Sociology 4, no. 1, 149–155. MR 53.1 7544.
Rosenstiehl, P. (1974) “Bicycles et diagonales des graphes planaires.” (English summary), Colloque sur la Theorie des Graphes (Paris). Cahiers Centre Etudes Recherche Oper. 17, no. 2-3-4, 365–383. MR 53.2 13011.
Rosenstiehl, P. (1975) “Caracterisation des graphes planaires par une diagonale abstraite.” (English summary), Proceedings of the Fifth British combinatorial Conference (Univ. Aberdeen, Aberdeen), pp. 521–527. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976. MR 53.2 13012.
Rosenstiehl, Pierre (1976) “Solution algebrique du probleme de Gauss sur la permutation des points d’intersection d’une ou plusieurs courbes fermees du plan.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 283, no. 8, Ai, A551–A553. MR 58 #10883.
Ross, Ian C.; Harary, Frank (1959) “A description of strengthening and weakening members of a group.” Sociometry 22, 139–147. MR 22.1 675.
Rota, Gian-Carlo (1964) “On the foundations of combinatorial theory. I. Theory of Mobius functions.” Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 2, 340–368. MR 30.2 4688.
Rota, Gian-Carlo (1969) “Baxter algebras and combinatorial identities. I, II.” Bull. Amer. Math. Soc. 75, 325–329; ibid. 75, 330–334. MR 39.2 5387.
Rota, Gian-Carlo; Harper, L.H. (1971) “Matching theory, an introduction.” Advances in Probability and Related Topics, Vol. 1, pp. 169–215. Dekker, New York. MR 44.1 89.
Rota, Gian-Carlo; Sagan, Bruce (1980) “Congruences derived from group action.” European J. Combin. 1, no. 1 67–76. MR 81g:05018.
Rothaus, O.S. (1976) “On “bent” functions.” J. Combinatorial Theory Ser. A 20, no. 3, 300–305. MR 53.2 7797.
Rothschild, Bruce (1965) “The decomposition of graphs into a finite number of paths.” Canad. J. Math. 17, 468–479. MR 30.2 5304.
Rothschild, B.; Whinston, A. (1967) “Maximal two-way flows.” SIAM J. Appl. Math. 15, 1228–1238. MR 36.2 5034.
Rottenberg, R.R. (1973) “On ordinary planes.” Discrete Math. 5, 395–401. MR 47.2 9429.
Roy, Bernard. (1959) “Transitivite et connexite.” C.R. Acad. Sci. Paris 249, 216–218. MR 22.1 677.
Roy, Bernard (1970) “Algebre moderne et theorie des graphes (orientee vers les sciences economiques et sociales). Tome II: Applications et problemes specifiques.” Contribution de Michel Horps. Finance et Economie Appliquee, Vol. 32. Dunod, Paris, xxiv+759 pp. MR 41.1 5039.
Rubin, Frank (1974) “A search procedure for Hamilton paths and circuits.” J. Assoc. Comput. Mach. 21, 576–580. MR 50.1 1973.
Rupp, Marta (1972) “Inversion of sparse matrices with the aid of graphs.” (Hungarian. English summary), Mat. Kapok 23, 163–171 (1973). MR 49.2 10714.
Ruscitti, A. (1971) “Un metodo per la ricerca su matrice delle funzioni di Grundy per un digrafo.” (English summary), Studi di probabilita, statistica e ricerca operativa in onore di Giuseppe Pompilj, pp. 572–582. Edizioni Oderisi, Gubbio. MR 50.2 9676.
Rutkas, A.G.; Hirgii, N.I. (1974) “Semigroups of monomorphisms of graphs in discrete lattices.” (Russian), Teor. Funkcii Funkcional. Anal, i Prilozen. Vyp. 19, 111–125, 160. MR 54.1 5037.
Rybnikov, K.A. (1972) “Introduction to combinatorial analysis.” (Russian), Izdat. Moskov. Univ., Moscow, 255 pp. MR 50.1 118.
Ryser, H.J. (1974) “Indeterminates and incidence matrices.” Combinatorics, Part 1: Theory of designs, finite geometry and coding theory (Proc. Advanced Study Inst, on Combinatorics, Breukelen), pp. 3–17. Math. Centre Tracts, No. 55, Math. Centrum, Amsterdam. MR 50.1 6891.
Sabidussi, Gert (1959/60) “Graph multiplication.” Math. Z. 72, 446–457. MR 35.1 80.
Sabidussi, G. (1973) “Subdirect representations of graphs.” Infinite and finite sets (Colloq., Keszthely), Vol. III, pp. 1199–1226. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR 51.2 10168.
Sabidussi, Gert (1976) “Weak separation lattices of graphs.” Canad. J. Math. 28, no. 4, 691–724. MR 55.2 10322.
Sabidussi, Gert (1978) “Uniforme Raume in der Graphentheorie.” 10. Steiermarkisches Mathematisches Symposium (Staft Rein, Graz). Ber. Math.-Statist. Sekt. Forsch. Graz No. 100–105, Ber. No. 104, 5 pp. MR 80m:05096.
Sachs, David (1970) “Graphs, matroids, and geometric lattices.” J. Combinatorial Theory 9, 192–199. MR 41.2 6716.
Sachs, David (1971) “Geometric mappings on geometric lattices.” Canad. J. Math. 23, 22–35. MR 43.1 82.
Sachs, Horst (1964) “Beziehungen zwischen den in einem Graphen enthaltenen Kreisen und seinem charakteristischen Polynom.” Pub. Math. Debrecen 11, 119–134. MR 30.1 2491.
Sachs, H. (1965) “Bemerkung zur Konstruktion zyklischer selbstkomplementarer gerichteter Graphen.” Wiss. Z. Techn. Hochsch. Ilmenau 11, 161–162. MR 33.2 5522.
Sachs, H. (1966) “Uber Teller, Faktoren und charakteristische Polymome von Graphen. I.” Wiss. Z. Techn. Hochsch. Ilmenau 12, 7–12. MR 33.1 2571.
Sachs, Horst (1969) “On the Berge conjecture concerning perfect graphs.” Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta.), pp. 377–384. Gordon and Breach, New York, 1970. MR 42.2 7549.
Sachs, H. [Sachs, Horst] (1976) “On a theorem connecting the factors of a regular graph with the eigenvectors of its line graph.” Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely), Vol. II, pp. 947–957, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam, 1978. MR 81c:05065.
Sachs, H. [Sachs, Horst] (1977) “Uber einige graphentheoretisch-kombinatorische Problemkreise.” Contributions to graph theory and its applications (Internat. Colloq., Oberhof) (German), pp. 201–217, Tech. Hochschule Ilmenau, Ilmenau. MR 82d:05060.
Sachs, Horst; Stiebitz, M. (1978) “Automorphism group and spectrum of a graph.” Algebraic methods in graph theory, Vol. I, II (Szeged), pp. 657–670, Colloq. Math. Soc. Janos Bolyai, 25, North-Holland, Amsterdam, 1981. MR 83b:05070.
Sackov, V.N. (1972) “Mappings of a finite set with constraints on contours and height.” (Russian. English summary), Teor. Verojatnost. i Primenen. 17, 679–694. MR 47.1 1095.
Sackov, V.N. (1973) “Random mappings of bounded height.” (Russian. English summary), Teor. Verojatnost. i Primenen. 18, 122–132. MR 47.1 1096.
Sagan, Bruce (1982) “Enumeration of partitions with hooklengths.” European J. Combin. 3, no. 1, 85–94. MR 83i:05011.
Saito, N. [Nobuji Saito]; Nishizeki, T. (Editors) (1980) “Graph theory and algorithms.” Proceedings of the Symposium held at the Research Institute of Electrical Communication, Tohoku University, Sendai, October 24–25, 1980. Lecture Notes in Computer Science, 108. Springer-Verlag, Berlin-New York, 1981. vi+216 pp. MR 83i:05005.
Saks, Michael (1980) “Dilworth numbers, incidence maps and product partial orders.” SIAM J. Algebraic Discrete Methods 1, no. 2, 211–215. MR 81j:05025.
Salkin, Ju. A. (1963) “On k-regular imbeddings of graphs in Euclidean spaces.” (Russian), Uspehi Mat. Nauk 18, no. 4 (112), 195–199. MR 27.2 4221.
Salomaa, Arto (1981) “On color-families of graphs.” Ann. Acad. Sci. Fenn. Ser. A I Math. 6, no. 1, 135–148. MR 83i:05032.
Salvi Zagaglia, Norma (1978) “Construction of self-converse oriented graphs.” (Italian), Istit. Lombardo Accad. Sci. Lett. Rend. A 112, no. 1, 123–130 (1979). MR 81c:05043.
Sahbazjan, K.V.; Tuskina, T.A. (1977) “The statistical efficiency of algorithms for the solution of a problem on partitioning the vertices of a graph.” (Russian. English summary insert), Kibernetika (Kiev), no. 5, 38–43. MR 57#18785.
Sakarovitch, M. (1975) “Quasi-balanced matrices.” Math. Programming 8, 382–386. MR 52.1 439.
Sallee, G.T. (1967) “Incidence graphs of convex polytopes.” J. Combinatorial Theory 2, 466–506. MR 35.2 7198.
Samardziski, Aleksandar (1974) “A class of finite Sperner spaces.” Abh. Math. Sem. Univ. Hamburg 42, 205–211. MR 50.2 10998.
Samkolovic, L. [Szamkolowicz, Lucjan] (1971) “On the problems connected with the concept of the cut of the finite anti-symmetric directed graph.” (Russian. English summary), Bull. Acad. Polon. Sci. Ser. Sci. Math. Astronom. Phys. 19, 691–693. MR 48.1 3787.
Samoilenko, S.I.; Zaharov, V.K.; Kozyrev, V.P. (Editors) (1973) “Proceedings of the Second All-Union Seminar of Combinatorial Mathematics (Moscow, 1973). Part 2.” Voprosy Kibernet. (Moscow) No. 15 (1975). Izdat. “Sovetskoe Radio”, Moscow, 1975, pp. 1–110. MR 58 #248.
Sampathkumar, E.; Kulkarni, K.H. (1973) “Transitive digraphs and topologies on a set.” J. Karnatak Univ. Sci. 18, 266–273. MR 50.2 12793.
Samuel, Isaac (1976) “Diagramme de la table d’un groupe fini.” (English summary), C.R. Acad. Sci. Paris Ser. A-B 282, no. 5, Aii, A289–A292. MR 55.2 9589.
Sapak, Oldrich (1977) “Representation of the finite directed acyclic graph.” Arch. Math. (Brno) 13, no. 2, 111–116. MR 58 #5347.
Saparov, M. (1973) “The coverings of a random bichromatic graph.” (Russian. Turkmen and English summaries), Izv. Akad. Nauk Turkmen. SSR Ser. Fiz.-Tehn. Him. Geol. Nauk, no. 6, 18–26. MR 52.1 4371
Sapozenko, A.A. (1967) “Metric properties of almost all functions of the algebra of logic.” (Russian), Diskret. Analiz No. 10, 91–119. MR 36.2 6328.
Scheid, Francis (1960) “A tournament problem.” Amer. Math. Monthly 67, 39–41. MR 23A A72.
Scheid, Harald (1971) “Funktionen uber lokal endlichen Halbordnungen. II.” Monatsh. Math. 75, 44–56. MR 45.1 208.
Schirmer, Helga (1971) “Biconnected multifunctions of trees which have an end point as fixed point or coincidence.” Canad. J. Math. 23, 461–467. MR 43.2 6918.
Schmeichel, Edward F. (1981) “The basis number of a graph.” J. Combin. Theory Ser. B 30, no. 2, 123–129. MR 83e:05071.
Schmidt, Gunther (1976) “Eine Uberlagerungstheorie fur Wurzelgraphen.” Graphen, Algorithmen, Datenstrukturen (Zweite Fachtagung uber Graphentheoretische Konzepte der Informatik, Gottingen), pp. 65–76. Appl. Comput. Sci., Vol. 4, Hanser, Munich. MR 58 #10624.
Schnorr, C.P. (1974) “On maximal merging of information in Boolean computations.” automata, languages and programming (Second Colloq., Univ. Saarbrucken, Saarbrucken), pp. 294–300. Lecture Notes in Comput. Sci., Vol. 14, Springer, Berlin. MR 55.2 12570.
Schonheim, J. (1973) “On a problem of Daykin concerning intersecting families of sets.” Combinatorics (Proc. British combinatorial conf., Univ. Coll. Wales, Aberystwyth), pp. 139–140. London Math. Soc. Lecture Note Ser., No. 13, Cambridge Univ. Press, London, 1974. MR 50.2 9598.
Schonheim, J. (1975) “Partition of the edges of the directed complete graph into 4-cycles.” Discrete Math. 11, 67–70. MR 51.1 251.
Schrijver, A. (1980) “A counterexample to a conjecture of Edmonds and Giles.” Discrete Math. 32, no. 2, 213–215. MR 81k:05084.
Schurmann, A. (1966) “Distribution of circuits in a finite graph and application of graphs to programming theory.” (Russian summary), Bull. Acad. Polon., Sci. Ser. Sci. Math. Astronom. Phys. 14, 515–518. MR 34.2 7278.
Schwabhauser, Wolfram (1964/65) “Zum Begriff der symbolischen Potenz.” Math.-Phys. Semesterber. 11, 201–211. MR 31.1 1204.
Schwarz, Stefan (1970) “On the semigroup of binary relations on a finite set.” Czechoslovak Math. J. 20 (95), 632–679. MR 45.2 5251.
Scoble, Jennifer A. (1976) “A combinatorial approach to map theory.” Combinatorial mathematics, V (Proc. Fifth Austral. Conf., Roy. Melbourne Inst. Tech., Melbourne), pp. 197–205. Lecture Notes in Math., Vol. 622, Springer, Berlin, 1977. MR 57 #12279
Scotti, Fernanda; Torre, Anna (1978) “Characterizations of the line graph of BIB designs.” (Italian. English summary), Boll. Un. Mat. Ital. A (5) 15, no. 3, 660–666. MR 80g:05058.
Sedlacek, Jiri (1959) “Uber Inzidenzmatrizen gerichteter Graphen.” (Czech, Russian and German summaries), Casopis Pest. Mat. 84, 303–316. MR 23.A A811.
Sedlacek, Jiri (1975) “Perfect and quasiperfect graphs.” (Czech. English summary), Casopis Pest. Mat. 100, no. 2, 135–141. MR 54.1 5055.
Sedzimir, Zbigniew (1976) “The concept of describing multigraphs and dimultigraphs by means of incidence lists.” (Polish. English and Russian summaries), Prace Nauk. Inst. Cybernet. Techn. Politechn. Wroclaw. No. 25 Ser. Stud, i Materialy No. 17, 129–148. MR 57.1 2977.
Seese, D.G. (1977) “Partitions for trees.” Internat. Colloq., Oberhof, (German), pp. 235–238, Tech. Hochschule Ilmenau, Ilmenau. MR 82b:05056.
Segre, Beniamino (1975) “Sugli insiemi finiti di punti di uno spazio grafico.” (Italian summary), Rend. Mat. (6) 8, 37–63. MR 51.2 10129.
Seidel, J.J. (1978) “The pentagon.” Second International Conference on Combinatorial Mathematics (New York), pp. 497–507, Ann. New York Acad. Sci., 319, New York Acad. Sci., New York, 1979. MR 81e:05004.
Seidel, J.J.; Taylor, D.E. (1978) “Two-graphs, a second survey.” Algebraic methods in graph theory, Vol. I, II (Szeged), pp. 689–711, Colloq. Math. Soc. Janos Bolyai, 25, North-Holland, Amsterdam, 1981. MR 83f:05070.
Seidvasser, M.A. (1972) “Optimal ordering of the vertices of a directed tree.” (Russian. English summary insert), Kibernetika (Kiev), no. 3, 134–139. MR 48.1 139.
Seier, Werner (1974) “Der kleine Satz von Desargues in affinen Hjelmslev-Ebenen.” Geometriae Dedicata 3, 215–219. MR 50.1 1119.
Seitz, K.; Puskas, Cs. (1977) “Investigations of group graphs.” DM 77-2. Department of Mathematics, Karl Marx University of Economics, Budapest. 21 pp. MR 56.2 15485.
Sekanina, Milan (1975) “Graphs and betweenness.” Mat. Casopis Sloven. Akad. Vied 25, no. 1, 41–47. MR 54.2 10086.
Serdjukov, A.I. (1979) “The problem of finding a Hamilton cycle (contour) in the presence of exclusions.” (Russian), Upravljaemye Sistemy No. 19, 57–64, 79–80. MR 82c:05068.
Sevrin, L.N.; Filippov, N.D. (1970) “Partially ordered sets and their comparability graphs.” (Russian), Sibirsk. Mat. Z. 11, 648–667. MR 42.2 4451.
Seymour, P.D. (1973) “On incomparable collections of sets.” Mathematika 20, 208–209.
Seymour, P.D. (1974) “A note on a combinatorial problem of Erdos and Hajnal.” J. London Math. Soc. (2) 8, 681–682. MR 50.1 1894.
Seymour, P.D.; Welsh, D.J.A. (1975) “Combinatorial applications of an inequality from statistical mechanics.” Math. Proc. Cambridge Philos. Soc. 77, 485–495. MR 51.2 12554.
Seymour, P.D. (1975/76) “The forbidden minors of binary clutters.” J. London Math. Soc. (2) 12, no. 3, 356–360. MR 52.2 13404.
Seymour, P.D. (1979) “On Tutte’s characterization of graphic matroids.” Combinatorics 79 (Proc. Colloq., Univ. Montreal, Montreal, Que.), Part I. Ann. Discrete Math. 8, 83–90. MR 82a:05041.
Seymour, P.D. (1981) “Nowhere-zero 6-flows.” J. Combin. Theory Ser. B 30, no. 2, 130–135. MR 82j:05079.
Shapiro, Harold N. (1970) “On the counting problem for monotone Boolean functions.” Comm. Pure Appl. Math. 23, 299–312. MR 41.1 3288.
Sharp, H., Jr. (1971/72) “Enumeration of transitive, step-type relations.” Acta Math. Acad. Sci. Hungar. 22, 365–371. MR 50.1 130.
Shatoff, Larry D. (1972) “Binary multiples of combinatorial geometries.” Rend. Sem. Mat. Univ. Padova 48, 95–104 (1973). MR 49.2 10582.
Shee, S.C. (1970) “On quasigroup graphs.” Nanyang Univ. J. Part I 4, 44–66. MR 45.2 6695.
Shee, S.C. (1971) “On a class of point-symmetric graphs induced by quasigroups.” Nanta Math. 5, no. 1, 92–107. MR 47.2 8347.
Shee, S.C. (1971) “The Petersen graph represented as a point-symmetric quasigroup graph.” Nanta Math. 5, no. 1, 108–110. MR 45.2 5031.
Shee, S.C. (1973) “Algebraic extension of graphs.” Nanta Math. 6, no. 1, 80–93. MR 52.1 175.
Shee, S.C. (1974) “A note on the C-product of graphs.” Nanta Math. 7, no. 2, 105–108. MR 52.1 296.
Shee, S.C. (1979) “On algebraic graphs.” Proceedings of the First Franco-Southeast Asian Mathematical Conference (Singapore), Vol. II. Southeast Asian Bull. Math., Special Issue b, 295–300. MR 82g:05081.
Shee, Sze Chin (1980) “Problems in graph theory. VII.” Southeast Asian Bull. Math. 4, no. 2, 86–90. MR 83k:05038b.
Shein, Norman P.; Frisch, Ivan T. (1970) “Sufficient conditions for realizability of vertex-weighted directed graphs.” IEEE Trans. Circuit Theory CT-17, 499–505. MR 42.2 9087.
Shelah, Saharon (1974) “A substitute for Hall’s theorem for families with infinite sets.” J. Combinatorial Theory Ser. A 16, 199–208. MR 48.2 10824.
Shinoda, Shoji (1968) “On Hamilton circuits of a directed graph.” Electron. Commun. Japan 51, no. 7, 46–47. MR 41.1 1576.
Sinoda, Shoji (1968) “Finding all possible directed trees of a directed graph.” Electron. Commun. Japan 51, no. 7, 45–46. MR 43.1 3159.
Shinoda, Shoji (1971) “Systems of operations in finding some subgraphs of a directed graph.” Electron. Commun. Japan 54, no. 7, 1–7. MR 46.2 8893.
Shiraki, Mitsunobu (1968) “On finite topological spaces.” Rep. Fac. Sci. Kagoshima Univ. 1, 1–8. MR 42.2 5213a.
Shiraki, Mitsunobu (1969) “On finite topological spaces. II.” Rep. Fac. Sci. Kagoshima Univ. 2, 1–15. MR 42.2 5213b.
Shkurba, V.V. [Skurba, V.V.] (1967) “Ordering problems. ” Kibernetika (Kiev), no. 2, 63–65 (Russian); translated as Cybernetics 3, no. 2, 49–51 (1969). MR 42.1 2793.
Shneyder, B.N. [Sneider, B.N.] (1970) “Algebra of sets applied to solution of graph theory problems. ” Izv. Akad. Nauk SSSR Tehn. Kibernet., no. 3, 109–114 (Russian); translated as Engrg. Cybernetics 8, no. 3, 521–526 (1971). MR 43.2 4714.
Shult, E.E. (1973) “Geometric characterizations in finite group theory.” Proceedings of the Second International Conference on the Theory of Groups (Australian Nat. Univ., Canberra), pp. 641–654. Lecture Notes in Math., Vol. 372, Springer, Berlin, 1974. MR 50.2 13271.
Sibirskii, V.K. (1980) “ψ-weight of a graph.” (Russian), Izv. Akad. Nauk Moldav. SSR Ser. Fiz.-Tehn. Mat. Nauk, no. 1, 15–19, 92. MR 82a:05080.
Sierpinski, W. (1964) “Sur les families d’ensembles infinis des nombres naturels.” Fund. Math. 56, 115–116. MR 31.2 3342.
Simic, Slobodan K. (1978) “On the decomposition of the line (total) graphs with respect to some binary operations.” Publ. Inst. Math. (Beograd) (N.S.) 24 (38), 163–172. MR 80m:05099.
Simic, Slobodan K. (1980) “Graphs which are switching equivalent to their complementary line graphs. I.” Publ. Inst. Math. (Beograd) (N.S.) 27 (41), 229–235. MR 82m:05077.
Simmons, Gustavus J. (1981) “Maximal non-Hamilton-laceable graphs.” J. Graph Theory 5, no. 4, 407–415. MR 83g:05050.
Simoes-Pereira, J.M.S. (1968) “Boolean permanents, permutation graphs and products.” SIAM J. Appl. Math. 16, 1251–1254. MR 38.2 3180.
Simoes-Pereira, J.M.S. (1974) “Matroids, graphs and topology.” Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla.), pp. 145–155. Congressus Numerantium, No. X, Utilitas Math., Winnipeg, Man. MR 50.2 9635.
Simoes-Pereira, J.M.S. (1975) “On matroids on edge sets of graphs with connected subgraphs as circuits. II.” Discrete Math. 12, 55–78. MR 54.2 7298.
Simoes-Pereira, J.M.S. (1980) “Erdos-Hajnal well-orderings and n-degenerate graphs.” Abh. Math. Sem. Univ. Hamburg 50, 101–107. MR 82b:05112.
Simoes-Pereira, J.M.S.; Zamfirescu, Christina M. (1982) “Submatrices of non-tree-realizable distance matrices.” Linear Algebra Appl. 44, 1–17. MR 83j:05061.
Sims, Julie; Holton, D.A. (1978) “Stability of Cartesian products.” J. Combin. Theory Ser. B 25, no. 3, 258–282. MR 83b:05111.
Sinkevic, V.K. (1974) “Characteristic properties of homomorphisms and correspondences of graphs, and their applications.” (Russian), Informational questions of semiotics, linguistics and automatic translation, No. 4, pp. 77–93 (errata insert). Akad. Nauk SSSR Vsesojuz. Inst. Naucn. i Tehn. Informacii, Moscow. MR 51.2 12622.
Skorobogatov, V.A. (1978) “Matrices of layers and isometry of graphs.” (Russian), Vycisl. Sistemy No. 77, 20–23, 114. MR 81g:05080.
Skrien, D. (1980) “Interval graphs, chronological orderings, and related matters.” doctoral dissertation, University of Washington, Seattle, Wash.
Skrien, Dale J. (1982) “A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs.” J. Graph Theory 6, no. 3, 309–316. MR 83k:05099.
Skupien, Z. (1980) “On homogeneously traceable non-Hamiltonian digraphs and oriented graphs.” The theory and applications of graphs (Kalamazoo, Mich.), pp. 517–527, Wiley, New York, 1981. MR 82m:05052.
Slater, P.J. (1976) “A note on pseudointersection graphs.” J. Res. Nat. Bureau of Standards, 80B, 441–445.
Slater, Peter J. (1982) “Counterexamples to Randic’s conjecture on distance degree sequences for trees.” J. Graph Theory 6, no. 1, 89–92. MR 83b:05055.
Smadici, C.; Smadici, L. (1972) “On the isomorphism of digraphs.” (Romanian summary), An. Sti. Univ. “Al. I. Cuza” Iasi Sect. I a Mat. (N.S.) 18, 297–298. MR 48.1 1966.
Smith, Cedric A.B. (1974) “Patroids.” J. Combinatorial Theory Ser. B 16, 64–76. MR 48.2 8277.
Smith, David A. (1969) “Incidence functions as generalized arithmetic functions. II.” Duke Math. J. 36, 15–30. MR 39.2 4084.
Smith, David A. (1970/71) “Multiplication operators on incidence algebras.” Indiana Univ. Math. J. 20, 369–383. MR 41.2 8318.
Smith, D.H. (1976) “An improved version of Lloyd’s theorem.” Discrete Math. 15, no. 2, 175–184. MR 53.2 13046.
Smoliar, Stephen W. (1975) “On the free matrix representation of transversal geometries.” J. Combinatorial Theory Ser. A 18, 60–70. MR 50.2 9636.
Smyth, M.B. (1974) “Unique-entry graphs, flowcharts, and state diagrams.” Information and Control 25, 20–29. MR 49.1 6672.
Sokarovski, Risto (1977) “A generalized direct product of graphs.” Publ. Inst. Math. (Beograd) (N.S.) 22 (36), 267–269. MR 58 #5416.
Sokuev, V.N. (1967) “Generalizations of Hall’s enumeration principle.” (Russian), Ural. Gos. Univ. Mat. Zap. 6, tetrad 1, 124–143. MR 36.1 2701.
Solodovnik, A.V.; Yavors’kii, E.B. (1981) “Schematic description of the complexity of a conceptual system.” (Russian), Akad. Nauk Ukrain. SSR Inst. Mat. Preprint, no. 2 Svoistva Grafov Nekotor. Klassov, 27–29, 31. MR 83b:05112.
Solomon, Louis (1977) “Partition identities and invariants of finite groups.” J. Combinatorial Theory Ser. A 23, no. 2, 148–175. MR 56.2 8677.
Solomon, Louis (1978) “Partially ordered sets with colors.” Proc. Sympos. Pure Math., Ohio State Univ., Columbus, Ohio, pp. 309–329, Proc. Sympos. Pure Math., XXXIV, Amer. Math. Soc., Providence, R.I., 1979. MR 80c:05011.
Soltan, P.S.; Zambickii, D.K.; Prisakaru, K.F. (1973) “Extremal problems on graphs and algorithms for their solution.” (Russian), Izdat. “Stiinca”, Kishinev. 90 pp. MR 49.2 8901.
Sotskov, Ju. N.; Tanaev, V.S. (1974) “The enumeration of acyclic digraphs generated by a mixed graph.” (Russian), Vesci Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk, no. 2, 16–21, 137. MR 50.1 4407.
Sotskov, Ju. N.; Tanaev, V.S. (1976) “An approach to the enumeration of the directed acyclic graphs that are generated by a mixed graph.” (Russian), Vesci Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk, no. 5, 99–102, 142. MR 55.2 12565.
Sotteau, D. (1976) “Decomposition of Kn * into circuits of odd length.” Discrete Math. 15, no. 2, 185–191. MR 5?.2 7832.
Soukup, J. (1975) “On minimum cost networks with nonlinear costs.” SIAM J. Appl. Math. 29, no. 4, 571–581. MR 52.2 16900.
Sozanski, Tadeusz (1980) “Enumeration of weak isomorphism classes of signed graphs.” J. Graph Theory 4, no. 2, 127–144. MR 81g:05070.
Spence, Edward (1975) “Skew-Hadamard matrices of the Goethals-Seidel type.” Canad. J. Math. 27, no. 3, 555–560. MR 52.1 5446.
Spencer, Joel (1970) “Optimal ranking of tournaments.” Proc. Second Chapel Hill Conf. on Combinatorial Mathematics and its Applications (Univ. North Carolina, Chapel Hill, N.C.), pp. 416–420. Univ. North Carolina, Chapel Hill, N.C. MR 42.2 5843.
Spencer, J. (1970) “Probabilistic methods in combinatorial theory.” Ph.D. Thesis, Harvard University, Cambridge, Mass.
Spencer, J. [Spencer, Joel H.] (1971/72) “Minimal scrambling sets of simple orders.”Acat Math. Acad. Sci. Hungar. 22, 349–353. MR 45.1 1805.
Spencer, J.H. (1974) “Random regular tournaments.” Period. Math. Hungar. 5, 105–120. MR 53.1 5359.
Spencer, J.H. (1974) “A generalized Rota conjecture for partitions.” Studies in Appl. Math 53, 239–241. MR 50.1 6875.
Spencer, Joel (1978) “Nonconstructive methods in discrete mathematics.” Studies in combinatorics, pp. 142–178, MAA Studies in Math., 17, Math. Assoc. America, Washington, D.C. MR 80f:05001.
Spencer, Joel H. (1979) “Ramsey’s theorem for spaces.” Trans. Amer. Math. Soc. 249, no. 2, 363–371. MR 80d:05008.
Spencer, J. (1980) “Optimally ranking unrankable tournaments.” Period. Math. Hungar. 11, no. 2, 131–144. MR 81h:05072.
Speranza, Francesco (1970) “Grafi e strutture algebriche.” (English summary), Rend. Sem. Mat. Fis. Milano 10, 9–23. MR 44.2 6553.
Speranza, Francesco (1973) “Sur les sections des hypergraphes et sur leurs automorphismes.” Colloq. Math. 27, 269–274. MR 49.1 2473.
Speranza, Francesco (1979) “Sur les colorations des graphes orientes.” (Italian summary), Boll. Un. Mat. Ital. A (5) 16, no. 3, 517–522. MR 80k:05059.
Sridharan, M.R. (1970) “Self-complementary and self-converse oriented graphs.” Nederl. Akad. Wetensch. Proc. Ser. A 73 = Indag. Math. 32, 441–447. MR 43.2 6138.
Sridharan, M.R. (1976) “Mixed self-complementary and self-converse digraphs.” Discrete Math. 14, no. 4, 373–376. MR 54.1 2520.
Sridharan, M.R.; Parthasarathy, K.R. (1977) “Enumeration of graphs and digraphs with local restrictions.” J. Mathematical and Physical Sci. 11, no. 5, 483–490. MR 58 #10582.
Sridharan, M.R. (1978) “Note on an asymptotic formula for a class of digraphs.” Canad. Math. Bull. 21, no. 3, 377–381. MR 80b:05037.
Sridharan, M.R. (1976) “Asymptotic formula for the number of self-converse digraphs.” Proceedings of the Symposium on Graph Theory (Indian Statist. Inst., Calcutta), pp. 299–304, ISI Lecture Notes, 4, Macmillan of India, New Delhi, 1979. MR 81c:05044.
Stahl, Saul; White, Arthur T. (1976) “Genus embeddings for some complete tripartite graphs.” Discrete Math. 14, no. 3, 279–296. MR 54.2 10060.
Stahl, S. (1976) “n-Tuple colorings and associated graphs.” J. Comb. Theory, 20, 185–203.
Stanley, Richard P. (1970) “A chromatic-like polynomial for ordered sets.” Proc. Second Chapel Hill Conf. on Combinatorial Mathematics and its Applications (Univ. North Carolina, Chapel Hill, N.C.), pp. 421–427. Univ. North Carolina, Chapel Hill, N.C. MR 42.2 4440.
Stanley, Richard P. (1971) “On the number of open sets of finite toplogies.” J. Combinatorial Theory Ser. A 10, 74–79. MR 42.2 7527.
Stanley, Richard P. (1972) “Ordered structures and partitions.” Memoirs of the American Mathematical Society, No. 119. American Mathematical Society, Providence, R.I. iii+104 pp. MR 48.2 10836.
Stanley, Richard P. (1973) “Acyclic orientations of graphs.” Discrete Math. 5, 171–178. MR 47.2 6537.
Stanley, Richard P. (1974) “Finite lattices and Jordan-Holder sets.” Algebra Universalis 4, 361–371. MR 50.1 6951.
Stanley, Richard P. (1976) “Binomial posets, Mobius inversion, and permutation enumeration.” J. Combinatorial Theory Ser. A 20, no. 3, 336–356. MR 53.2 12968.
Stanley, Richard P. (1978) “Generating functions.” Studies in combinatorics, pp. 100–141, MAA Studies in Math., 17, Math. Assoc. America, Washington, D.C. MR 81i:05015.
Stanley, Richard P. (1979) “Balanced Cohen-Macaulay complexes.” Trans. Amer. Math. Soc. 249, no. 1, 139–157. MR 81c:05012.
Stanley, Richard P. (1979) “An application of algebraic geometry to extremal set theory.” Ring theory and algebra, III (Proc. Third Conf., Univ. Oklahoma, Norman, Okla.), pp. 415–422, Lecture Notes in Pure and Appl. Math., 55, Dekker, New York, 1980. MR 81i:05016.
Stanley, Richard P. (1980) “Unimodal sequences arising from Lie algebras.” Combinatorics, representation theory and statistical methods in groups, pp. 127–136, Lecture Notes in Pure and Appl. Math., 57, Dekker, New York. MR 81k:05011.
Stanton, R.G. (1968) “Covering theorems in groups (or: How to win at football pools).” Recent Progress in Combinatorics (Proc. Third Waterloo Conf. on Combinatorics), pp. 21–36. Academic Press, New York, 1969. MR 41.1 1547a.
Kalbfleisch, J.G.; Weiland, PH. (1968) “Some new results for the covering problem.” Recent Progress in Combinatorics (Proc. Third Waterloo Conf. on Combinatorics), pp. 37–45. Academic Press, New York, 1969. MR 41.1 1547b.
Stanton, R.G.; Seah, S.T.E.; Cowan, D.D. (1980/81) “Nonexistence of an extremal graph of a certain type.” J. Austral. Math. Soc. Ser. A 30, no. 1, 55–64. MR 81j:05076.
Statman, R. (1981) “Reductions of the graph reconstruction conjecture.” Discrete Math. 36, no. 1, 103–107. MR 83a:05105.
Stechkin, B.S. [Steckin, B.S.] (1980) “On a surprising fact in extremal set theory.” J. Combin. Theory Ser. A 29, no. 3, 368–369. MR 82a:05054.
Stechkin, B.S. (1981) “Imbedding theorems for Mobius functions.” (Russian), Dokl. Akad. Nauk SSSR 260, no. 1, 40–43. MR 83c:05015.
Steck, G.P. (1974) “Evaluation of some Steck determinants with applications.” Comm. Statist. 3, 121–138. MR 49.1 4134.
Steckhan, Helmut (1970) “A theorem on symmetric traveling salesman problems.” Operations Res. 18, 1163–1167. MR 44.1 3683.
Steffens, Karsten (1972) “Injektive Auswahlfunktionen.” Schriften aus dem Gebiet der Angewandten Mathematik, No. 2. Technische Universitat Hannover, Hannover, iii+69 pp. MR 53.2 12959.
Steffens, Karsten (1974) “Injective choice functions.” J. Combinatorial Theory Ser. A 17, 138–144. MR 51.1 176.
Steffens, Karsten (1976) “Ergebnisse aus der Transversalentheorie. II.” J. Combinatorial Theory Ser. A 20, no. 2, 202–229. MR 55.1 5455.
Stein, S.K. (1967) “Factoring by subsets.” Pacific J. Math. 22, 523–541. MR 36.1 2517.
Stein, S.K. (1977) “Modified linear dependence and the capacity of a cyclic graph.” Linear Algebra and Appl. 17, no. 3, 191–195. MR 57.1 2983.
Steinhaus, H. (1958/59) “Some remarks about tournaments.” Calcutta Math. Soc. Golden Jubilee Commemoration Vol., Part II, pp. 323–327. Calcutta Math. Soc., Calcutta. MR 27.2 4770.
Stephen, D. (1968) “Topology on finite sets.” Amer. Math. Monthly 75, 739–741. MR 38.1 2725.
Sterboul, Francois (1972) “Circuits et arbres de circulation d’un graphe fortement connexe.” (Loose English summary), Rev. Francaise Automat. Informat. Recherche Operationnelle 6, Ser. R-2, 3–8. MR 51.1 266.
Stern, Jacques (1978) “A Ramsey theorem for trees, with an application to Banach spaces.” Israel J. Math. 29, no. 2–3, 179–188. MR 57 #16114.
Stockmeyer, Paul K. (1977) “The falsity of the reconstruction conjecture for tournaments.” J. Graph Theory 1, no. 1, 19–25. MR 56.2 11846.
Stockmeyer, P.K. (1980) “Which reconstruction results are significant?” The theory and applications of graphs (Kalamazoo, Mich.), pp. 543–555, Wiley, New York, 1981. MR 82k:05084.
Stockmeyer, Paul K. (1981) “A census of nonreconstructible digraphs. I. Six related families.” J. Combin. Theory Ser. B 31, no. 2, 232–239. MR 83f:05052.
Stone, A.H. (1969) “Some combinatorial problems in general topology.” Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta.), pp. 413–416. Gordon and Breach, New York, 1970. MR 42.1 3764.
Straight, H. Joseph; Schillo, Paul (1979) “On the problem of partitioning {1, 2,…, n} into subsets having equal sums.” Proc. Amer. Math. Soc. 74, no. 2, 229–231. MR 80f:05059.
Straus, E.G. (1975) “A combinatorial theorem in group theory.” Math. Comp. 29, 303–309. MR 51.1 3314.
Strok, V.V.; Javors’kii, E.B. (1978) “On the question of the combinatorial analysis of graph imbedding.” (Russian), Theoretical and applied questions of differential equations and algebra, pp. 238–241, 271, “Naukova Dumka”, Kiev. MR 8lh:05063.
Sugawara, Tamio (1981) “Matrices giving relations among symmetric functions.” Mem. Fac. Sci. Kyushu Univ. Ser. A 35, no. 1, 87–98. MR 82j:05009.
Sugiyama, Kazuo (1975) “On the point-line graph of a graph.” (Japanese summary), Sci. Rep. Fac. Ed. Gifu Univ. Natur. Sci. 5, no. 4, 287–29. MR 54.1 254.
Sumner, David P. (1974) “Dacey graphs.” J. Austral. Math. Soc. 18, 492–502. MR 52.1 2970.
Suranyi, Janos (1971) “Some combinatorial problems of geometry.” (Hungarian. English summary), Mat. Lapok 22, 215–230 (1972). MR 49.1 143.
Suranyi, Laszlo (1980) “On a generalization of line-critical graphs.” Discrete Math. 30, no. 3, 277–287. MR 81i:05121.
Sushkov, Yu. A. (1982) “Independence in hypergraphs.” (Russian), Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 114, 196–204, 222. MR 83K05088.
Suvorov, P. Ju. (1979) “Representation of proofs by colored graphs and Hadwiger’s conjecture.” (Russian. English summary), Zap. Naucn. Sem. Leningrad. Otdel. Mat. Int. Steklov. (LOMI) 88, 209–217, 246. MR 81g:05060.
Swan, Richard G. (1963) “An application of graph theory to algebra.” Proc. Amer. Math. Soc. 14, 367–373. MR 26.2 6956.
Swart, E.R. (1980) “The edge reconstructibility of planar bidegree graphs.” Combinatorics 79 (Proc. Colloq., Univ. Montreal, Montreal, Que.), Part II. Ann. Discrete Math. 9, 7–12. MR 81m:05099.
Swenson, Carl (1974) “Direct sum subset decompositions of Z.” Pacific J. Math. 53, 629–633. MR 50.2 9833.
Sye, Czeslaw (1973) “A means of successive determination of the oriented trees of an oriented graph by the method of conjugate structural numbers with the aid of digital computers.” (Polish. Russian and English summaries), Arch. Elektrotech. (Warsaw) 22, 407–426. MR 47.2 6538.
Sykes, M.F.; Essam, J.W.; Heap, B.R.; Hiley, B.J. (1966) “Lattice constant systems and graph theory.” J. Mathematical Phys. 7, 1557–1572. MR 34.1 3951.
Sykow, A.A. [Zykov, A.A.]; Kesselman, D. Ja.; Neimark, Ju. I.; Podkorytow, W. N. [Podkorytov, V.N.] (1969) „Uber ein Verfahren zur Farbung enener Triangulationen.“ Math. Nachr. 40, 51–59. MR 44.1 1603.
Syslo, M.M. (1972/73) “The calculation of α-sets of representatives.” (Polish summary), Zastos. Mat. 13, 347–350. MR 48.1 1936.
Syslo, M.M. (1980) “On some problems related to fundamental cycle sets of a graph.” The theory and applications of graphs (Kalamazoo, Mich.), pp. 577–588, Wiley, New York, 1981. MR 83b:05085.
Syslo, Maciej M. (1981) “The Helly-type property of nontrivial intervals on a tree.” Discrete Math. 37, no. 2–3, 297–298. MR 83m:05054.
Szamkolowicz, L. (1960) “A characterization of the straight line among plane graphs.” (Polish. Russian and English summaries), Prace Mat. 4, 83–89. MR 24.A A545.
Szamkolowicz, L. (1962) “Remarks on the characterization of a straight line among graphs on open surfaces.” (Polish. Russian and English summaries), Prace Mat. 7, 11–18. MR 32.1 446.
Szamkolowicz, Lucjan (1972) “The foundations of the theory of network planning. I.” (Polish. English and Russian summaries), Prace Nauk. Inst. Mat. Fiz. Teoret. Politechn. Wroclaw. Ser. Studia i Materialy No. 4, Grafy i Sieci, 3–16. MR 50.1 1959a.
Szamkolowicz, Lucjan (1972) “The foundations of the theory of network planning. II.” (Polish. English and Russian summaries), Prace Nauk. Inst. Mat. Fiz. Teoret. Politechn. Wroclaw. Ser. Studia i Materialy No. 6 Zagadnienia kombinatoryczne, 59–66. MR 50.1 1959b.
Szamkolowicz, Lucjan (1973) “Neighborhood information of a graph, and a problem of Ulam.” (Polish. English and Russian summaries), Proace. Nauk. Inst. Mat. Fiz. Teoret. Politechn. Wroclaw. Ser. Studia i Materialy No. 9 Grafy i hipergrafy, 3–7. MR 50.1 194.
Szamkolowicz, Lucjan (1974) “On problems of the elementary theory of graphical matroids.” Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague), pp. 501–505. Academia, Prague, 1975. MR 56.1 166.
Szekeres, E.; Szekeres, G. (1965) “On a problem of Schutte and Erdos.” Math. Gaz. 49, 290–293. MR 32.2 4025.
Szekeres, G. (1969) “Tournaments and Hadamard matrices.” Enseignement Math. (2) 15, 269–278. MR 40.1 56.
Szekeres, G. (1973) “Oriented Tait graphs.” J. Austral. Math. Soc. 16, 328–331. MR 48.2 10879.
Szekeres, G. (1974) “Non-colourable trivalent graphs.” Combinatorial mathematics, III (Proc. Third Australian conf., Univ. Queensland, St. Lucia), pp. 227–233. Lecture Notes in Math., Vol. 452, Springer, Berlin, 1975. MR 51.1 7928.
Szele, Tibor (1966) “Kombinatorische Untersuchungen uber gerichtete vollstandige Graphen.” Publ. Math. Debrecen 13, 145–168. MR 34.2 7406.
Szwarcfiter, Jayme L.; Lauer, Peter E. (1976) “A search strategy for the elementary cycles of a directed graph.” Nordisk Tidskr. Informationsbehandling (BIT) 16, no. 2, 192–204. MR 55.2 12566.
Tabacnikov, M.I. (1973) “Uniqueness theorems for infinite systems of linear equations.” (Russian), Dokl. Akad. Nauk SSSR 210, 40–43. MR 48.1 4787.
Tainiter, M. (1968) “Generating functions on idempotent semigroups with application to combinatorial analysis.” J. Combinatorial Theory 5, 273–288. MR 38.1 65.
Tainiter, Melvin (1972) “Generating functions on idempotent semigroups. II.” J. Combinatorial Theory Ser. A. 13, 401–421. MR 47.2 4814.
Taira, Kazuaki (1975) “On some noncoercive boundary value problems for the Laplacian.” Proc. Japan Acad. 51, 141–146. MR 51.2 10864.
Takeda, Eiji (1973) “Connectivity in fuzzy graphs.” Tech. Rep. Osaka Univ. 23, 343–352. MR 55.2 10071.
Takenaka, Yoshiko (1972) “On the existence of a Hamiltonian circuit in a graph. II.” Information and Control 20, 480–488. MR 48.2 10895.
Tallini Scafati, Maria (1966) “{k,n}-archi di un piano grafico finito, con particolare riguardo a quelli con due caratteri. I.” (English summary), Atti Accad. Naz. Lincei Rend. CI. Sci. Fis. Mat. Natur. (8) 40, 812–818. MR 35.2 4806a.
Tallini Scafati, Maria (1966) “{k,n}-archi di un piano grafico finito, con particolare riguardo a quelli con due caratteri. I.” (English summary), Atti Accad. Naz. Lincei Rend. CI. Sci. Fis. Mat. Natur. (8) 40, 1020–1025. MR 35.2 4806b.
Tarjan, Robert (1972) “Depth-first search and linear graph algorithms.” SIAM J. Comput. 1, no. 2, 146–160. MR 46.1 3313.
Tarjan, Robert (1973) “Enumeration of the elementary circuits of a directed graph.” SIAM J. Comput. 2, 211–216. MR 48.1 3795.
Tarjan, Robert (1974) “Finding dominators in directed graphs.” SIAM J. Comput. 3, 62–89. MR 51.1 9567.
Tarjan, Robert Endre (1974/75) “A good algorithm for edge-disjoint branching.” Information Processing Lett. 3, 51–53. MR 51.2 12021.
Tarjan, Robert Endre (1976) “Edge-disjoint spanning trees and depth-first search.” Acta Informat. 6, no. 2, 171–185. MR 54.2 12557.
Tarjan, R.E. (1977) “Finding optimum branchings.” Networks 7, no. 1, 25–35. MR 58 #3661.
Taylor, Walter (1969) “Atomic compactness and graph theory.” Fund. Math. 65, 139–145. MR 40.1 81.
Teh, H.H. (1969) “An algebraic representation theorem of finite regular graphs.” Nanta Math. 3, no. 2, 88–94. MR 42.1 137.
Teh, H.H. (1969) “Fundamentals of group graphs.” J. Nanyang Univ. 3, 321–344. MR 42.1 132.
Teh, H.H. (1969) “On point-edge symmetric directed graphs.” Nanta Math. 3, no. 2, 1–12. MR 42.1 134.
Teh, H.H. (1970) “An algebraic representation theorem of point-symmetric graphs.” Nanta Math. 4, 29–46. MR 46.1 92.
Teh, H.H.; Chen, C.C. (1970) “Point symmetric ranks of directed graphs.” Nanta Math. 4, 101–112. MR 47.1 3231.
Teh, H.H.; Choo, E.U. (1967) “Some results on coherent graphs.” J. Nanyang Univ. 1, 289–308. MR 38.2 3181.
Teirlinck, Luc (1975) “On linear spaces in which every plane is either projective or affine.” Geometriae Dedicata 4, no. 1, 39–44. MR 52.1 5441.
Temperley, H.N.V.; Lieb, E.H. (1971) “Relations between the “percolation” and “colouring” problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the “percolation” problem.” Proc. Roy. Soc. London Ser. A 322, no. 1549, 251–280. MR 58 #16425.
Thas, J.A. (1972) “Flocks of finite egglike inversive planes.” C.I.M.E., II Ciclo, Bressanone, pp. 189–191. Edizioni Cremonese, Rome, 1973. MR 50.2 9627.
Thas, Joseph Adolphe (1974) “Translation 4-gonal configurations.” (Italian summary), Atti Accad. Naz. Lincei Rend. CI. Sci. Fis. Mat. Natur. (8) 56, fasc. 3, 303–314. MR 51.1 7908.
Thas, J.A. (1974) “Construction of maximal arcs and partial geometries.” Geometriae Dedicata 3, 61–64. MR 50.1 1931.
Thas, J.A.; De Clerck, F. (1977/78) “Partial geometries satisfying the axiom of Pasch.” Simon Steven 51, no. 3, 123–137. MR 57.1 5790.
Thomassen, Carsten (1973) “Antidirected Hamilton circuits and paths in tournaments.” Math. Ann. 201, 231–238. MR 50.1 1960.
Thomassen, Carsten (1974) “Hypohamiltonian and hypotraceable graphs.” Discrete Math$19, 91–96. MR 50.1 184.
Thomassen, Carsten (1975) “Transversals of circuits in the lexicographic product of directed graphs.” (French summary), Math. Sci. Humaines No. 51, 43–45, 87. MR 52.2 13476.
Thomassen, Carsten (1976) “Hypo-Hamiltonian graphs and digraphs.” Theory and applications of graphs (Proc. Internat. Conf., Western Mich. Univ., Kalamazoo, Mich.), pp. 557–571, Lecture Notes in Math., 642, Springer, Berlin, 1978. MR 80e:05079.
Thomassen, Carsten (1979) “Long cycles in digraphs with constraints on the degrees.” Surveys in combinatorics (Proc. Seventh British Combinatorial Conf., Cambridge), pp. 211–228, London Math. Soc. Lecture Note Ser., 38, Cambridge Univ. Press, Cambridge. MR 81c:05045.
Thomassen, Carsten (1980) “On the number of Hamiltonian cycles in tournaments.” Discrete Math. 31, no. 3, 315–323. MR 81h:05073.
Thomassen, Carsten (1980) “2-linked graphs.” European J. Combin. 1, no. 4, 371–378. MR 82c:05086.
Thomassen, Carsten (1980) “Hamiltonian-connected tournaments.” J. Combin. Theory Ser. B 28, no. 2, 142–163. MR 82d:05065.
Thomassen, Carsten (1981) “Planar cubic hypo-Hamiltonian and hypotraceable graphs.” J. Combin. Theory Ser. B 30, no. 1, 36–44. MR 83f:05042.
Thomassen, Carsten (1981) “Long cycles in digraphs.” Proc. London Math. Soc. (3) 42, no. 2, 231–251. MR 83f:05043.
Thomassen, Carsten (1982) “Edge-disjoint Hamiltonian paths and cycles in tournaments.” Proc. London Math. Soc. (3) 45, no. 1, 151–168. MR 83k:05075.
Thurlings, Karl-Josef (1978) “Direkte Berechnung spezieller Anzahlen in Polyas Abzahltheorie.” Match No. 4, 161–171. MR 80a:05118.
Tinhofer, G. (1972) „Uber die Bestimmung von Kernen in endlichen Graphen.“ (English summary), Computing (Arch. Elektron. Rechnen) 9, 139–147. MR 52.2 10513.
Tinhofer, G. (1975) „Zur Bestimmung der Automorphismen eines endlichen Graphen.“ (English summary), Computing 15, no. 2, 147–156. MR 54.1 2516.
Tinhofer, G. (1976) „Zum algorithmischen Nachweis der Isomorphie von endlichen Graphen.“ Graphen, Algorithmen, Datenstrukturen (Zweite Fachtagung uber Graphentheoretische Konzepte der Informatik, Gottingen), pp. 169–182. Appl. Comput. Sco., Vol. 4, Hanser, Munich. MR 57.1 2988.
Tits, Jacques (1970) „Sur le groupe des automorphismes d’un arbre.” Essays on Topology and Related Topics, pp. 188–211. Springer, New York. MR 45.2 8582.
Todorcevic, S. (1978) “On a property of partially ordered sets.” Publ. Inst. Math. (Beograd) (N.S.) 23 (37), 207–212. MR 80a:05075.
Tomescu, Ioan (1970) „Une demonstration du theoreme de Dilworth et applicaions a un probleme de couverture des graphes.“ (English summary), Calcolo 7, 289–294. MR 46.1 3374.
Tomescu, Ioan (1978) “A general formula for the asymptotic number of labeled connected graphs and digraphs.” Rev. Roumaine Math. Pures Appl. 23, no. 4, 617–623. MR 58 #10583.
Tomescu, Ioan (1980) “Presque tous les graphes sont k-connexes.” Rev. Roumaine Math. Pures Appl. 25, no. 7, 1125–1130. MR 82d:05077.
Tomescu, Ioan (1979) “Asymptotical estimations for the number of cliques of uniform hypergraphs.” Studies on graphs and discrete programming (Brussels), pp. 345–358, North-Holland Math. Stud., 59, North-Holland, Amsterdam-New York, 1981. MR 83j:05040.
Tomizawa, Nobuaki (1976) “Strongly irreducible matroids and principal partition of a matroid into strongly irreducible minors.” Electron. Commun. Japan 59, no. 2, 1–10. MR 56.1 5337.
Tomova, Eliska (1970) “On the decomposition of the complete directed graph into factors with given diameters.” Mat. Casopis Sloven. Akad. Vied 20, 257–261. MR 46.2 8894.
Loh Hooi Tong (1975) “A simple theorem on graph functions.” Bull. Malaysian Math. Soc. 6, no. 1, 32–33. MR 56.2 8436.
Topp, Jerzy (1980) “Bemerkungen zu Kernen der paaren Graphen.” Demonstratio Math. 13, no. 4, 835–838. MR 82k:05057.
Traczyk, Tomasz (1980) “When a cyclic and acyclic family of sets can be nonlinear?” Comment. Math. Univ. St. Paul. 28, no. 2, 141–146. MR 81g:05064.
Trahtman, A.N. (1976) “Subsemigroup graphs, and lattices of subsemigroups.” (Russian), Izv. Vyss. Ucebn. Zaved. Matematika, no. 2 (165), 69–78. MR 56.1 178.
Traiger, I.L.; Gill, A. [Gill, Arthur] (1968) “On an asymptotic optimization problem in finite, directed, weighted graphs.” Information and Control 13, 527–533. MR 39.2 8016.
Trehel, Michel (1972) “Graphes des complements et classes de branches dans un ensemble ordonne fini resultant d’un produit contracte.” Discrete Math. 3, 373–379. MR 47.2 8374.
Trehel, Michel (1978) “Notes sur le couplage direct—couplage dans les combinaisons.” Cahiers Centre Etudes Rech. Oper. 20, no. 2, 147–161. MR 80m:05100.
Trnkova, Vera [Sediva–Trnkova, Vera] (1972) “Non-constant continuous mappings of metric or compact Hausdorff spaces.” Comment. Math. Univ. Carolinae 13, 283–295. MR 46.1 2623.
Trnkova, Vera [Sediva-Trnkova, Vera]; Koubek, Vaclav (1978) “Isomorphisms of products of infinite graphs.” Comment. Math. Univ. Carolin. 19, no. 4, 639–652. MR 81a:05117.
Trotter, L.E., Jr. (1977) “Line perfect graphs.” Math. Programming 12, no. 2, 255–259. MR 56.2 15501.
Trotter, William T., Jr.; Moore, John I., Jr. (1976) “Some theorems on graphs and posets.” Discrete Math. 15, no. 1, 79–84. MR 54.1 5060.
Trotter, William T., Jr. (1976) “Order preserving embeddings of aographs.” Theory and applications of graphs (Proc. Internat. conf., Western Mich. Univ., Kalamazoo, Mich.), pp. 572–579, Lecture Notes in Math., 642, Springer, Berlin, 1978. MR 80a:05086.
Trotter, William T., Jr.; Erdos, Paul (1978) “When the Cartesian product of directed cycles is Hamiltonian.” J. Graph Theory 2, no. 2, 137–142. MR 80e:05063.
Trotter, William T., Jr.; Harary, Frank (1979) “On double and multiple interval graphs.” J. Graph Theory 3, no. 3, 205–211. MR 81c:05055.
Trotter, W.T. (1979) “A forbidden subgraph characterization of Roberts’ inequality for boxicity.” Discrete Math., 28, 1–11.
Tucker, Alan (1972) “The strong perfect graph conjecture and an application to a municipal routing problem.” Graph theory and applications (Proc. Conf., Western Michigan Univ., Kalamazoo, Mich.), pp. 297–303. Lecture Notes in Math., Vol. 303, Springer, Berlin. MR 49.2 7181.
Tucker, Alan (1973) “Perfect graphs and an application to optimizing municipal services.” SIAM Rev. 15, 585–590. MR 48.1 3817.
Tucker, Alan (1974) “Structure theorems for some circular-arc graphs.” Discrete Math. 7, 167–195. MR 52.1 203.
Tucker, Alan (1977) “Critical perfect graphs and perfect 3-chromatic graphs.” J. Combinatorial Theory Ser. B 23, no. 1, 143–149. MR 58 #16369.
Tucker, Albert W. (1978) “On Sperner’s lemma and another combinatorial lemma.” Second International Conference on Combinatorial Mathematics (New York), pp. 536–539, Ann. New York Acad. Sci., 319, New York Acad. Sci., New York, 1979. MR81a:05004.
Tucker, T.W. (1980) “The number of groups of a given genus.” Trans. Amer. Math. Soc. 258, no. 1, 167–179. MR 81b:05040.
Turan, Paul (1969) “Applications of graph theory to geometry and potential theory.” Proc. Calgary Internat. Conf., Calgary, Alta., pp. 423–434. Gordon and Breach, New York, 1970. MR 42.2 7551.
Turan, P. (1969) “On some connections between combinatorics and group theory.” Combinatorial Theory and its Applications, III (Proc. Colloq., Balatonfured), pp. 1055–1082. North-Holland, Amsterdam, 1970. MR 46.2 5234.
(1977) “Special issue dedicated to Paul Turan.” J. Graph Theory 1, no. 2. Wiley Interscience [John Wiley and Sons], New York-London-Sydney, pp. 95–190. MR 55.2 12387.
Turner, James (1968) “Key-word indexed bibliography of graph theory.” Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich.), pp. 189–330. Academic Press, New York, 1969. MR 41.1 3318.
Turner, James; Kautz, William H. (1970) “A survey of progress in graph theory in the Soviet Union.” SIAM Rev. 12, suppl., iv+68 pp. MR 42.1 2973.
Tutte, W.T. (1965) “Lectures on matroids.” J. Res. Nat. Bur. Standards Sect. B 69B, 1–47. MR 31.2 4023.
Tutte, W.T. (1965) “Meager’s theorem for matroids.” J. Res. Nat. Bur. Standards Sect. B 69B, 49–53. MR 31.2 3359.
Tutte, William T. (1971) “What is a map?” New directions in the theory of graphs (Proc. Third Ann Arbor Conf. on Graph Theory, Univ. of Michigan, Ann Arbor, Mich.), pp. 309–325. Academic Press, New York, 1973. MR 51.2 12589.
Tutte, W.T. (1974) “Spanning subgraphs with specified valencies.” Discrete Math. 9, 97–108. MR 50.1 1989.
Tutte, W.T. (1973) “Duality and trinity.” Infinite and finite sets (Colloq., Keszthely), Vol. Ill, pp. 1459–1472. Colloq., Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR 53.1 5382.
Tutte, W.T. (1975) “Separation of vertices by a circuit.” Discrete Math. 12, 173–184. MR 51.1 5358.
Tutte, W.T. (1976) “The rotor effect with generalized electrical flows.” Ars Combinatoria 1, no. 1, 3–31. MR 55.2 14436.
Tutte, W.T. (1979) “Combinatorial oriented maps.” Canad. J. Math. 31, no. 5, 986–1004. MR 80k: 05089.
Tutte, W.T. (1978) “On chain-groups and the factors of graphs.” Algebraic methods in graph theory, Vol. I, II (Szeged), pp. 793–818, Colloq. Math. Soc. Janos Bolyai, 25, North-Holland, Amsterdam, 1981. MR 83b:05104.
Tuzov, V.A. (1968) “The isolation of closed subgraphs.” (Russian), Z. Vycisl. Mat. i Mat. Fiz. 8, 1385–1387. MR 40.1 1300.
Tuzov, V.A. (1968) “Regular sets of circuits of a graph.” (Russian), Z. Vycisl. Mat. i Mat. Fiz. 8, 492–496. MR 40.1 2572.
Tyagi, M.S. (1973) “On some properties of n–tournaments.” SIAM J. Appl. Math. 24, 207–214. MR 51.1 7931.
Tyagi, M.S. (1974) “On the reachability product of digraphs.” Cahiers Centre Etudes Recherche Oper. 16, 55–66. MR 52.1 5469.
Tyagi, M.S. (1975) “On some properties of n-tournaments: a note.” SIAM J. Appl. Math. 28, 675–677. MR 53.1 191.
Tyskevic, R.I. (1975) “Relations that admit a transitive automorphism group.” (Russian), Mat. Sb. (N.S.) 97(139), no. 2 (6), 262–277, 318. MR 53.1 2738.
Ufnarovskii, V.A. (1982) “Criterion for the growth of graphs and algebras given by words.” (Russian), Mat. Zametki 31, no. 3, 465–472, 476. MR 83f:05026.
Ullmann, J.R. (1976) “An algorithm for subgraph isomorphism.” J. Assoc. Comput. Mach. 23, no. 1, 31–42. MR 58 #13907.
Urakov, H. (1968) “Bases for the arcs of a directed graph.” (Russian), Voprosy Kibernet. Vycisl. Mat. Vyp. 22, 103–109. MR 54.1 139.
Urakov, H. (1969) “A criterion for the existence of strictly conditional bases and the problem of finding weakly conditional bases for the arcs of a digraph.” (Russian), Voprosy Kibernet. Vycisl. Mat. Vyp. 26, 101–110. MR 54.1 141.
Urakov, H. (1969) “Bases for the edges of a partially directed graph.” (Russian), Voprosy Kibernet. Vycisl. Mat. Vyp. 24, 114–122. MR 54.1 140.
Ulrich, John Wade (1970) “A characterization of planar oriented graphs.” SIAM J. Appl. Math. 18, 364–371. MR 41.1 107.
Vamos, P. (1971) “Linearity of matroids over division rings.” Mobius algebras (Proc. Conf., Univ. Waterloo, Waterloo, Ont), pp. 170–174. Univ. Waterloo, Waterloo, Ont. MR 50.1 1942.
Vamos, P. (1971) “A necessary and sufficient condition for a matroid to be linear.” Mobius algebras (Proc. Conf., Univ. Waterloo, Waterloo, Ont.), pp. 162–169. Univ. Waterloo, Waterloo, Ont. MR 50.1 1941.
van Emde Boas, P.; Kruyswijk, D. (1967) “A combinatorial problem on finite Abelian groups.” Math. Centrum Amsterdam Afd. Zuivere Wisk., ZW-009, 27 pp. MR 39.1 2871.
Van Nuffelen, Cyriel (1979) “Directed weighted hypergraphs.” Bull. Soc. Math. Belg. Ser. B 31, no. 2, 147–151. MR 82b:05100
Van Nuffelen, Cyriel (1979) “Enumeration techniques in directed hypergraphs.” Optimization techniques (Proc. Ninth IFIP Conf., Warsaw), Part 2, pp. 330–333, Lecture Notes in Control and Information Sci., 23, Springer, Berlin, 1980. MR 81m:05106.
Vansnick, Jean-Claude (1971) “Theoreme dfexistence pour un systeme quasi-lineaire d’equations aux derivees partielles relatif au probleme des courbes holomorphes dans une variete presquecomplexe.” Bull. Soc. Math. Belg. 23, 513–525. MR 49.2 9413.
Vantrusov, Ju. I. (1966) “The analysis of a finite graph.” (Russian), Mathematical Programming (Russian), pp. 68–77. Izdat. “Nauka”, Moscow. MR 36.1 69.
Varecza, Arpad; Varecza, Laszlo (1974) “The number of chains in a finite Boolean algebra.” (Hungarian. English summary), Acta Acad. Paedagog. Civitate Pecs Ser. 6 Math. Phys. Chem. Tech. 18, 13–19. MR 56.1 5309.
Varecza, Arpad; Varecza, Laszlo (1973) “On the graphs of finite Boolean algebras.” (Hungarian. Russian summary), Acta Acad. Paedagog. Civitate Pecs Ser. 6 Math. Phys. Chem. Tech. 17, 17–19. MR 58.1 394.
Varlet, J.C. (1971) “A pseudo-distance in weak functional digraphs.” (French summary), Bull. Soc. Roy. Sci. Liege 40, 207–210. MR 46.1 89.
Varlet, J.C. (1975) “Convexity in tournaments.” Proceedings of the Lattice Theory Conference (Ulm), pp. 260–266. Univ. Ulm, Ulm. MR 55.2 12562.
Varlet, J.C. (1975) “Some algebraic aspects of tournament theory.” Colloq. Math. 33, no. 2, 189–199. MR 52.1 5470.
Varlet, Jules C. (1976) “Convexity in tournaments.” Bull. Soc. Roy. Sci. Liege 45, no. 11–12, 570–586. MR 56.2 8418.
Vazenin, Ju. M. (1972) “The elementary definability and elementary characterizability of classes of reflexive graphs.” (Russian), Izv. Vyss. Ucebn. Zaved. Matematika, no. 7 (122), 3–11. MR 48.2 8309.
Vazenin, Ju. M. (1974) “The powers of semigroups of isotonic transformations of reflexive graphs.” (Russian), Mat. Zametki 16, 317–323. MR 51.1 7935.
Vazenin, Ju. M.; Perminov, E.A. (1979) “Rigid lattices and graphs.” (Russian), Ural. Gos. Univ. Mat. Zap. 11, no. 3 Issled. po Sovremen. Algebre, 3–21, 209. MR 81g:05061.
Vectomov, V.E. (1975) “Closure figures for a certain class of universal identities.” (Russian), Mat. Issled. 10, no. 2 (36), 36–63, 281. MR 53.1 5799.
Vestergaard, P.D. (1975) “Doubly traversed Euler circuits.” Archiv der Mathematik 26, 222–224.
Vidyasankar, K.; Younger, D.H. (1975) “A minimax equality related to the longest directed path in an acyclic graph.” Canad. J. Math. 27, 348–351. MR 54.1 5046.
Vesztergombi, K. (1978) “Chromatic number of strong product of graphs.” Algebraic methods in graph theory, Vol. I, II (Szeged), pp. 819–825, Colloq. Math. Soc. Janos Bolyai, 25, North-Holland, Amsterdam, 1981. MR 83e:05055.
Vidyasankar, K. (1978) “Covering the edge set of a directed graph with trees.” Discrete Math. 24, no. 1, 79–85. MR 80c:05080.
Vidyasankar, K. (1978) “Minimum strong cover in circuit-balanced graphs.” Utilitas Math. 14, 287–303. MR 80a:05106.
Vidyasankar, K. (1980) “Covers and strong covers in directed bipartite graphs.” J. Graph Theory 4, no. 3, 279–286. MR 81m:05074.
Vincent, Philippe (1968) “Un theoreme de decomposition unique pour les ensembles ordonnees finis connexes.” C.R. Acad. Sci. Paris Ser. A-B 267, A493–A496. MR 38.1 1030.
Vincke, Philippe (1974) “Hypergraphes orientes.” Colloque sur la Theorie des Graphes (Paris). Cahiers Centre Etudes Recherche Oper. 17, no. 2-3-4, 407–416. MR 53.2 13048.
Vizing, V.G. (1963) “The Cartesian product of graphs.” (Russian), Vycisl. Sistemy No. 9, 30–48. MR 35.1 81.
Voigt, Bernd (1980) “The partition problem for finite Abelian groups.” J. Combin. Theory Ser. A 28, no. 3, 257–271. MR 81h:05016.
Volosina, A.A.; Feinberg, V.Z. (1974) “Metric properties of trees.” (Russian. English summary insert), Kibernetika (Kiev), no. 1, 84–88. MR 49.1 4823.
Volosina, A.A. (1977) “An algorithm for the lexicographic ordering of trees.” (Russian), Vesci Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk, no. 3, 31–35, 141. MR 57 #12277.
Vol’pert, A.I. (1972) “Differential equations on graphs.” (Russian), Mat. Sb. (N.S.) 88 (130), 578–588. MR 47.2 5344.
Vondracek, Prokop (1973) “Application of the method of Latin multiplication and other methods of graph theory in testing the connectedness of an enterprise information system.” (Czech. English summary), Ekonom.-Mat. Obzor 9, 320–335. MR 54.1 142.
von Randow, Rabe (1975) “Introduction to the theory of matroids.” Lecture Notes in Economics and Mathematical Systems, Vol. 109. Springer-Verlag, Berlin-New York, ix+102 pp. MR 52.2 10460.
Voss, W. (1978) “Gruppen und Graphen. II.” Wiss. Z. Tech. Hochsch. Ilmenau 24, no. 4, 47–61. MR 80c:05082.
Voss, W. (1978) “Gruppen und Graphen. I.” Wiss. Z. Tech. Hochsch. Ilmenau 24, no. 3, 63–78. MR 58 #16387.
Vrba, Antonin (1974) “Subdeterminants and subgraphs.” Casopis Pest. Mat. 99, 64–76. MR 50.1 4371.
Wagon, Stanley (1978) “Infinite triangulated graphs.” Discrete Math. 22, no. 2, 183–189. MR 80i:05078.
Wagstaff, Samuel S., Jr. (1973) “Infinite matroids.” Trans. Amer. Math. Soc. 175, 141–153. MR 53.1 2718.
Waldrop, Clay, Jr. (1976) “An ARC-reversal theorem for tournaments.” Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory, and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 501–507. Congressus Numerantium, No. XVII, Utilitas Math., Winnipeg, Man. MR 57 #9594.
Walkup, David W. (1965) “Minimal interchanges of (0,1)-matrices and disjoint circuits in a graph.” Canad. J. Math. 17, 831–838. MR 32.2 4039.
Walkup, David W. (1980) “Matchings in random regular bipartite digraphs.” Discrete Math. 31, no. 1, 59–64. MR 81i:05078.
Wall, Curtiss E. (1968) “Arc digraphs and traversability.” The Many Facets of Graph Theory (Proc. Conf., Western Mich. Univ., Kalamazoo, Mich.), pp. 287–290. Springer, Berlin, 1969. MR 40.2 4170.
Waller, Derek A. (1976/77) “Quotient structures in graph theory.” Graph Theory Newslett. 6, no. 4, 12–18. MR 55.2 10331.
Waller, D.A. (1978) “Graph–theoretical models with products and projections.” Cahiers Centre Etudes Rech. Oper. 20, no. 2, 209–216. MR 58 #20353.
Waller, Derek A. (1978) “Covering projections of chemical reaction graphs.” Match No. 4, 87–92. MR 80a:05175.
Wallis, Jennifer Seberry (1975/76) “Construction of Williamson type matrices.” Linear and Multilinear Algebra 3, no. 3, 197–207. MR 53.1 167.
Wallis, W.D. (1981) “A one–factorisation of a Cartesian product.” Utilitas Math. 20, 21–25. MR 83j: 05069.
Wang, Da Lun (1976) “On degree sequence of digraphs without 2-cycles.” Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory, and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 509–514. Congressus Numerantium, No. XVII, Utilitas Math., Winnipeg, Man. MR 55.1 2641.
Warfield, John N. (1980) “Complementary relations and map reading.” IEEE Trans. Systems Man Cybernet. 10, no. 6, 285–291. MR 81i:05079.
Warner, M.W. (1980/81) “Relations, homogeneity and group quotients.” J. Austral. Math. Soc. Ser. A 30, no. 3, 347–355. MR 83c:05063.
Warren, Henry S., Jr. (1975) “A modification of Warshall’s algorithm for the transitive closure of binary relations.” Comm. ACM 18, 218–220. MR 51.1 2340.
Watkins, Mark E. (1971) “On the action of non-Abelian groups on graphs.” J. Combinatorial Theory Ser. B 11, 95–104. MR 43.2 6136.
Watkins, Mark E. (1973) “Sur les groupes d’automorphismes de systemes combinatoires.” C.R. Acad. Sci. Paris Ser. A-B 277, A831–A833. MR 48.1 3792.
Watkins, Mark E. (1974) “Graphical regular representations of alternating, symmetric, and miscellaneous small groups.” Aequationes Math. 11, 40–50. MR 49.2 8897.
Wawruch, Alojz (1974) “On the isomorphism of regular tournaments.” Acta Fac. Rerum Natur. Univ. Comenian. Math. Publ. 29, 7–12. MR 52.1 172.
Wegner, G. (1967) „Eigenschaften der nerven homologisch-einfacher familien in Rn.“ Ph.D. Thesis, Gottingen.
Wehmer, F. (1981) „Ein Verfahren zur Untersuchung der Isomorphie von Hecken.“ Wiss. Z. Tech. Hochsch. Ilmenau 27, no. 2, 65–74. MR 82m:05085.
Weichsel, Paul M. (1971) “A note on asymmetric graphs.” Israel J. Math. 10, 234–243. MR 45.1 3239.
Weinberg, Louis (1977) “Matroids, generalized networks, and electric network synthesis.” J. Combinatorial Theory Ser. B 23, no. 1, 106–126. MR 57.1 5492.
Weinstein, J. (1974) “Large matchings in graphs.” Canad. J. Math. 26, 1498–1508. MR 51.1 5418.
Welsh, D.J.A. (1968) “Some applications of a theorem of Rado.” Mathematika 15, 199–203. MR 39.1 77.
Welsh, D.J.A. (1969) “Transversal theory and matroids.” Canad. J. Math. 21, 1323–1330. MR 40.2 5470.
Welsh, D.J.A. (1970) “On matroid theorems of Edmonds and Rado.” J. London Math. Soc. (2) 2, 251–256. MR 41.1 3309.
Welsh, D.J.A. (Editor) (1969) “Combinatorial mathematics and its applications.” Proceedings of a Conference held at the Mathematical Institute, Oxford, from 7–10 July, 1969. Academic Press, London-New York, 1971. x+364 pp. MR 43.1 3128.
Welsh, D.J.A. (1971) “Generalized versions of Hall’s theorem.” J. Combinatorial Theory Ser. B 10, 95–101. MR 44.1 2621.
Welsh, D.J.A. (1971) “Related classes of set functions.” Studies in Pure Mathematics, pp. 261–269. Academic Press, London. MR 46.1 3348.
Welsh, D.J.A. (1976) “Matroid theory.” L.M.S. Monographs, No. 8. Academic Press [Harcourt Brace Jovanovich, Publishers], London-New York. xi+433 pp. MR 55.1 148.
Welsh, D.J.A. (1980) “Colourings, flows and projective geometry.” Nieuw Arch. Wisk. (3) 28, no. 2, 159–176. MR 82h:05002.
Wessel, Walter (1977) “Some color-critical equivalents of the strong perfect graph conjecture.” Contributions to graph theory and its applications (Internat. Colloq., Oberhof) (German), pp. 300–309, Tech. Hochschule Ilmenau, Ilmenau. MR 82h:05033.
West, Douglas B.; Kleitman, Daniel J. (1979) “Skew chain orders and sets of rectangles.” Discrete Math. 27, no. 1, 99–102. MR 80i:05006.
White, Arthur T. (1974) “Orientable imbeddings of Cayley graphs.” Duke Math. J. 41, 353–371. MR 51.1 230.
White, A.T. (1978) “Strongly symmetric maps.” Graph theory and combinatorics (Proc. Conf., Open Univ., Milton Keynes), pp. 106–132, Res. Notes in Math., 34, Pitman, San Francisco, Calif., 1979. MR 82a:05047.
White, Dennis E. (1974/75) “Linear and multilinear aspects of isomorph rejection.” Linear and Multilinear Algebra 2, 211–226. MR 51.1 5328.
White, D.E.; Williamson, S.G. (1977) “Recursive matching algorithms and linear orders on the subset lattice.” J. Combinatorial Theory Ser. A 23, no. 2, 117–127. MR 56.2 8448.
White, D.E.; Williamson, S.G. (1980) “Construction of minimal representative systems.” Linear and Multilinear Algebra 9, no. 3, 167–180. MR 82d:05069.
White, Neil L. (1977) “The basis monomial ring of a matroid.” Advances in Math. 24, no. 3, 292–297. MR 55.2 10297.
Wichs, Tomas (1971) “On minimal semirigid relations.” Comment. Math. Univ. Carolinae 12, 359–365. MR 44.1 1583.
Wiegandt, Richard (1975) “A condition in general radical theory and its meaning for rings, topological spaces and graphs.” Acta Math. Acad. Sci. Hungar. 26, no. 3–4, 233–240. MR 53.1 5426.
Wilde, P.J. (1975) “The Euler circuit theorem for binary matroids.” J. Combinatorial Theory Ser. B 18, 260–264. MR 52.1 5451.
Wilde, P.J. (1975) “A partial ordering for matroids.” Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen), pp. 643–645. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976. MR 53.1 5341.
Wilf, Herbert S. (1968) “Divisibility properties of the permanent function.” J. Combinatorial Theory 4, 194–197. MR 36.2 3665a.
Crapo, Henry H. (1968) “Permanents by Mobius inversion.” J. Combinatorial Theory 4, 198–200. MR 36.2 3665b.
Wilf, Herbert S. (1968) “The Mobius function in combinatorial analysis and chromatic graph theory.” Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich.), pp. 179–188. Academic Press, New York, 1969. MR 40.2 7126.
Wille, Detlef (1976) “Asymptotic formulas for the number of oriented graphs.” J. Combinatorial Theory Ser. B 21, no. 3, 270–274. MR 55.2 10313.
Wille, Rudolf (1973) “Finite projective planes and equational classes of modular lattices.” (Italian summary), Colloquio Internazionale sulle Teorie combinatorie (Roma), Tomo II, pp. 167–172. Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome, 1976. MR 57.1 3026.
Williamson, James E. (1973) “A Ramsey-type problem for paths in digraphs.” Math. Ann. 203, 117–118. MR 48.1 3788.
Williamson, S.G. (1966) “A combinatorial property of finite sequences with an application to tensor algebra.” J. Combinatorial Theory 1, 401–410. MR 35.1 211.
Williamson, S.G. (1976) “On the ordering, ranking, and random generation of basic combinatorial sets.” Combinatoire et representation du groupe symetrique (Actes Table Ronde CNRS, Univ. Louis-Pasteur Strasbourg, Strasbourg), pp. 309–339. Lecture Notes in Math., Vol. 579, Springer, Berlin, 1977. MR 58 #10477.
Wilson, Richard M. (1975) “Decompositions of complete graphs into subgraphs isomorphic to a given graph.” Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen), pp. 647–659. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976. MR 53.1 214.
Wilson, Robin J. (1969) “The Mobius function in combinatorial mathematics.” Combinatorial Mathematics and its Applications (Proc. Conf., Oxford), pp. 315–333. Academic Press, London, 1971. MR 43.1 3136.
Wilson, Robin J. (1973) “Graph theory and algebraic topology.” Combinatorics (Proc. British Combinatorial Conf., Univ. Coll. Wales, Aberystwyth), pp. 185–193. London Math. Soc. Lecture Note Ser., No. 13, Cambridge Univ. Press, London, 1974. MR 50.1 3214.
Wilson, Robin J. (Editor) (1978) “Graph theory and combinatorics.” Proceedings of the Conference held at the Open University, Milton Keynes, May 12., 1978. Research Notes in Mathematics, 34. Pitman (Advanced Publishing Program), San Francisco, Calif.-London, 1979. ii+148 pp. MR 81h:05004.
Wilson, Robin J.; Beineke, Lowell W. (Editors) (1979) “Applications of graph theory.” Academic Press, Inc. [Harcourt Brace Jovanovich, Publishers], London-New York, xii+423 pp. MR 81h:05050.
Witsenhausen, H.S. (1980) “On intersections of interval graphs.” Discrete Math. 31, no. 2, 211–216. MR 811:05112.
Witte, David S. (1982) “On Hamiltonian circuits in Cayley diagrams.” Discrete Math. 38, no. 1, 99–108. MR 83k:05055.
Witzgall, C.; Zahn, C.T., Jr. (1965) “Modification of Edmonds’ maximum matching algorithm.” J. Res. Natu. Bur. Standards Sect. B 69B, 91–98. MR 32.2 5548.
Wohlgemuth, Andrew (1975) “The effect of cross reactivity on immunological reaction matrices.” Math. Biosci. 25, no. 1 /2, 51–65. MR 54.2 9714.
Wojciechowski, Jacek (1976) The determination of the structural number of a block graph by the cut-set method. (Polish. Russian and English summaries), Arch. Elektrotech. (Warsaw) 25, no. 2, 271–285. MR 57 #11960.
Wojda, A.P. (1981) “Meyniel’s theorem for strongly (p,q)-Hamiltonian digraphs.” J. Graph Theory 5, no. 3, 333–335. MR 82k:05077.
Wolk, E.S. (1962) “The comparability graph of a tree.” Proc. Amer. Math. Soc. 13, 789–795. MR 30.1 2493.
Wolk, E.S. (1965) “A note on “The comparability graph of a tree”.” Proc. Amer. Math. Soc. 16, 17–20. MR 30.1 2494.
Woodall, D.R. (1971) “A market problem.” J. Combinatorial Theory Ser. B 10, 275–287. MR 44.1 92.
Woodall, D.R. (1974) “An exchange theorem for bases of matroids.” J. Combinatorial Theory Ser. B 16, 227–228. MR 52.2 10462.
Woodall, D.R. (1975) “The induction of matroids by graphs.” J. London Math. Soc. (2) 10, 27–35. MR 51.1 5349.
Woodall, D.R. (1973) “Applications of polymatroids and linear programming to transversals and graphs.” Combinatorics (Proc. British Combinatorial Conf., Univ. Coll. Wales, Aberystwyth), pp. 195–200. London Math. Soc. Lecture Note Ser., No. 13, Cambridge Univ. Press, London, 1974. MR 56.1 2835.
Wormald, Nicholas C. (1981) “On the number of planar maps.” Canad. J. Math. 33, no. 1, 1–11. MR 83a:05074.
Wright, E.M. (1970) “The number of irreducible tournaments.” Glasgow Math. J. 11, 97–101. MR 43.1 109.
Wright, E.M. (1973) “For how many edges is a digraph almost certainly Hamiltonian?”, Proc. Amer. Math. Soc. 41, 384–388. MR 49.2 7182.
Wright, E.M. (1977) “Formulae for the number of sparsely-edged strong labelled digraphs.” Quart. J. Math. Oxford Ser. (2) 28, no. 111, 363–367. MR 58 #349.
Wright, E.M. (1978) “Asymptotic formulas for the number of oriented graphs.” J. Combinatorial Theory Ser. B 24, no. 3, 370–373. MR 58 #5357.
Wu, F.Y. (1977) “Number of spanning trees on a lattice.” J. Phys. A 10, no. 6, L113–L115. MR 58 #8974.
Wu, Zheng Sheng; Zhang, Ke Min; Zou, Yuan (1982) “A necessary and sufficient condition for arc-pancyclicity of tournaments.” Sci. Sinica Ser. A 25, no. 3, 249–254. MR 83m:05070.
Yalavigi, C.C. (1963) “A tournament problem.” Math. Student 31, 51–64 (1964). MR 29.1 1156.
Yalavigi, C.C. (1967) “A mixed doubles tournament problem.” Amer. Math. Monthly 74, 926–933. MR 36.2 6306.
Yang, Caho Chih (1975) “Structural preserving morphisms of finite automata and an application to graph isomorphism.” IEEE Trans. Computers C-24, no. 11, 1133–1139. MR 55.2 12373.
Yang, Kung Wei (1980) “Integration in the umbral calculus.” J. Math. Anal. Appl. 74, no. 1, 200–211. MR 82i:05008.
Yannakakis, M. (1982) “The complexity of the partial order dimension problem.” SIAM J. Alg. Disc. Meth., 3, 351–358.
Yavors’kii, E.B. (1981) “On a matrix representation of graphs.” (Russian), Akad. Nauk Ukrain. SSR Inst. Mat. Preprint, no. 15, Kombinator. Issled. Grafov i Setei, 40–42. MR 83e:05082.
Yelowitz, Lawrence (1976) “An efficient algorithm for constructing hierarchical graphs.” IEEE Trans. Systems Man Cybernet. SMC-6, no. 4, 327–329. MR 53.2 9708.
Yeo, L.H.; Teh, H.H (1969) “Further results of group graphs.” J. Nanyang Univ. 3, 345–379. MR 42.1 133.
Yap, H.P. (1970) “Some addition theorems of group theory with applications to graph theory.” Canad. J. Math. 22, 1185–1195. MR 42.1 1897.
Yap, H.P. (1975) “The characteristic polynomial of the adjacency matrix of a multi–digraph.” Nanta Math. 8, no. 1, 41–46. MR 54.2 10087.
Ye, Yin Yu (1981) “Directed graphs, indefinite equations and the problem of ergodicity for a family of random matrices.” (Chinese. English summary), J. Huazhong Inst. Tech. 9, no. 6, 1–8. MR 83i:05036.
Yeh, Raymond T.; Bang, S.Y. (1974) “Fuzzy relations, fuzzy graphs, and their applications to clustering analysis.” Fuzzy sets and their applications to cognitive and decision processes (Proc. U.S.-Japan Sem., Univ. Calif., Berkeley, Calif.), pp. 125–149. Academic Press, New York, 1975. MR 55.1 5447.
Yoseloff, Mark (1974) “Topologic proofs of some combinatorial theorems.” J. Combinatorial Theory Ser. A 17, 95–111. MR 49.2 10566.
Yoshioka, Chiko (1977) “On the quasi-spannability of graphs.” Sci. Rep. Niigata Univ. Ser. A No. 14, 35–40. MR 56.2 8438.
Younger, D.H. (1968) “Maximum families of disjoint directed cut sets.” Recent Progress in Combinatorics (Proc. Third Waterloo Conf. on Combinatorics), pp. 329–333. Academic Press, New York, 1969. MR 41.1 3324.
Younger, D.H. (1970) “Hall’s theorem and strong covering.” Proc. Louisiana Conf. on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La.), pp. 362–373. Louisiana State Univ., Baton Rouge, La. MR 42.2 5846.
Younger, D.H. (1978) “From shortest paths to directed cut transversals.” Second International Conference on Combinatorial Mathematics (New York), pp. 555–562, Ann. New York Acad. Sci., 319, New York Acad. Sci., New York, 1979. MR 81c:05046.
Youngs, J.W.T. (1963) “Minimal imbeddings and the genus of a graph.” J. Math. Mech. 12, 303–315. MR 26.1 3043.
Zaks, Joseph (1974) “The maximum genus of Cartesian products of graphs.” Canad. J. Math. 26, 1025–1035. MR 50.1 4363.
Zaks, Joseph (1974/75) “Hamiltonian cycles in products of graphs.” Canad. Math. Bull. 17,. no. 5, 763–765. MR 53.2 13034.
Zamfirescu, Cristina (1971) “Disconnected digraphs isomorphic with their line digraphs.” (Italian summary), Boll. Un. Mat. Ital. (4) 4, 888–893. MR 46.1 90.
Zamfirescu, Tudor (1971) “On k-path Hamiltonian graphs and line-graphs.” Rend. Sem. Mat. Univ. Padova 46, 385–389. MR 47.2 8354.
Zaslavsky, Thomas (1975) “Counting the faces of cut-up spaces.” Bull. Amer. Math. Soc. 81, no. 5, 916–918. MR 53.1 3901.
Zaslavsky, Thomas (1977) “A combinatorial analysis of toplogical dissections.” Advances in Math. 25, no. 3, 267–285. MR 56.1 5310.
Zavadskii, A.G. (1978) “Quivers without cycles and with an isolated path of tame type.” (Russian), Akad. Nauk Ukrain. SSR Inst. Mat. Preprint No. 43, 42–56. MR 81k:05057.
Zeilberger, Doron (1980) “Partial difference equations in m1 ≧ m2 ≧ … ≧ mn ≧ 0 and their applications to combinatorics.” Discrete math. 31, no. 1, 65–77. MR 82a:05009.
Zelinka, Bohdan (1966) “Introducting an orientation into a given non-directed graph.” (Russian and English summaries), Mat.-Fyz. Casopis Sloven. Akad. Vied 16, 66–71. MR 34.2 4167.
Zelinka, Bohdan (1967) “Hasse’s operator and directed graphs.” (Czech and Russian summaries), Casopis Pest. Mat. 92, 313–317. MR 36.2 6322.
Zelinka, Bohdan (1970) “The decomposition of a general graph according to a given Abelian group.” Mat. Casopis Sloven. Akad. Vied 20, 281–292. MR 46.2 5166.
Zelinka, Bohdan (1970) “Centrally symmetric Hasse diagrams of finite modular lattices.” Czechoslovak Math. J. 20 (95), 81–83. MR 41.1 103.
Zelinka, Bohdan (1970) “On (H,K)-decompositions of a complete graph.” Mat. Casopis Sloven. Akad. Vied 20, 116–121. MR 46.2 5183.
Zelinka, Bohdan (1970) “Decomposition of a digraph into isomorphic subgraphs.” Mat. Casopis Sloven. Akad. Vied 20, 92–100. MR 46.2 5163.
Zelinka, Bohdan (1971) “Alternating connectivity of digraphs.” (Czech summary), Casopis Pest. Mat. 96, 151–163, 212. MR 44.1 2671.
Zelinka, Bohdan (1971) “Alternating connectivity of tournaments.” (Czech summary), Casopis Pest. Mat. 96, 346–352, 431. MR 51.2 10153.
Zelinka, Bohdan (1971) “The decomposition of a digraph into isotopic subgraphs.” Mat. Casopis Sloven. Akad. Vied 21, 221–226. MR 46.1 3365.
Zelinka, Bohdan (1971) “The group of autotopies of a digraph.” Czechoslovak Math. J. 21 (96), 619–624. MR 48.1 1974.
Zelinka, Bohdan (1971) “Homogeneous digraphs.” Czechoslovak Math. J. 21 (96), 280–290. MR 48.1 1968.
Zelinka, Bohdan (1972) “Isotopy of digraphs.” Czechoslovak Math. J. 22 (97), 353–360. MR 46.2 5164.
Zelinka, Bohdan (1973) “Meromorphisms of graphs.” Czechoslovak Math. J. 23 (98), 50–56. MR 47.2 4869.
Zelinka, Bohdan (1973) “Corrections to: “Some remarks on Menger’s theorem” and “Alternating connectivity of digraphs”.” Casopis Pest. Mat. 98, 98. MR 47.1 1665.
Zelinka, Bohdan (1973) “Quasigroups and factorisation of complete digraphs.” Mat. Casopis Sloven. Akad. Vied 23, 333–341. MR 50.2 12799.
Zelinka, Bohdan (1974) “A remark on dot-compositions of graphs.” J. Indian Math. Soc. (N.S.) 38, no. 1,2,3, 4, 221–225 (1975). MR 54.2 7325.
Zelinka, Bohdan (1975) “Involutory pairs of vertices in transitive graphs.” Mat. Casopis Sloven. Akad. Vied 25, no. 3, 221–222. MR 54.1 145.
Zelinka, Bohdan (1977) “The lattice of all subtrees of a tree.” (Russian summary), Math. Slovaca 27, no. 3, 277–286. MR 80f:05023.
Zelinka, Bohdan (1977) “A remark on isotopies of digraphs and permutation matrices.” (Czech and loose Russian summaries), Casopis Pest. Mat. 102, no. 3, 230–233, 312. MR 57 #12286.
Zelinka, Bohdan (1978) “Infinite directed paths in locally finite digraphs.” (Czech and loose Russian summaries), Casopis Pest. Mat. 103, no. 2, 136–140, 202. MR 58 #350.
Zelinka, B. (1978/79) “Strongly connected digraphs in which each edge is contained in exactly two cycles.” (Russian summary), Acta Cybernet. 4, no. 2, 203–205. MR 80g:05040.
Zelinka, Bohdan (1981) “Cyclically simple tournaments.” Publ. Math. Debrecen 28, no. 1–2, 99–102. MR 82i:05041.
Zelinka, Bohdan (1981) “Graphs of semigroups.” (Czech summary), With a loose Russian summary. Casopis Pest. Mat. 106, no. 4, 407–408, 437. MR 82k:05063.
Zelinka, Bohdan (1981) “Graph representations of finite Abelian groups.” With a loose Russian summary. Czechoslovak Math. J. 31 (106), no. 1, 83–86. MR 82m:05055.
Zelinka, Bohdan (1981) “On two graph-theoretical problems from the conference at Nova Ves u Branzeze.” (Czech summary), With a loose Russian summary. Casopis Pest. Mat. 106, no. 4, 409–413, 437. MR 83f:05064.
Zelinka, Bondan [Zelinka, Bohdan] (1982) “Domatic numbers of cube graphs.” (Russian summary), Math. Slovaca 32, no. 2, 117–119. MR 83g:05067.
Zemlyachenko, V.N.; Korneenko, N.M.; Tyshkevich, R.I. (1982) “The graph isomorphism problem.” (Russian. English summary), Zap. Nauchn. Sm. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 118, 83–158, 215. MR 83i:05067.
Zhang, Cun Quan (1981) “The longest paths and cycles in bipartite oriented graphs.” (Chinese. English summary), J. Math. Res. Exposition, no. 1, First Issue, 35–38. MR 82i:05051.
Zhang, Cun Quan (1980) “Paths and cycles in oriented graphs.” A translation of Kexue tongbao (Chinese) 25, no. 24, 1113–1115.
Zhang, Cun Quan (1982) “Arc-disjoint circuits in digraphs.” Discrete Math. 41, no. 1, 79–96.
Zhu, Yong Jin; Tian, Feng (1979) “On the strong path connectivity of a tournament.” Sci. Sinica, Special Issue II on Math., 18–28. MR 81g:05065.
Znam, Stefan (1970) “The minimal number of edges of a directed graph with given diameter.” Acta Fac. Rerum Natur. Univ. Comenian. Math. Publ. 24, 181–185. MR 45.1 1801
Znam, Stefan (1970) “Decomposition of the complete directed graph into two factors with given diameters.” Mat. Casopis Sloven. Akad. Vied 20, 254–256. MR 46.2 8895
Znoiko, D.V. (1977) “The automorphism groups of regular trees.” (Russian), Mat. Sb. (N.S.) 103 (145), no. 1, 124–130 144. MR 56.1 2864.
Znojil, Jiri (1973) “On some properties of trees with ordered vertices.” Prague Bull. Math. Linguist. No. 20, 59–70. MR 55.2 12552.
Zuckerman, Martin M. (1969) “Number theoretic results related to the axioms of choice for finite sets.” Illinois J. Math. 13, 521–527. MR 40.2 4127.
Zuckerman, Martin M. (1969) “A unifying condition for implications among the axioms of choice for finite sets.” Pacific J. Math. 28, 233–242. MR 39.1 1324.
Zykov, A.A. (1969) “Theory of finite graphs. I.” Izdat. “Nauka” Sibirsk. Otdel., Novosibirsk. 543 pp. MR 42.2 5847.
Zykov, A.A. (1962) “The theory of graphs.” (Russian), Itogi Nauki (Algebra. Topology.), pp. 188–223. Akad. Nauk SSSR Inst. Naucn. Informacii, Moscow, 1963. MR 29.2 5235.
Zykov, A.A. (1963) “Bibliography.” Theory of Graphs and Its Applications (Proc. Sympos. Smolenice), pp. 171–234. Publ. House Czechoslovak Akad. Sci., Prague, 1964. MR0 41.1 3317.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 D. Reidel Publishing Company
About this chapter
Cite this chapter
Pouzet, M. (1985). Introduction. In: Rival, I. (eds) Graphs and Order. NATO ASI Series, vol 147. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-5315-4_26
Download citation
DOI: https://doi.org/10.1007/978-94-009-5315-4_26
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-8848-0
Online ISBN: 978-94-009-5315-4
eBook Packages: Springer Book Archive