default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 90
Volume 90, Number 1, June 1991
- Robert W. Deckhart:
The local Kostant-PBW ordering. 1-20 - Arne Dür:
The decoding of extended Reed-Solomon codes. 21-40 - Evelyne Flandrin, Heinz Adolf Jung, Hao Li:
Hamiltonism, degree sum and neighborhood intersections. 41-52 - Heinrich Niederhausen:
Factorials and stirling numbers in the algebra of formal Laurent series. 53-62 - Shinsei Tazawa, Teruhiro Shirakura, Saburo Tamura:
Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree. 63-74 - Shou-Tien Ting, Shu-Yü Zhoa:
The general Steiner problem in Boolean space and application. 75-84 - Daniel Bienstock:
On the complexity of testing for odd holes and induced odd paths. 85-92 - Michael B. Dillencourt:
An upper bound on the shortness exponent of 1-tough, maximal planar graphs. 93-97 - Pierre Duchet, Stephan Olariu:
Graphes parfaitement ordonnables généralises. 99-101 - Peter Frankl, Zoltán Füredi:
A sharpening of Fisher's inequality. 103-107
Volume 90, Number 2, July 1991
- Shreeram S. Abhyankar, Sanjeevani B. Joshi:
Generalized roinsertive correspondence between multitableaux and multimonomials. 111-135 - Michel Dehon:
An existence theorem for some simple t-designs. 137-142 - Armen S. Asratian, N. K. Khachatrian:
Stable properties of graphs. 143-152 - A. G. Robinson, Alan J. Goldman:
On Ringeisen's isolation game II. 153-167 - Richard Stong:
Hamilton decompositions of cartesian products of graphs. 169-190 - Fangjun Hsu, Leetsch C. Hsu:
A unified treatment of a class of combinatorial sums. 191-197 - Qingde Kang:
The construction of large sets of disjoint Mendelsohn triple systems of order 2n + 2. 199-205 - Owen Murphy:
Lower bounds on the stability number of graphs computed in terms of degrees. 207-211 - Hazel Perfect:
Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4-chains. 213-214 - Alexander Pott, Mohan S. Shrikhande:
t-Designs with few intersection numbers. 215-217
Volume 90, Number 3, July 1991
- Ahmed M. Assaf:
The packing of pairs by quadruples. 221-231 - Virgil Emil Cazanescu, Gheorghe Stefanescu:
Classes of finite relations as initial abstract data types I. 233-265 - Bernard Courteau, André Montpetit:
A class of codes admitting at most three nonzero dual distances. 267-280 - Talmage James Reid:
Triangles in 3-connected matroids. 281-296 - Huishan Zhou:
The chromatic difference sequence of the Cartesian product of graphs. 297-311 - Ernest J. Cockayne, Odile Favaron, Hao Li, Gary MacGillivray:
The product of the independent domination numbers of a graph and its complement. 313-317 - Shalosh B. Ekhad:
A short proof of a 'strange' combinatorial identity conjectured by Gosper. 319-320 - Douglas D. Grant:
A generalisation of the diameter of a graph. 321-324 - Affine and projective planes : To: E.F. Assmus Jr and J.D. Key, Discrete Mathematics 83 (1990) 161-187. 325
- Generalized partially balanced incomplete block designs : To: Kishore Sinha, Discrete Mathematics 67 (1987) 315-318. 327
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-11-22 19:45 CET 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:
