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

• 1996
• 
  Richard P. Anstee, Jerrold R. Griggs:
  An application of matching theory of edge-colourings. Discret. Math. 156(1-3): 253-256 (1996)
• 
  R. Balakrishnan, R. Sampathkumar:
  Decompositions of regular graphs into K_n^c v 2K₂. Discret. Math. 156(1-3): 19-28 (1996)
• 
  M. Bauer, C. Itzykson:
  Triangulations. Discret. Math. 156(1-3): 29-81 (1996)
• 
  Béla Bollobás:
  Turán-Ramsey problems. Discret. Math. 156(1-3): 257-262 (1996)
• 
  Jianer Chen, Saroja P. Kanchi, Jonathan L. Gross:
  A tight lower bound on the maximum genus of a simplicial graph. Discret. Math. 156(1-3): 83-102 (1996)
• 
  J. H. E. Cohn:
  Complex D-optimal designs. Discret. Math. 156(1-3): 237-241 (1996)
• 
  Stephen J. Curran, Joseph A. Gallian:
  Hamiltonian cycles and paths in Cayley graphs and digraphs - A survey. Discret. Math. 156(1-3): 1-18 (1996)
• 
  Keith Edwards:
  On a problem concerning piles of counters. Discret. Math. 156(1-3): 263-264 (1996)
• 
  Hortensia Galeana-Sánchez:
  On monochromatic paths and monochromatic cycles in edge coloured tournaments. Discret. Math. 156(1-3): 103-112 (1996)
• 
  Henry Jacob:
  Kernels in graphs with a clique-cutset. Discret. Math. 156(1-3): 265-267 (1996)
• 
  Sandi Klavzar, Blaz Zmazek:
  On a Vizing-like conjecture for direct product graphs. Discret. Math. 156(1-3): 243-246 (1996)
• 
  Donald L. Kreher, Gordon F. Royle, W. D. Wallis:
  A family of resolvable regular graph designs. Discret. Math. 156(1-3): 269-275 (1996)
• 
  David W. Krumme:
  Reordered gossip schemes. Discret. Math. 156(1-3): 113-140 (1996)
• 
  Jin Ho Kwak, Se-Goo Kim, Jaeun Lee:
  Distributions of regular branched prime-fold coverings of surfaces. Discret. Math. 156(1-3): 141-170 (1996)
• 
  Vaktang Lashkia, Masahiro Miyakawa, Akihiro Nozaki, Grant Pogosyan, Ivo G. Rosenberg:
  Semirigid sets of diamond orders. Discret. Math. 156(1-3): 277-283 (1996)
• 
  Mingchu Li:
  Hamiltonian cycles in regular 3-connected claw-free graphs. Discret. Math. 156(1-3): 171-196 (1996)
• 
  Valery A. Liskovets:
  A reductive technique for enumerating non-isomorphic planar maps. Discret. Math. 156(1-3): 197-217 (1996)
• 
  Miwako Mishima, Masakazu Jimbo:
  A series of identities for the coefficients of inverse matrices on a Hamming scheme. Discret. Math. 156(1-3): 285-290 (1996)
• 
  Haiko Müller:
  Hamiltonian circuits in chordal bipartite graphs. Discret. Math. 156(1-3): 291-298 (1996)
• 
  Elefterie Olaru:
  The structure of imperfect critically strongly-imperfect graphs. Discret. Math. 156(1-3): 299-302 (1996)
• 
  James A. Sellers:
  Recurrences for 2-colored and 3-colored F-partitions. Discret. Math. 156(1-3): 303-310 (1996)
• 
  Manfred Stern:
  On the covering graph of balanced lattices. Discret. Math. 156(1-3): 311-316 (1996)
• 
  Ioan Tomescu:
  An asymptotic formula for the number of graphs having small diameter. Discret. Math. 156(1-3): 219-228 (1996)
• 
  Winston Yang:
  Bell numbers and k-trees. Discret. Math. 156(1-3): 247-252 (1996)
• 
  Xuebin Zhang:
  Construction for indecomposable simple (v, k, lambda)-BIBDs. Discret. Math. 156(1-3): 317-322 (1996)
• 
  Xuding Zhu:
  On the bounds for the ultimate independence ratio of a graph. Discret. Math. 156(1-3): 229-236 (1996)