Discrete Mathematics, Volume 96
Volume 96, Number 1, December 1991
Shreeram S. Abhyankar, Sudhir R. Ghorpade: Young tableaux and linear independence of standard monomials in multiminors of a multimatrix. 1-32- Douglas Bauer, Genghua Fan, Henk Jan Veldman: Hamiltonian properties of graphs with large neighborhood unions. 33-49
- Michael D. Hendy: A combinatorial description of the closest tree algorithm for finding evolutionary trees. 51-58
- Ferenc Juhász: The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs. 59-63
- Rajendra M. Pawale, Sharad S. Sane: A short proof of a conjecture on quasi-symmetric 3-designs. 71-74
- Jerzy Topp, Lutz Volkmann: On graphs with equal domination and independent domination numbers. 75-80
Volume 96, Number 2, December 1991
- Earl S. Kramer, Qiu-Rong Wu, Spyros S. Magliveras, Tran van Trung: Some perpendicular arrays for arbitrarily large t. 101-110
- R. E. Peile: Inclusion transformations: (n, m)-graphs and their classification. 111-129
- Lorenzo Traldi: Generalized activities and K-terminal reliability. 131-149
Volume 96, Number 3, December 1991
- Richard A. Brualdi, Bryan L. Shader: Matrices of 0's and 1's with restricted permanental minors. 161-174
- Sheshayya A. Choudum: On forcibly connected graphic sequences. 175-181
- Roberto Cignoli: Quantifiers on distributive lattices. 183-197
- Harald Niederreiter: A combinatorial problem for vector spaces over finite fields. 221-228
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team