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

• 1984
• 
  Rudolf Ahlswede, Abbas El Gamal, King F. Pang:
  A two-family extremal problem in hamming space. Discret. Math. 49(1): 1-5 (1984)
• 
  Robert B. Allan, Renu C. Laskar, Stephen T. Hedetniemi:
  A note on total domination. Discret. Math. 49(1): 7-13 (1984)
• 
  Noga Alon:
  A note on subdigraphs of digraphs with large outdegrees. Discret. Math. 49(3): 321-322 (1984)
• 
  Brian Alspach:
  Research problems. Discret. Math. 49(2): 219 (1984)
• 
  George E. Andrews, David M. Bressoud:
  Identities in combinatorics III: Further aspects of ordered set sorting. Discret. Math. 49(3): 223-236 (1984)
• 
  R. Aravamudhan, B. Rajendran:
  On antipodal graphs. Discret. Math. 49(2): 193-195 (1984)
• 
  Curtis A. Barefoot:
  Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size. Discret. Math. 49(2): 109-112 (1984)
• 
  Lynn Margaret Batten:
  Rank functions of closure spaces of finite rank. Discret. Math. 49(2): 113-116 (1984)
• 
  Lucian Beznea:
  A topological characterization of complete distributive lattices. Discret. Math. 49(2): 117-120 (1984)
• 
  Béla Bollobás, Ernest J. Cockayne:
  The irredundance number and maximum degree of a graph. Discret. Math. 49(2): 197-199 (1984)
• 
  Ronald V. Book, Craig C. Squier:
  Almost all one-rule thue systems have decidable word problems. Discret. Math. 49(3): 237-240 (1984)
• 
  Andrei Z. Broder:
  The r-Stirling numbers. Discret. Math. 49(3): 241-259 (1984)
• 
  Andries E. Brouwer:
  Distance regular graphs of diameter 3 and strongly regular graphs. Discret. Math. 49(1): 101-103 (1984)
• 
  Mao-cheng Cai:
  On separating systems of graphs. Discret. Math. 49(1): 15-20 (1984)
• 
  C. C. Chen, Khee Meng Koh, S. C. Lee:
  On the grading numbers of direct products of chains. Discret. Math. 49(1): 21-26 (1984)
• 
  J. Csima:
  Colouring finite planes of odd order. Discret. Math. 49(3): 309 (1984)
• 
  Charles Delorme, Gena Hahn:
  Infinite generalized friendship graphs. Discret. Math. 49(3): 261-266 (1984)
• 
  Marsha F. Foregger:
  The skew chromatic index of a graph. Discret. Math. 49(1): 27-39 (1984)
• 
  Françoise Reynaud Garoche, Michel Léonard:
  On a class of boolean functions with matroid property. Discret. Math. 49(3): 323-325 (1984)
• 
  Ira M. Gessel:
  Some generalized Durfee square identities. Discret. Math. 49(1): 41-44 (1984)
• 
  Pavol Hell, David G. Kirkpatrick:
  Packings by cliques and by finite families of graphs. Discret. Math. 49(1): 45-59 (1984)
• 
  George R. T. Hendry:
  Graphs uniquely hamiltonian-connected from a vertex. Discret. Math. 49(1): 61-74 (1984)
• 
  Afrodita Iorgulescu:
  Functors between categories of three-valued Lukasiewicz-Moisil algebras I. Discret. Math. 49(2): 121-131 (1984)
• 
  A. Donald Keedwell:
  More super p-groups. Discret. Math. 49(2): 205-207 (1984)
• 
  Joseph P. S. Kung:
  Jacobi's identity and the König-Egerváry theorem. Discret. Math. 49(1): 75-77 (1984)
• 
  Gunter Lassmann:
  On 4-isomorphisms of graphs. Discret. Math. 49(1): 79-81 (1984)
• 
  Hiroshi Maehara:
  On the sphericity for the join of many graphs. Discret. Math. 49(3): 311-313 (1984)
• 
  Francesco Mazzocca:
  On a class of lattices associated with n-cubes. Discret. Math. 49(2): 133-138 (1984)
• 
  Armel Mercier:
  Quelques identités de l'analyse combinatoire. Discret. Math. 49(2): 139-149 (1984)
• 
  Michel Mollard:
  Une nouvelle famille de 3-codes parfaits sur GF(q). Discret. Math. 49(2): 209-212 (1984)

skipping 19 more matches