• 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

• 1997
• 
  Francesc Aguiló, Miguel Angel Fiol, C. Garcia:
  Triple loop networks with small transmission delay. Discret. Math. 167-168: 3-16 (1997)
• 
  Lars Døvling Andersen, Anthony J. W. Hilton:
  Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares. Discret. Math. 167-168: 17-34 (1997)
• 
  Kiyoshi Ando, Yoshimi Egawa:
  The minimum number of edges in a vertex diameter-2-critical graph. Discret. Math. 167-168: 35-63 (1997)
• 
  Rosemary A. Bailey:
  A Howell design admitting A₅¹. Discret. Math. 167-168: 65-71 (1997)
• 
  Rosemary A. Bailey, Polycarp E. Chigbu:
  Enumeration of semi-Latin squares. Discret. Math. 167-168: 73-84 (1997)
• 
  Camino Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
  Extraconnectivity of graphs with large minimum degree and girth. Discret. Math. 167-168: 85-100 (1997)
• 
  Jørgen Bang-Jensen, Yubao Guo, Gregory Z. Gutin, Lutz Volkmann:
  A classification of locally semicomplete digraphs. Discret. Math. 167-168: 101-114 (1997)
• 
  Bruce L. Bauslaugh:
  Compactness and finite equivalence of infinite digraphs. Discret. Math. 167-168: 115-126 (1997)
• 
  Lowell W. Beineke, Michael A. Henning:
  Opinion functions on trees. Discret. Math. 167-168: 127-139 (1997)
• 
  Andrew Bowler:
  Orthomorphisms of dihedral groups. Discret. Math. 167-168: 141-144 (1997)
• 
  Richard C. Brewster, Pavol Hell, Gary MacGillivray:
  The complexity of restricted graph homomorphisms. Discret. Math. 167-168: 145-154 (1997)
• 
  Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer:
  Dirac's minimum degree condition restricted to claws. Discret. Math. 167-168: 155-166 (1997)
• 
  Darryn E. Bryant, Sheila Oates-Williams:
  Strongly 2-perfect cycle systems and their quasigroups. Discret. Math. 167-168: 167-174 (1997)
• 
  Peter J. Cameron:
  On the probability of connectedness. Discret. Math. 167-168: 175-187 (1997)
• 
  Anton Cerný, Peter Horák, Walter D. Wallis:
  Kirkman's school projects. Discret. Math. 167-168: 189-196 (1997)
• 
  William W. Chernoff:
  Interwoven polygonal frames. Discret. Math. 167-168: 197-204 (1997)
• 
  Ernest J. Cockayne, Christina M. Mynhardt:
  Domination and irredundance in cubic graphs. Discret. Math. 167-168: 205-214 (1997)
• 
  Peter I. Cowling:
  The total graph of a hypergraph. Discret. Math. 167-168: 215-236 (1997)
• 
  Gayla S. Domke, Jean E. Dunbar, Lisa R. Markus:
  Gallai-type theorems and domination parameters. Discret. Math. 167-168: 237-248 (1997)
• 
  Gayla S. Domke, Renu C. Laskar:
  The bondage and reinforcement numbers of gamma_f for some graphs. Discret. Math. 167-168: 249-259 (1997)
• 
  Jean E. Dunbar, Jerrold W. Grossman, Johannes H. Hattingh, Stephen T. Hedetniemi, Alice A. McRae:
  On weakly connected domination in graphs. Discret. Math. 167-168: 261-269 (1997)
• 
  Jonathan David Farley:
  Perfect sequences of chain-complete posets. Discret. Math. 167-168: 271-296 (1997)
• 
  Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
  The alternating polynomials and their relation with the spectra and conditional diameters of graphs. Discret. Math. 167-168: 297-307 (1997)
• 
  Willem L. Fouché:
  Symmetry and the Ramsey degree of posets. Discret. Math. 167-168: 309-315 (1997)
• 
  Dalibor Froncek:
  Almost self-complementary factors of complete bipartite graphs. Discret. Math. 167-168: 317-327 (1997)
• 
  Wayne Goddard, Michael D. Plummer, Henda C. Swart:
  Maximum and minimum toughness of graphs of small genus. Discret. Math. 167-168: 329-339 (1997)
• 
  Mike J. Grannell, Terry S. Griggs, J. P. Murphy:
  Twin Steiner triple systems. Discret. Math. 167-168: 341-352 (1997)
• 
  Yubao Guo:
  Path-connectivity in local tournaments. Discret. Math. 167-168: 353-372 (1997)
• 
  Stuart G. Hoggar:
  Weight enumerators of codes derived from polynomial product algorithms. Discret. Math. 167-168: 373-391 (1997)
• 
  Wilfried Imrich, Tomaz Pisanski, Janez Zerovnik:
  Recognizing Cartesian graph bundles. Discret. Math. 167-168: 393-403 (1997)

skipping 19 more matches