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

• 1974
• 
  David W. Barnette:
  On generating planar graphs. Discret. Math. 7(3-4): 199-208 (1974)
• 
  Harold Brown, Larry Hjelmeland, Larry Masinter:
  Constructive graph labeling using double cosets. Discret. Math. 7(1-2): 1-30 (1974)
• 
  V. Chungphaisan:
  Conditions for sequences to be r-graphic. Discret. Math. 7(1-2): 31-39 (1974)
• 
  C. H. Cunkle, Sergiu Rudeanu:
  Rings in boolean algebras. Discret. Math. 7(1-2): 41-51 (1974)
• 
  T. A. Dowling, Douglas G. Kelly:
  Elementary strong maps and transversal geometries. Discret. Math. 7(3-4): 209-224 (1974)
• 
  Roger B. Eggleton:
  Tiling the plane with triangles. Discret. Math. 7(1-2): 53-65 (1974)
• 
  G. B. Faulkner, D. H. Younger:
  Non-hamiltonian cubic planar maps. Discret. Math. 7(1-2): 67-74 (1974)
• 
  J. C. Fisher:
  An existence theorem for simple convex polyhedra. Discret. Math. 7(1-2): 75-97 (1974)
• 
  J.-C. Fournier, Michel Las Vergnas:
  Une classe d'hypergraphes bichromatiques II. Discret. Math. 7(1-2): 99-106 (1974)
• 
  Ralph Freese:
  An application of dilworth's lattice of maximal antichains. Discret. Math. 7(1-2): 107-109 (1974)
• 
  Floyd J. Gould, Jon W. Tolle:
  A unified approach to complementarity in optimization. Discret. Math. 7(3-4): 225-271 (1974)
• 
  Anthony J. W. Hilton, S. H. Scott:
  A further construction of double diagonal orthogonal latin squares. Discret. Math. 7(1-2): 111-127 (1974)
• 
  Robert G. Jeroslow:
  On algorithms for discrete problems. Discret. Math. 7(3-4): 273-280 (1974)
• 
  F. Lapscher:
  Proprietes De "Longueur De Chaine" Dans L'ensemble Des Fermetures Superieures Sur Un Ensemble Ordonne. Discret. Math. 7(1-2): 129-140 (1974)
• 
  André Lentin:
  Une Propriete Combinatoire Des Couples De Permutations. Discret. Math. 7(1-2): 141-149 (1974)
• 
  Charles C. Lindner:
  Construction of nonisomorphic reverse steiner quasigroups. Discret. Math. 7(3-4): 281-288 (1974)
• 
  Michael D. Plummer, Neil Robertson:
  Path traversability in planar graphs. Discret. Math. 7(3-4): 289-303 (1974)
• 
  George B. Purdy:
  Some external problems in geometry. Discret. Math. 7(3-4): 305-315 (1974)
• 
  Donald J. Rose:
  On simple characterizations of k-trees. Discret. Math. 7(3-4): 317-322 (1974)
• 
  Ivo G. Rosenberg:
  Minimization of pseudo-boolean functions by binary development. Discret. Math. 7(1-2): 151-165 (1974)
• 
  Grzegorz Rozenberg:
  Dol sequences. Discret. Math. 7(3-4): 323-347 (1974)
• 
  Miklós Simonovits:
  Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions. Discret. Math. 7(3-4): 349-376 (1974)
• 
  Bjarne Toft:
  On critical subgraphs of colour-critical graphs. Discret. Math. 7(3-4): 377-392 (1974)
• 
  Alan Tucker:
  Structure theorems for some circular-arc graphs. Discret. Math. 7(1-2): 167-195 (1974)
• 
  Laurence A. Wolsey:
  A number theoretic reformulation and decomposition method for integer programming. Discret. Math. 7(3-4): 393-403 (1974)