Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete 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 - Khee Meng Koh, Chung-Piaw Teo
:
The chromatic uniqueness of certain broken wheels. 65-69 - 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
- Derek A. Holton, Dingjun Lou, Michael D. Plummer:
On the 2-extendability of planar graphs. 81-99 - Earl S. Kramer, Qiu-Rong Wu, Spyros S. Magliveras, Tran van Trung:
Some perpendicular arrays for arbitrarily large t. 101-110 - Robert E. Peile:
Inclusion transformations: (n, m)-graphs and their classification. 111-129 - Lorenzo Traldi:
Generalized activities and K-terminal reliability. 131-149 - Cun-Quan Zhang, Yongjin Zhu:
Long path connectivity of regular graphs. 151-160
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 - Pierre Hansen, Julio Kuplinsky:
The smallest hard-to-color graph. 199-212 - Antoni Marczyk, Zdzislaw Skupien:
Maximum nonhamiltonian tough graphs. 213-220 - Harald Niederreiter:
A combinatorial problem for vector spaces over finite fields. 221-228 - Jerzy Topp, Lutz Volkmann:
On packing and covering numbers of graphs. 229-238
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-07-05 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
