\space
| Matroids | Books | Surveys | Bibliography | Software | People |
BIBLIOGRAPHY
A - D E - H I - L M - P Q - T U V W X Y Z

    U
  1. Ultang, O. (1972). Systems of independent representatives. J. London Math. Soc. (2) 4, 745-752.

    2. V
  2. Vamos, P. (1968). On the representation of independence structures (unpublished manuscript).
  3. Vamos, P. (1971). A necessary and sufficient condition for a matroid to be linear. In Mobius algebras (Proc. Conf. Univ. Waterloo, 1971), pp. 166-173. University of Waterloo, Ontario.
  4. Vamos, P. (1971). Linearity of matroids over division rings (notes by Roulet, G.). In Mobius algebras (Proc. Conf. Univ. Waterloo, 1971), pp. 174-178. University of Waterloo, Ontario.
  5. Van Der Waerden, B. L. (1937). Moderne algebra Vol. I. Second Edition. Springer-Verlag, Berlin.
  6. Vertigan, D. and Whittle, G. (1993). Recoginizing polymatroids associated with hypergraphs. Combinatorics, Probability and Computing 2, 519-530.
  7. von Randow, Rabe (1975). Introduction to the theory of matroids, Springer-Verlag, Berlin-New York.

    8. W
  8. Wagner, D. K. (1985). On theorems of Whitney and Tutte. Discrete Math. 57, 147-154.
  9. Wagner, D. K. (1988). Equivalent factor matroids of graphs. Combinatorica 8, 373-377.
  10. Wagner, K. (1937). Uber eine Eigenshaft der ebenen Komplexe. Math. Ann. 114, 570-590.
  11. Wagner, K. (1937). Uber eine Erweiterung eines Satzes von Kuratowski. Deut Math. 2, 280-285.
  12. Wagner, K. (1960). Bemerkungen zu Hadwigers Vermutung. Math. Ann. 141, 433-451.
  13. Wagstaff, S. S. Jr. (1973). Infinite matroids. Trans. Amer. Math. Soc. 175, 141-153.
  14. Walton, P. (1981). Some topics in combinatorial theory. D. Phil. thesis, University of Oxford.
  15. Walton, P. N. and Welsh, D. J. A. (1980). On the chromatic number of binary matroids. Mathematika 27, 1-9.
  16. Wanner, T. and Zeigler, G. M. (1991). Supersolvable and modularly complemented matroid extensions. European J. Combin. 12, 341-360.
  17. Watkins, M. E. and Mesner, D. M. (1967). Cycles and connectivity in graphs. Canad. J. Math. 19, 1319-1328.
  18. Weinberg, L. (1975). Duality in networks: roses, bouquets and cut-sets; trees, forests and polygons. Networks 5, 179-201.
  19. Welsh, D. J. A. (1967). On dependence in matroids. Canad. Math. Bull. 10, 599-603.
  20. Welsh, D. J. A. (1968). Kruskal's theorem for matroids. Proc. Camb. Phil. Soc. 64, 3-4.
  21. Welsh, D. J. A. (1969). Transversal theory and matroids. Canad. J. Math. 21, 1323-1330.
  22. Welsh, D. J. A. (1969). A bound for the number of matroids. J. Combin. Theory 6, 313-316.
  23. Welsh, D. J. A. (1969). On the hyperplanes of a matroid. Proc. Camb. Phil. Soc. 65, 11-18.
  24. Welsh, D. J. A. (1969). Euler and bipartite matroids. J. Combin. Theory 6, 375-377.
  25. Welsh, D. J. A. (1970). On matroid theorems of Edmonds and Rado. J. London Math. Soc. (2) 2, 251-256.
  26. Welsh, D. J. A. (1971). Matroids and block designs. In Théorie des matroïdes (Rencontre Franco-Britannique, Brest, 1970), Lecture Notes in Math., Vol. 211, pp. 95-106. Springer, Berlin.
  27. Welsh, D. J. A. (1971). Generalized versions of Hall's theorem. J. Combin. Theory Ser. B 10, 95-101.
  28. Welsh, D. J. A. (1971). Related classes of set functions. In Studies in Pure Mathematics (Presented to Richard Rado), pp. 261-269. Academic Press, London.
  29. Welsh, D. J. A. (1971). Combinatorial problems in matroid theory. In Combinatorial mathematics and its applications (ed. Welsh, D. J. A.), pp. 291-306. Academic Press, London.
  30. Welsh, D. J. A. (1976). Matroid theory. Academic Press, London.
  31. Welsh, D. J. A. (1982). Matroids and combinatorial optimization. In Matroid theory and its applications (ed. Barlotti, A.), pp. 323-416. Liguori editore, Naples.
  32. White, N. L. (1970). Coordinatization of combinatorial geometries. In Proc. Second Chapel Hill Conf. on Combinatorial Mathematics and its Applications. (Univ. North Carolina, Chapel Hill, NC, 1970), pp. 484-486. University of North Carolina, Chapel Hill, NC.
  33. White, N. L. (1971). The bracket ring and combinatorial geometry. Ph. D. thesis, Harvard University.
  34. White, N. L. (1974). A basis extension property. J. London Math. Soc. (2) 7, 662-664.
  35. White, N. L. (1975). The bracket ring of a combinatorial geometry. I Trans. Amer. Math. Soc. 202, 79-95.
  36. White, N. L. (1980). A unique exchange property for bases. Linear Algebra Appl. 31, 81-91.
  37. White, N. L. (1980). The transcendence degree of a coordinatization of a combinatorial geometry. J. Combin. Theory Ser. B 29, 168-175.
  38. White, N. L. (1987). Unimodular matrices. In Combinatorial geometries (ed. White, N.), pp. 40-52. Cambridge University Press, Cambridge.
  39. White, N. L. (1987). Coordinatizations. In Combinatorial geometries (ed. White, N.), pp. 1-27. Cambridge University Press, Cambridge.
  40. White, N. L., ed. (1986). Theory of matroids. Cambridge University Press, Cambridge.
  41. White, N. L., ed. (1987). Combinatorial geometries. Cambridge University Press, Cambridge.
  42. White, N. L., ed. (1992). Matroid applications. Cambridge University Press, Cambridge.
  43. Whitney, H. (1932). The coloring of graphs. Annals of Math. (2) 33, 688-718.
  44. Whitney, H. (1932). Non-separable and planar graphs. Trans. Amer. Math. Soc. 34, 339-362.
  45. Whitney, H. (1932). A logical expansion in mathematics. Bull. Amer. Math. Soc. 38, 572-579.
  46. Whitney, H. (1932). Congruent graphs and the connectivity of graphs. Amer. J. Math. 54, 150-168.
  47. Whitney, H. (1933). Planar graphs. Fundamenta Math. 21, 73-84.
  48. Whitney, H. (1933). A set of topological invariants for graphs. Amer. J. Math. 55, 231-235.
  49. Whitney, H. (1933). On the classification of graphs. Amer. J. Math. 55, 236-244.
  50. Whitney, H. (1933). 2-isomorphic graphs. Amer. J. Math. 55, 245-254.
  51. Whitney, H. (1935). On the abstract properties of linear dependence. Amer. J. Math. 57, 509-533.
  52. Whittle, G. (1984). On the critical exponent of the transversal matroids. J. Combin. Theory Ser. B 37, 94-95.
  53. Whittle, G. (1985). An elementary proof that every matroid is an intersection of transversal matroids. Discrete Math. 54, 239.
  54. Whittle, G. (1987). Modularity in tangential k-blocks. J. Combin. Theory Ser. B 42, 24-35.
  55. Whittle, G. (1988). Quotients of tangential k-blocks. Proc. Amer. Math. Soc. 102, 1088-1098.
  56. Whittle, G. (1989). q-lifts of tangential k-blocks. J. London Math. Soc. 39, 9-15.
  57. Whittle, G. (1989). Dowling group geometries and the critical problem. J. Combin. Theory Ser. B 47, 80-92.
  58. Whittle, G. (1989). A generalization of the matroid lift construction. Trans. Amer. Math. Soc. 316, 141-159.
  59. Whittle, G. (1990). Quotients of Dilworth truncations. J. Combin. Theory Ser. B 49, 78-86.
  60. Whittle, G. (1992). A geometric theory of hypergraph colorings. Aequationes Math. 43, 45-58.
  61. Whittle, G. (1992). Duality in polymatroids and set functions. Combinatorics, Probability and Computing 1, 275-280.
  62. Whittle, G. (1993). Characteristic polynomials of weighted lattices. Advances in Mathematics. 99, 125-151.
  63. Whittle, G. (1994). The critical problem for polymatroids. Quart. J. Math. Oxford Ser B 45, 117-126.
  64. Whittle, G. (1995). A characterization of the matroids representable over GF(3) and the rationals. J. Combin. Theory Ser. B 65, 222-261.
  65. Whittle, G. (1996). Inequivalent representations of ternary matroids. Discrete Math. 149, 233-238.
  66. Whittle, G. (to appear). On matroids representable over GF(3) and other fields. Trans. Amer. Math. Soc.
  67. Whittle, G. (to appear). Partial fields and matroid representation. Advances in Applied Math.
  68. Wilcox, L. R. (1939). Modularity in the theory of lattices. Annals of Math. (2) 40, 490-505.
  69. Wilcox, L. R. (1941). A topology for semi-modular lattices. Duke Math. J. 8, 273-285.
  70. Wilcox, L. R. (1944). Modularity in Birkhoff lattices. Bull. Amer. Math. Soc. 50, 135-138.
  71. Wilde, P. J. (1975). The Euler circuit theorem for binary matroids. J. Combin. Theory Ser. B 18, 260-264.
  72. Wilde, P. J. (1976). A partial ordering for matroids. In Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975), Congressus Numerantium, No. XV, pp. 643-645. Utilitas Math., Winnipeg, Man.
  73. Wille, R. (1971). On incidence geometries of grade n. In Atti del Convegno di Geometria Combinatoria e sue Applicazioni, pp. 421-426. 1st. Mat., Univ. Perugia, Perugia.
  74. Wilson, R. J. (1973). An introduction to matroid theory. Amer. Math. Monthly 80, 500-525.
  75. Witt, E. (1940). Über Steinersche Systeme. Abh. Math. Sem. Univ. Hamburg 12, 265-275.
  76. Wong, P. -K. (1978). On certain n-connected matroids. J. Reine Angew. Math. 299/300, 1-6.
  77. Woodall, D. R. (1974). An exchange theorem for bases of matroids. J. Combin. Theory Ser. B 16, 227-229.
  78. Woodall, D. R. (1974). An exchange theorem for bases of matroids. J. Combin. Theory Ser. B 16, 227-228.
  79. Woodall, D. R. (1975). The induction of matroids by graphs. J. London Math. Soc. (2) 10, 27-35.
  80. Woodall, D. R. (1976). The inequality b greate than or equal to v. In Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975), Congressus Numerantium, No. XV, pp. 661-664. Utilitas Math., Winnipeg, Man.
  81. Wu, H. (1994). Connectivity for matroids and graphs. Ph. D. Thesis, Louisiana State University.

    82. Y
  82. Young, H. P. (1973). Existence theorems for matroid designs. Trans. Amer. Math. Soc. 183, 1-35.
  83. Young, H. P. (1973). Affine triple systems and matroid designs. Math. Z. 132, 343-359.
  84. Young, H. P. (1973). Affine triple systems. In Finite geometric structures and their applications (C. I. M. E., II Ciclo, Bressanone, 1972), pp. 265-282. Edizioni Cremonese, Rome.

    85. Z
  85. Zaslavsky, T. (1987). The Mobius function and the characteristic polynomial. In Combinatorial geometries (ed. White, N.), pp. 114-138. Cambridge University Press, Cambridge.
  86. Zaslavsky, T. (1987). The biased graphs whose matroids are binary. J. Combin. Theory Ser. B 42, 337-347.
  87. Zaslavsky, T. (1989). Baised graphs. I. Bias, balance, and gains. J. Combin. Theory Ser. B 47, 32-52.
  88. Zaslavsky, T. (1991). Baised graphs. II. The three matroids. J. Combin. Theory Ser. B 51, 46-72.
  89. Zelinka, B. (1975). Geodetic graphs of diameter two. Czechoslovak Math. J. 25 (100), 148-153.
  90. Ziegler, G. M. (1989). Multiarrangements of hyperplanes and their freeness. In Singularities: Proceedings of the International Conference on Singularities, Iowa City 1986, Contemporary Mathematics, 90, pp. 345-358.
  91. Ziegler, G. M. (1990). Matroid representations and free arrangements. Trans. Amer. Math. Soc. 320, 525-541.
  92. Ziegler, G. M. (1991). Binary supersolvable matroids and modular constructions. Proc. Amer. Math. Soc. 113, 817-829.
  93. Ziegler, G. M. (1991). Some minimal non-orientable matroids of rank three. Geometriae Dedicata 38, 365-371.
  94. Ziegler, G. M. (1993). Some almost exceptional arrangements. Advances in Mathematics 101, 50-58.
    95. A - D E - H I - L M - P Q - T U V W X Y Z
    | Matroids | Books | Surveys | Bibliography | Software | People |