\space
| Matroids | Books | Surveys | Bibliography | Software | People |
BIBLIOGRAPHY
A B C D E - H I - L M - P Q - T U - Z

    A
  1. Acketa, D. M. (1984). A construction of non-simple matroids on at most 8 elements. J. Combin. Inform. System Sci. 9, 121-132.
  2. Acketa, D. M. (1988). On binary paving matroids. Discrete Math. 70, 109-110.
  3. Ádám, A. (1957). Über zweipolige elektrische Netze. I. Magyar Tud. Akad. Mat. Kutató Int. Közl. 2, 211-218.
  4. Aigner, M. (1972). Vertauschbarkeit von Partitionen. Math. Z. 127, 281-292.
  5. Aigner, M. (1974). Uniformitat des Verbandes der Partitionen. Math. Ann. 207, 1-22.
  6. Aigner, M. (1975). Symmetrische Zerlegung von Kettenprodukten. (English summary) Monatsh. Math. 79, 177-189.
  7. Aigner, M. (1987). Whitney numbers. In Combinatorial geometries (ed. White, N.), pp. 139-160. Cambridge University Press, Cambridge.
  8. Aigner, M. and Dowling, T. A. (1971). Matching theory for combinatorial geometries. Trans. Amer. Math. Soc. 158, 231-245.
  9. Akkari, S. (1988). On matroid connectivity. Ph. D. thesis, Louisiana State University.
  10. Akkari, S. (to appear). A minimal 3-connectedness result for matroids. Discrete Math.
  11. Akkari, S. and Oxley, J. (1991). Some extremal connectivity results for matroids. J. Combin. Theory Ser. B 52, 301-320.
  12. Alt, F., Menger, K. and Schreiber, O. (1936). New foundations of projective and affine geometry. Annals of Math. (2) 37, 456-481.
  13. Amson, J. C. (1971). Representations of multilinear and polynomial operators on vector spaces. J. London Math. Soc. (2) 4, 394-400.
  14. André, J. (1971). On generalized incidence-structures. In Atti del Convegno di Geometria Combinatoria e sue Applicazioni, pp. 1-6. 1st. Mat., Univ. Perugia, Perugia.
  15. Appel, K. and Haken, W. (1976). Every planar map is four-colorable. Bull. Amer. Math. Soc. 82, 711-712.
  16. Artin, E. (1957). Geometric algebra. Interscience, New York.
  17. Asano, T., Nishizeki, T., and Seymour, P. D. (1984). A note on nongraphic matroids. J. Combin. Theory Ser. B 37, 290-293.
  18. Asche, D. S. (1966). Minimal dependent sets. J. Austral. Math. Soc. 6, 259-262.
  19. Atkin, A. O. L. (1972). Remark on a paper of Piff and Welsh. J. Combin. Theory Ser. B 13, 179-182.

    20. B
  20. Bachem, A. and Kern, W. (1988). On sticky matroids. Discrete Math. 69, 11-18.
  21. Baclawski, K. (1975). Whitney numbers of geometric lattices. Advances in Math. 16, 125-138.
  22. Baclawski, K. and White, N. (1979). Higher order independence in matroids. J. London Math. Soc. (2) 19, 193-202.
  23. Baer, R. (1952). Linear algebra and projective geometry. Academic Press, New York.
  24. Baker, R. D., Bonin, J., Lazebnik, F. and Shustin, E. (1994). On the number of nowhere zero points in linear mappings. Combinatorica 14, 149-157.
  25. Basterfield, J. G. and Kelly, L. M. (1968). A characterization of sets of n points which determine n hyperplanes. Proc. Camb. Phil. Soc. 64, 585-588.
  26. Bean, D. T. (1969). Solution to a matroid problem posed by D. J. A. Welsh. Canad. Math. Bull. 12, 129-131.
  27. Bean, D. T. (1972). Refinements of a matroid. In Proc. Third Southeastern Conf. on Combinatorics, Graph Theory and Computing, pp. 69-72. Florida Atlantic University, FL.
  28. Bean, D. T. (1972). A finitary matroid without a proper finitary refinement. J. Korean Math. Soc. 9, 13-14.
  29. Bennett, M. K., Bogart, K. P. and Bonin, J. (1994). The goemetry of Dowling lattices. Adv. Math. 103, 131-161.
  30. Berge, C. (1969). The rank of a family of sets and some applications to graph theory. In Recent Progress in Combinatorics (Proc. Third Waterloo Conf. on Combinatorics, 1968), pp. 49-57. Academic Press, New York.
  31. Birkhoff, G. (1935). Combinatorial relations in projective geometries. Annals of Math. (2) 36, 743-748.
  32. Birkhoff, G. (1935). Abstract linear dependence in lattices. Amer. J. Math. 57, 800-804.
  33. Birkhoff, G. (1967). Lattice theory. 3rd Ed. American Mathematical Society, Providence, RI.
  34. Bixby, R. E. (1972). Composition and decomposition of matroids and related topics. Ph.D. thesis, Cornell University.
  35. Bixby, R. E. (1974). l-laticies and a characterization of nonbinary matroids. Discrete Math. 8, 139-145.
  36. Bixby, R. E. (1976). A strenghtened form of Tutte's characterization of regular matroids. J. Combin. Theory Ser. B 20, 216-221.
  37. Bixby, R. E. (1977). Kuratowski's and Wagner's theorems for matroids. J. Combin. Theory Ser. B 22, 31-53.
  38. Bixby, R. E. (1979). On Reid's characterization of the ternary matroids. J. Combin. Theory Ser. B 26, 174-204.
  39. Bixby, R. E. (1981). Matroids and operations research. In Advanced techniques in practice of operations research (eds. Greenberg, H. J., Murphy, F. H., Shaw, S. H.), pp. 333-458. North-Holland, New York.
  40. Bixby, R. E. (1982). A simple theorem on 3-connectivity. Linear Algebra Appl. 45, 123-126.
  41. Bixby, R. E. and Coullard, C. R. (1986). On chains of 3-connected matroids. Discrete Appl. Math. 15, 155-166.
  42. Bixby, R. E. and Coullard, C. R. (1987). Finding a smallest 3-connected minor maintaining a fixed minor and a fixed element. Combinatorica 7, 231-242.
  43. Bixby, R. E. and Cunningham, W. H. (1980). Converting linear programs to network problems. Math. Oper. Res. 5, 321-357.
  44. Bixby, R. E. and Cunningham, W. H. (1987). Short cocircuits in binary matroids. European J. Combin. 8, 213-225.
  45. Bixby, R. E. and Rajan, A. (1989). A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids. Linear Algebra Appl. 114/115, 277-292.
  46. Björner, A. and Ziegler, G. M. (1991). Broken circuit complexes: factorizations and generalizations. J. Combin. Theory, Ser. B 51, 96-126.
  47. Björner, A. and Ziegler, G. M. (1992). Introduction to Greedoids. In Matroid applications (ed. White, N.), pp. 284-357. Cambridge University Press, Cambridge.
  48. Björner, A., Las Vergnas, M., Sturmfels, B., White, N., and Ziegler, G. (1993). Oriented matroids. Cambridge University Press, Cambridge.
  49. Blackburn, J. E., Crapo, H. H., and Higgs, D. A. (1973). A catalogue of combinatorial geometries. Math. Comp. 27, 155-166.
  50. Blake, I. F. and Mullin, R. C. (1975). The mathematical theory of coding. Academic Press, New York-London.
  51. Bland, R. G. and Las Vergnas, M. (1978). Orientability of matroids. J. Combin. Theory Ser. B 24, 94-123.
  52. Bleicher, M. N. and Preston, G. B. (1961). Abstract linear dependence relations. Publ. Math. Debrecen 8, 55-63.
  53. Bogart, K. P. and Bonin, J. (1991). A geometric characterization of Dowling lattices. J. Combin. Theory Ser. A 56, 195-202.
  54. Bollobás, B. (1969). A lower bound for the number of non-isomorphic matroids. J. Combin. Theory 7, 366-368.
  55. Bollobás, B. (1978). Extremal graph theory. Academic Press, London.
  56. Bondy, J. A. (1972). Transversal matroids, base-orderable matroids, and graphs. Quart. J. Math. Oxford Ser. (2) 23, 81-89.
  57. Bondy, J. A. (1972). Transversal matroids, base-orderable matroids and graphs. Quart. J. Math. Oxford Ser. (2) 23, 81-89.
  58. Bondy, J. A. (1972). Presentations of transversal matroids. J. London Math. Soc. (2) 5, 289-292.
  59. Bondy, J. A. and Murty, U. S. R. (1976). Graph theory with applications. North-Holland, New York.
  60. Bondy, J. A. and Welsh, D. J. A. (1971). Some results on transversal matroids and constructions for identically self-dual matroids. Quart. J. Math. Oxford Ser. (2) 22, 435-451.
  61. Bonin, J. (1993). Modular elements of higher-weight Dowling lattices. Discrete Math. 119, 3-11.
  62. Bonin, J. (1993). Automorphism groups of higher-weight Dowling geometries. J. Combin. Theory, Ser. B 58, 161-173.
  63. Bonin, J. (1995). Automorphisms of Dowling lattices and related geometries. Combin. Probab. Comput. 4, 1-9.
  64. Bonin, J. (1996). Matroids with no (q+2)-point-line minors. Adv. Appl. Math. 17, 460-476.
  65. Bonin, J. (1998). On basis-exchange properties for matroids. Discrete Math. 187, 265-268.
  66. Bonin, J. (2000) Involutions of connected binary matroids. Combinatorics, Probability and Computing 9, 305-308.
  67. Bonin, J. and Kung, J. P. S. (1994). Every group is the automorphism group of a rank-3 matroid. Geom. Dedicata 50, 243-246.
  68. Bonin, J. and Kung, J. P. S. (1998). The number of points in a combinatorial geometry with no 8-point minor. Mathematical Essays in Honor of Gian-Carlo Rota B. Sagan and R. Stanley, eds., Birkhauser, 271-284.
  69. Bonin, J. and Miller, W.P. (1999) Characterizing combinatorial geometries by numerical invariants, European J. Combin. 20, 713-724.
  70. Bonin, J., McNulty, J., and Reid, T. J. (1999). The matroid Ramsey number n(6,6). Combinatorics, Probability and Computing. 8 229-235.
  71. Bonin, J., Oxley, J. and Servatius, B., eds. (1996). Matroid theory: Proceedings of the 1995 AMS-IMS-SIAM Joint Summer Research Conference. American Mathematical Society, Providence, RI.
  72. Bonin, J and Reid, T. J., (2000) Simple matroids with bounded cocircuit size. Combinatorics Probability and Computing 9, 407-419.
  73. Bonin, J. and Qin, H. (2000) Size functions of subgeometry-closed classes of representable combinatorial geometries Discrete Math. 224, 37-60.
  74. Bonin, J. and Qin, H. (2001) Tutte polynomials of q-cones. Discrete Math. 232, 5-103.
  75. Boruvka, O. (1926). O jistém problemu minimálním. Práce Mor. Prírodoved Spol. v Brne (Acta Societ. Scient. Natur. Moravicae) 3, 37-58.
  76. Bose, R. C. (1947). Mathematical theory of the symmetrical factorial design. Sankyha 8, 107-166.
  77. Brown, D. P. (1966). On the rank and nullity of subgraphs. SIAM Rev. 8, 220-223.
  78. Brown, T. (1971). Deriving closure relations with exchange property. Notes (and an editorial appendix) by H. Crapo and G. Roulet. In Mobius algebras. (Proc. Conf. Univ. Waterloo, 1971), pp. 51-55. University of Waterloo, Ontario.
  79. Brown, T. J. (1974). Transversal theory and F-products. J. Combinatorial Theory Ser. A 17, 290-298.
  80. Brown, W.G., ed. (1980). Reviews in graph theory, Vols. 1-4. American Mathematical Society, Providence, RI.
  81. Brualdi, R. A. (1969). Comments on bases in dependence structures. Bull. Austral. Math. Soc. 1, 161-167.
  82. Brualdi, R. A. (1970). Admissible mappings between dependence spaces. Proc. London Math. Soc. (3) 21, 296-312.
  83. Brualdi, R. A. (1971). Induced matroids. Proc. Amer. Math. Soc. 29, 213-221.
  84. Brualdi, R. A. (1971). On families of finite independence structures. Proc. London Math. Soc. (3) 22, 265-293.
  85. Brualdi, R. A. (1971). Generalized transversal theory. In Théorie des matröides, Lecture Notes in Math., Vol. 211, Springer, Berlin.
  86. Brualdi, R. A. (1972). Uniqueness of an independent transversal of a family of sets. Proc. Cambridge Philos. Soc. 72, 375-380.
  87. Brualdi, R. A. (1974). Weighted join semilattices and transversal matroids. Trans. Amer. Math. Soc. 191, 317-328.
  88. Brualdi, R. A. (1974). On fundamental transversal matroids. Proc. Amer. Math. Soc. 45, 151-156.
  89. Brualdi, R. A. and Dinolt, G. W. (1972). Characterizations of transversal matroids and their presentations. J. Combin. Theory Ser. B 12, 268-286.
  90. Brualdi, R. A. and Dinolt, G. W. (1975). Truncations of principle geometries. Discrete Math. 12, 113-138.
  91. Brualdi, R. A. and Fonseca, A. (to appear). Colorability of induced matroidsDiscrete Math.
  92. Brualdi, R. A. and Mason, J. H. (1972). Transversal matroids and Hall's theorem. Pacific J. Math. 41, 601-613.
  93. Brualdi, R. A. and Scrimger, E. B. (1968). Exchange systems, matchings, and transversals. J. Combin. Theory 5, 244-257.
  94. Brualdi, R. A., Scrimger, E. B. (1968). Exchange systems, matchings and transversals. J. Combin. Theory 5, 244-257.
  95. Bruck, R. H. and Ryser, H. J. (1949). The nonexistence of certain finite projective planes. Canad. J. Math. 1, 88-93.
  96. Bruno, J. and Weinberg, L. (1970). Principal partition and principal minors of a matroid, with applications. In International conference on combinatorial mathematics. Ann. New York Acad. Sci. 175, pp. 49-65.
  97. Bruno, J. and Weinberg, L. (1971). The principal minors of a matroid. Linear Algebra and Appl. 4, 17-54.
  98. Bruno, J. Weinberg, L. (1976). Generalized networks: networks embedded on a matroid. I. Networks 6, no. 1, 53-94.
  99. Bruter, C. P. (1969). Vue d'ensemble sur las théorie des matroides. Bull. Soc. Math. France Suppl. Mem. 17, 48 pp.
  100. Bruter, C. P. (1970). Application des notions de stabilité et d'extrémalité a la théorie des matroïdes. C. R. Acad. Sci. Paris Sér. A-B 271, A-542-545.
  101. Bruter, C. P. (1971). Déformations des matroïdes. C. R. Acad. Sci. Paris Sér. A-B 273, A9-A10.
  102. Bruter, C. P. (1974). Elements de la théeorie des matroides. Springer-Verlag, Berlin-New York.
  103. Brylawski, T. H. (1971). A combinatorial model for series-parallel networks. Trans. Amer. Math. Soc. 154, 1-22.
  104. Brylawski, T. H. (1971). The Möbius function on geometric lattices as a decomposition invariant. In Möbius algebras (Proc. conf., Univ. Waterloo, Waterloo, Ont.) pp. 143-148. University of Waterloo, Waterloo, Ont.
  105. Brylawski, T. H. (1972). The Tutte Grothendieck ring. Algebra Universalis 2, 375-388.
  106. Brylawski, T. H. (1972). A decomposition for combinatorial geometries. Trans. Amer. Math. Soc. 171, 235-282.
  107. Brylawski, T. H. (1973). Some properties of basic families of subsets. Discrete Math. 6, 333-341.
  108. Brylawski, T. H. (1974). Reconstructing combinatorial geometries. In Graphs and combinatorics (eds. Bari, R. A. and Harary, F.), Lecture Notes in Math. Vol. 406, pp. 226-235. Springer-Verlag, Berlin.
  109. Brylawski, T. H. (1975). On the nonreconstructibility of combinatorial geometries. J. Combin. Theory Ser. B 19, 72-76.
  110. Brylawski, T. H. (1975). An affine representation for transversal geometries. Studies in Appl. Math. 54, 143-160.
  111. Brylawski, T. H. (1975). Modular constructions for combinatorial geometries. Trans. Amer. Math. Soc. 203, 1-44.
  112. Brylawski, T. H. (1975). A note on Tutte's unimodular representation theorem. Proc. Amer. Math. Soc. 52, 499-502.
  113. Brylawski, T. H. (1981). Hyperplane reconstruction of the Tutte polynomial of a geometric lattice. Discrete Math. 35, 25-38.
  114. Brylawski, T. H. (1982). The Tutte polynomial. Part I: General Theory. In Matroid theory and its applications (ed. Barlotti, A.), pp. 125-275. Liguori editore, Naples.
  115. Brylawski, T. H. (1982). Finite prime-field characteristic sets for planar configurations. Linear Algebra Appl. 46, 155-176.
  116. Brylawski, T. H. (1986). Appendix of matroid cryptomorphisms. In Theory of matroids (ed. White, N.), pp. 298-312. Cambridge University Press, Cambridge.
  117. Brylawski, T. H. (1986). Constructions. In Theory of matroids (ed. White, N.), pp. 127-223. Cambridge University Press, Cambridge.
  118. Brylawski, T. H. and Kelly, D. (1980). Matroids and combinatorial geometries. Department of Mathematics, University of North Carolina, Chapel Hill.
  119. Brylawski, T. H. and Lucas, D. (1976). Uniquely representable combinatorial geometries. In Teorie combinatorie (Proc. 1973 Internat. Colloq.), pp. 83-104. Accademia Nazionale dei Lincei, Rome.
  120. Brylawski, T. H. and Oxley, J. (1992). The Tutte polynomial and its applications. In Matroid applications (ed. White, N.), pp. 123-225. Cambridge University Press, Cambridge.
  121. Bush, K. A. (1952). Orthogonal arrays of index unity. Ann. Math. Statist. 23, 426-434.
  122. Butterworth, R. W. (1972). A set theoretic treatment of coherent systems. SIAM J. Appl. Math. 22, 590-598.

    123. C
  123. Camerini, P. M. and Maffioli, F. (1974/75). Bounds for 3-matroid intersection problems. Information Processing Lett. 3, 81-83.
  124. Cameron, P. J. (1980). Extremal results and configuration theorems for Steiner systems. In Topics on Steiner Systems. Ann. Discrete Math., 7, pp. 43-63. North-Holland, Amsterdam.
  125. Camion, P. (1963). Caracterisation des matrices unimodulaires. Cahiers Centre Etudes Rech. Oper. 5, 181-190.
  126. Cardy, S. (1973). The proof of, and generalisations to, a conjecture by Baker and Essam. Discrete Math. 4, 101-122.
  127. Casse, L. R. A. (1969). A solution to Beniamino Segre's "Problem I(r,q)" for q even. Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. (8) 46, 13-20.
  128. Catlin, P. A., Grossman, J. W., Hobbs, A. M. and Lai, H. J. (1992). Fractional arboricity, strength, and principal partitions in graphs and matroids. Discrete Applied Math. 40, 285-302.
  129. Chakravarti, K. and Robertson, N. (1980). Covering three edges with a bond in a non-separable graph. In Combinatorics 79, Part I (eds. Deza, M. and Rosenberg, I. G.), Ann. Discrete Math. 8, pp. 247. North-Holland, Amsterdam.
  130. Chartrand, G. and Harary, F. (1967). Planar permutation graphs. Ann. Inst. H. Poincare Sect. B (N. S.) 3, 433-438.
  131. Chen, Z. H. and Lai, H. J. (submitted). Connectivity of cycle matroids and bicircular matroids.
  132. Cheung, A. L. C. (1974). Compatible extensions of a combinatorial geometry. Ph. D. thesis, University of Waterloo.
  133. Coullard, C. R. (1985). Minors of 3-connected matroids and adjoints of binary matroids. Ph. D. thesis, Northwestern University.
  134. Coullard, C. R. (1986). Counterexamples to conjectures on 4-connected matroids. Combinatorica 6, 315-320.
  135. Coullard, C. R. and Oxley, J. G. (to appear). Extension of Tutte's wheels-and-whirls theorem. J. Combin. Theory Ser. B.
  136. Coullard, C. R. and Pulleyblank, W. R. (1989). On cycle cones and polyhedra. Linear Alg. Appl. 114/115, 613-640.
  137. Coullard, C. R. and Reid, T. J. (1988). Element subsets of 3-connected matroids. Congressus Numerantium 66, 81-92.
  138. Coullard, C. R., Gardner, L. L., and Wagner, D. K. (to appear). Decomposition of 3-connected graphs. Combinatorica.
  139. Coxeter, H. S. M. (1958). Twelve points in PG(5,3) with 95040 self-transformations. Proc. Roy. Soc. London Ser. A 247, 279-293.
  140. Crapo, H. H. (1965). Single-element extensions of matroids. J. Res. Nat. Bur. Standards Sect. B 69B, 55-65.
  141. Crapo, H. H. (1966). The Möbius function of a lattice. J. Combin. Theory 1, 126-131.
  142. Crapo, H. H. (1967). A higher invariant for matroids. J. Combin. Theory 2, 406-417.
  143. Crapo, H. H. (1967). Structure theory for geometric lattices. Rend. Sem. Mat. Univ. Padova 38, 14-22.
  144. Crapo, H. H. (1967). The joining of exchange geometries. J. Math. Mech. 17, 837-852.
  145. Crapo, H. H. (1969). The Tutte polynomial. Aequationes Math. 3, 211-229.
  146. Crapo, H. H. (1969). Möbius inversion in lattices. Arch. Math. (Basel) 19, 595-607.
  147. Crapo, H. H. (1970). Geometric duality and the Dilworth completion. In Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969), pp. 37-46. Gordon and Breach, NY.
  148. Crapo, H. H. (1970). Erecting geometries. In Proc. Second Chapel Hill Conf. on combinatorial mathematics and its applications (Univ. North Carolina, Chapel Hill, NC., 1970), pp. 74-99. Univ. North Carolina, Chapel Hill, N.C.
  149. Crapo, H. H. (1970). Erecting geometries. In International conference on combinatorial mathematics. Ann. New York Acad. Sci. 175, 89-92.
  150. Crapo, H. H. (1971). Numerical invariants of geometries and graphs. In Proceedings of the Twenty-Fifth Summer Meeting of the Canadian Mathematical Congress, pp. 42-54. Lakehead Univ., Thunder Bay, Ontario.
  151. Crapo, H. H. (1971). Orthogonal representations of combinatorial geometries. In Atti del Convegno di Geometria Combinatoria e sue Applicazion (Univ. degli Studi di Perugia, Perugia, 1970), pp. 175-186.
  152. Crapo, H. H. and Rota, G. -C. (1970). On the foundations of combinatorial theory: combinatorial geometries (preliminary edition). M. I. T. Press, Cambridge, MA.
  153. Crapo, H. H. and Rota, G. -C. (1970). Geometric lattices. In Trends in Lattice Theory (Sympos., U.S. Naval Academy, Annapolis, MD, 1966), pp. 127-172. Van Nostrand Reinhold, NY.
  154. Crapo, H. H. and Rota, G. -C. (1971). On the foundations of combinatorial theory. II. Combinatorial geometries. Studies in Appl. Math. 49, 109-133.
  155. Crapo, H. H. and Roulet, G., eds. (1971). Mobius algebras, Proceedings of a Conference, University of Waterloo, 1971, University of Waterloo, Ontario.
  156. Cunningham, W. H. (1973). A combinatorial decomposition theory. Ph. D. thesis, University of Waterloo.
  157. Cunningham, W. H. (1977). Chords and disjoint paths in matroids. Discrete Math. 19, 7-15.
  158. Cunningham, W. H. (1979). Binary matroid sums. Quart. J. Math. Oxford Ser. (2) 30, 271-281.
  159. Cunningham, W. H. (1981). On matroid connectivity. J. Combin. Theory Ser. B 30, 94-99.
  160. Cunningham, W. H. and Edmonds, J. (1980). A combinatorial decomposition theory. Canad. J. Math. 32, 734-765.
  161. Curtis, G. (1971). An inequality for the Möbius function of a geometric lattice. In Mobius Algebras (Proc. Conf. Univ. Waterloo, 1971), pp. 149-153. University of Waterloo, Ontario.

    162. D
  162. d'Ambly, C. G. (1970). Whitneysche Abhángigkeitsstrukturen. In Combinatorial Theory and its Applications, I (Proc. Colloq., Balatonfüred 1969), pp. 25-37. North-Holland, Amsterdam.
  163. Dawson, J. E. (1980). Optimal matroid bases: an algorithm based on cocircuits. Quart. J. Math. Oxford (2) 31, 65-69.
  164. Dawson, J. E. (1981). A simple approach to some basic results in matroid theory. J. Math. Anal. Appl. 84, 555-559.
  165. Dawson, J. E. (1983). Balanced sets in an independence structure induced by a submodular function. J. Math. Anal. Appl. 95, 214-222.
  166. Dawson, J. E. (1984). Solubility of the matroid sum equation. Ars Combinatoria 17A, 103-116.
  167. Dawson, J. E. (1985). Decomposition of binary matroids. Combinatorica 5, 1-9.
  168. Dawson, J. E. (1988). Some necessary conditions for sums of matroids. Quart. J. Math. Oxford Ser. (2) 39, 281-283.
  169. de Sousa, J. and Welsh, D. J. A. (1972). A characterization of binary transversal matroids. J. Math. Anal. Appl. 95, 214-222.
  170. Dembowski, P. (1968). Finite geometries. Springer-Verlag, New York.
  171. Dharmatilake, J. (1994). Binary matroids of branch-width three. Ph. D. Thesis, Ohio State University.
  172. Dilworth, R. P. (1940). Note on complemented modular lattices. Bull. Amer. Math. Soc. 46, 74-76.
  173. Dilworth, R. P. (1941). Ideals in Birkhoff lattices. Trans. Amer. Math. Soc. 49, 325-353.
  174. Dilworth, R. P. (1941). The arithmetic theory of Birkhoff lattices. Duke Math. J. 8, 286-299.
  175. Dilworth, R. P. (1944). Dependence relations in a semimodular lattice. Duke Math. J. 11, 575-587.
  176. Dilworth, R. P. and Greene, C. (1971). A counterexample to the generalization of Sperner's theorem. J. Combin. Theory Ser A. 10, 18-21.
  177. Dinolt, G. W. (1971). An extremal problem for non-seperable matroids. In Théorie des matroides (Recontre Franco-Britannique, Brest, 1970) Lecture Notes in Math., Vol. 211, pp. 31-49. Springer, Berlin.
  178. Dirac, G. A. (1952). A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc. 27, 85-92.
  179. Dirac, G. A. (1952). Some theorems on abstract graphs. Proc. London Math. Soc. (3) 2, 69-81.
  180. Dirac, G. A. (1960). In abstrakten Graphen vorhande vollstandige 4-Graphen und ihre Unterteilungen. Math. Nach. 22, 61-85.
  181. Dirac, G. A. (1967). Minimally 2-connected graphs. J. Reine Angew. Math. 228, 204-216.
  182. Dlab, V. (1962). General algebraic dependence relations. Publ. Math. Debrecen 9, 324-355.
  183. Dlab, V. (1964). A generalization of dependence relations. In Proc. Colloq. Abelian Groups (Tihany, 1963) pp. 49-50. Akadémiai Kiadó, Budapest.
  184. Dlab, V. (1964). Algebraic dependence structures. Comment. Math. Univ. Carolinae 5, 241-246.
  185. Dlab, V. (1965). Axiomatic treatment of bases in arbitary sets. (Russian summary) Czechoslovak Math. J. 15 (90), 554-564.
  186. Dlab, V. (1965). The role of the "finite character property" in the theory of dependence. Comment. Math. Univ. Carolinae 6, 97-104.
  187. Dlab, V. (1966). General algebraic dependence structures and some applications. Colloq. Math. 14, 265-273.
  188. Dlab, V. (1966). Dependence over modules. (Russian summary) Czechoslovak Math. J. 16 (91), 137-157.
  189. Dlab, V. (1966). Algebraic dependence structures. Z. Math. Logik Grundlagen Math. 12, 345-377.
  190. Dlab, V. (1970). Lattice formulation of general algebraic dependence. Czechoslovak Math. J. 20, 603-615.
  191. Doignon, J. P.(1981). Minimum number of circuits in affine sets. European J. Combin. 2, 355-338.
  192. Doignon, J. P.(1981). On characterizations of binary and graphic matroids. Discrete Math. 37, 299-301.
  193. Doob, M. (1973). An interrelation between line graphs, eigenvalues, and matroids. J. Combin. Theory Ser. B 15, 40-50.
  194. Dowling, T. A. (1973). A q-analog of the partition lattice. In A survey of combinatorial theory (eds. Srivastava, J. N. et al), pp. 101-115. North-Holland, Amsterdam.
  195. Dowling, T. A. (1973). A class of geometric lattices bases on finite groups. J. Combin. Theory Ser. B 14, 61-86.
  196. Dowling, T. A. (1980). On the independent set numbers of a finite matroid. In Combinatorics 79. Part I (eds. Deza, M. and Rosenberg, I. G.), Ann. Discrete Math. 8, pp. 21-28. North-Holland, Amsterdam.
  197. Dowling, T. A. and Kelly, D. G. (1974). Elementary strong maps and transversal geometries. Discrete Math. 7, 209-224.
  198. Dowling, T. A. and Kelly, D. G. (1974). Elementary strong maps and transversal geometries. In Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, OH, 1972; dedicated to Arnold Ross) Lecture Notes in Math., Vol. 411, pp. 176-186 Springer, Berlin, 1974.
  199. Dowling, T. A. and Wilson, R. M. (1974). The slimmest geometric lattices. Trans. Amer. Math. Soc. 196, 203-215.
  200. Dowling, T. A. and Wilson, R. M. (1975). Whitney number inequalities for geometric lattices. Proc. Amer. Math. Soc. 47, 504-512.
  201. Duchamp, A. (1972). Sur certains matroides définis a partir des graphes. C. R. Acad. Sci. Paris Sér. A-B 274, A9-A11.
  202. Duchamp. A. (1974). Une charactérisation des matroïdes binaires par une propriété de coloration. C. R. Acad. Sci. Paris Sér. A 278, 1163-1166.
  203. Duffin, R. J. (1965). Topology of series-parallel networks. J. Math. Anal. Appl. 10, 303-318.
  204. Duke, R. (1981). Freedom in matroids. Ph. D. thesis, The Open University.
  205. Duke, R. (1987). On binary reducibility. European J. Combin. 9, 109-111.
  206. Dunstan, F. D. J. and Welsh, D. J. A. (1973). A greedy algorithm for solving a certain class of linear programmes Math. Programming 5, 338-353.
  207. Dunstan, F. D. J., Ingleton, A. W. and Welsh, D. J. A. (1972). Supermatroids. In Combinatorics (eds. Welsh, D. J. A. and Woodall, D.) pp. 72-122. Institute of Math. and its Applications, Southend-on-Sea.
A B C D E - H I - L M - P Q - T U - Z
| Matroids | Books | Surveys | Bibliography | Software | People |