• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 30 matches

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