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

• 1980
• 
  Michael O. Albertson, Joan P. Hutchinson:
  Hadwiger's conjecture for graphs on the Klein bottle. Discret. Math. 29(1): 1-11 (1980)
• 
  Thomas Andreae:
  On a problem of R. Halin concerning infinite graphs II. Discret. Math. 29(3): 219-227 (1980)
• 
  Marilena Barnabei, Andrea Brini:
  A class of pbib-designs obtained from projective geometries. Discret. Math. 29(1): 13-17 (1980)
• 
  Jean-Pierre Barthélemy:
  An asymptotic equivalent for the number of total preorders on a finite set. Discret. Math. 29(3): 311-313 (1980)
• 
  Kenneth A. Berman:
  A note on coloured quadrangulations. Discret. Math. 29(2): 215-217 (1980)
• 
  Joel Berman:
  A proof of Lyndon's finite basis theorem. Discret. Math. 29(3): 229-233 (1980)
• 
  Jean Berstel:
  Mots sans carre et morphismes iteres. Discret. Math. 29(3): 235-244 (1980)
• 
  Anders Björner, Ivan Rival:
  A note on fixed points in semimodular lattices. Discret. Math. 29(3): 245-250 (1980)
• 
  G. Boccara:
  Nombre de representations d'une permutation comme produit de deux cycles de longueurs donnees. Discret. Math. 29(2): 105-134 (1980)
• 
  Yung-Ching Chu:
  Some results on Hu's conjecture concerning binary trees. Discret. Math. 29(3): 251-255 (1980)
• 
  Daniel I. A. Cohen, Talbot M. Katz:
  Recurrence of a random walk on the half-line as the generating function for the Catalan numbers. Discret. Math. 29(2): 213-214 (1980)
• 
  Gérard Cornuéjols, William R. Pulleyblank:
  A matching problem with side conditions. Discret. Math. 29(2): 135-159 (1980)
• 
  L. Csmiraz:
  On a combinatorial game with an application to Go-moku. Discret. Math. 29(1): 19-23 (1980)
• 
  Geoffrey Exoo, Frank Harary:
  The smallest graphs with certain adjacency properties. Discret. Math. 29(1): 25-32 (1980)
• 
  Edward J. Farrell:
  Chromatic roots - some observations and conjectures. Discret. Math. 29(2): 161-167 (1980)
• 
  Edward J. Farrell:
  On chromatic coefficients. Discret. Math. 29(3): 257-264 (1980)
• 
  Basil Gordon:
  Tilings of lattice points in Euclidean n-space. Discret. Math. 29(2): 169-174 (1980)
• 
  Dan Gordon:
  Minimal determining sets of locally finitely-determined functionals. Discret. Math. 29(2): 175-190 (1980)
• 
  T. C. Hine, Vassili C. Mavron:
  Embeddable transversal designs. Discret. Math. 29(2): 191-200 (1980)
• 
  Michael S. Jacobson:
  A note on Ramsey multiplicity. Discret. Math. 29(2): 201-203 (1980)
• 
  Medha Javdekar:
  Characterization of forcibly k-variegated degree sequences, k⩾3. Discret. Math. 29(1): 33-38 (1980)
• 
  D. E. Keenan:
  A Fisher type inequality. Discret. Math. 29(2): 205-208 (1980)
• 
  Clement W. H. Lam:
  Distance transitive digraphs. Discret. Math. 29(3): 265-274 (1980)
• 
  Maryvonne Mahéo:
  Strongly graceful graphs. Discret. Math. 29(1): 39-46 (1980)
• 
  George Markowsky:
  The level polynomials of the free distributive lattices. Discret. Math. 29(3): 275-285 (1980)
• 
  R. N. Mohan:
  A note on the construction of certain BIB designs. Discret. Math. 29(2): 209-211 (1980)
• 
  Charles Payan:
  A class of threshold and domishold graphs: equistable and equidominating graphs. Discret. Math. 29(1): 47-52 (1980)
• 
  Bill Sands:
  Generating sets for lattices of dimension two. Discret. Math. 29(3): 287-292 (1980)
• 
  Najiba Sbihi:
  Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile. Discret. Math. 29(1): 53-76 (1980)
• 
  Paul D. Seymour:
  Disjoint paths in graphs. Discret. Math. 29(3): 293-309 (1980)

skipping 3 more matches