• 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 36 matches

• 1974
• 
  H. L. Abbott:
  Some results in combinatorial geometry. Discret. Math. 9(3): 199-204 (1974)
• 
  Edward A. Bender:
  Partitions of multisets. Discret. Math. 9(4): 301-311 (1974)
• 
  Jean-Claude Bermond:
  Some Ramsey numbers for directed graphs. Discret. Math. 9(4): 313-321 (1974)
• 
  Kenneth P. Bogart:
  A note on matrices of zeros and ones. Discret. Math. 9(4): 323-327 (1974)
• 
  Ronald V. Book, Michael A. Harrison:
  Mutually divisible semigroups. Discret. Math. 9(4): 329-332 (1974)
• 
  William G. Bridges, Mohan S. Shrikhande:
  Special partially balanced incomplete block designs and associated graphs. Discret. Math. 9(1): 1-18 (1974)
• 
  N. G. de Bruijn:
  Sorting by means of swappings. Discret. Math. 9(4): 333-339 (1974)
• 
  Peter Buneman:
  A characterisation of rigid circuit graphs. Discret. Math. 9(3): 205-212 (1974)
• 
  R. H. F. Denniston:
  Some packings with Steiner triple systems. Discret. Math. 9(3): 213-227 (1974)
• 
  R. H. F. Denniston:
  Sylvester's problem of the 15 schoolgirls. Discret. Math. 9(3): 229-233 (1974)
• 
  G. A. Dirac:
  Terminable and interminable paths and trails in infinite graphs. Discret. Math. 9(1): 19-34 (1974)
• 
  C. Domb, A. J. Barrett:
  Enumeration of ladder graphs. Discret. Math. 9(4): 341-358 (1974)
• 
  B. G. Eke:
  Monotonic triads. Discret. Math. 9(4): 359-363 (1974)
• 
  H. O. Foulkes:
  Paths in ordered structures of partitions. Discret. Math. 9(4): 365-374 (1974)
• 
  Dennis P. Geller:
  Walkwise and admissible mappings between digraphs. Discret. Math. 9(4): 375-390 (1974)
• 
  Fred W. Glover:
  First facets of the octahedron. Discret. Math. 9(2): 109-117 (1974)
• 
  M. Gondran:
  Remarque sur le polytope des couplages d'edmonds. Discret. Math. 9(3): 235-238 (1974)
• 
  Jonathan L. Gross:
  Voltage graphs. Discret. Math. 9(3): 239-246 (1974)
• 
  Charlotte Huang:
  On the existence of balanced bipartite designs, II. Discret. Math. 9(2): 147-159 (1974)
• 
  Xavier L. Hubaut:
  Two new families of 4-designs. Discret. Math. 9(3): 247-249 (1974)
• 
  Robert W. Irving:
  Generalised Ramsey numbers for small graphs. Discret. Math. 9(3): 251-264 (1974)
• 
  François Jaeger:
  Sur l'indice chromatique du graphe representatif des aretes d'un graphe regulier. Discret. Math. 9(2): 161-172 (1974)
• 
  Ivan Tafteberg Jakobsen:
  On critical graphs with chromatic index 4. Discret. Math. 9(3): 265-276 (1974)
• 
  Sukhamay Kundu:
  Generalizations of the k-factor theorem. Discret. Math. 9(2): 173-179 (1974)
• 
  Antal Majthay, Andrew B. Whinston:
  Quasi-concave minimization subject to linear constraints. Discret. Math. 9(1): 35-59 (1974)
• 
  Colin L. Mallows, Neil J. A. Sloane:
  Weight enumerators of self-orthogonal codes. Discret. Math. 9(4): 391-400 (1974)
• 
  K. L. McAvaney, Douglas D. Grant, Derek A. Holton:
  Stable and semi-stable unicyclic graphs. Discret. Math. 9(3): 277-288 (1974)
• 
  P. J. Gustav Meyer:
  On the structure of orthomodular posets. Discret. Math. 9(2): 119-146 (1974)
• 
  Arnold L. Rosenberg:
  An extrinsic characterization of addressable data graphs. Discret. Math. 9(1): 61-70 (1974)
• 
  Arto Salomaa:
  Solution of a decision problem concerning unary Lindenmayer systems. Discret. Math. 9(1): 71-77 (1974)

skipping 6 more matches