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

• 1978
• 
  Robert B. Allan, Renu C. Laskar:
  On domination and independent domination numbers of a graph. Discret. Math. 23(2): 73-76 (1978)
• 
  Thomas Andreaf:
  On a problem of R. Halin concerning infinite graphs. Discret. Math. 23(1): 1-15 (1978)
• 
  Claude Benzaken:
  Post's closed systems and the weak chromatic number of hypergraphs. Discret. Math. 23(2): 77-84 (1978)
• 
  Claude Berge:
  Regularisable graphs I. Discret. Math. 23(2): 85-89 (1978)
• 
  Claude Berge:
  Regularisable graphs, II. Discret. Math. 23(2): 91-95 (1978)
• 
  Vasanti N. Bhat-Nayak, Sheshayya A. Choudum, Ranjan N. Naik:
  Characterizations of 2-variegated graphs and of 3-variegated graphs. Discret. Math. 23(1): 17-22 (1978)
• 
  Ian F. Blake, Avraham A. Melkman:
  On an inverse for sections of a binomial matrix. Discret. Math. 23(2): 97-104 (1978)
• 
  G. Boccara:
  Decompositions d'une permutation d'un ensemble fini en produit de deux cycles. Discret. Math. 23(3): 189-205 (1978)
• 
  Carl Bumiller:
  On rank three graphs with a large eigenvalue. Discret. Math. 23(2): 183-187 (1978)
• 
  Douglas Cenzer, Edward Howorka:
  On vertex k-partitions of certain infinite graphs. Discret. Math. 23(2): 105-113 (1978)
• 
  F. R. K. Chung:
  On partitions of graphs into trees. Discret. Math. 23(1): 23-30 (1978)
• 
  Jirí Demel:
  Maximal frequencies of equivalences with small classes. Discret. Math. 23(1): 67-71 (1978)
• 
  Charles Vanden Eynden:
  Countable sequenceable groups. Discret. Math. 23(3): 317-318 (1978)
• 
  Harold Fredricksen, James Maiorana:
  Necklaces of beads in k colors and k-ary de Bruijn sequences. Discret. Math. 23(3): 207-210 (1978)
• 
  Fanica Gavril:
  A recognition algorithm for the intersection graphs of paths in trees. Discret. Math. 23(3): 211-227 (1978)
• 
  Donald L. Goldsmith, Arthur T. White:
  On graphs with equal edge-connectivity and minimum degree. Discret. Math. 23(1): 31-36 (1978)
• 
  Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao:
  Addition chains with multiplicative cost. Discret. Math. 23(2): 115-119 (1978)
• 
  Ram Prakash Gupta:
  An edge-coloration theorem for bipartite graphs with applications. Discret. Math. 23(3): 229-233 (1978)
• 
  Ervin Györi, Eric C. Milner:
  A theorem of the transversal theory for matroids of finite character. Discret. Math. 23(3): 235-240 (1978)
• 
  Tor Helleseth:
  A note on the cross-correlation function between two binary maximal length linear sequences. Discret. Math. 23(3): 301-307 (1978)
• 
  Peter Hoffman:
  Products of representations of wreath products. Discret. Math. 23(1): 37-48 (1978)
• 
  Robert G. Jeroslow:
  Cutting-plane theory: Algebraic methods. Discret. Math. 23(2): 121-150 (1978)
• 
  Dieter Jungnickel:
  Composition theorems for difference families and regular planes. Discret. Math. 23(2): 151-158 (1978)
• 
  Richard M. Karp:
  A characterization of the minimum cycle mean in a digraph. Discret. Math. 23(3): 309-311 (1978)
• 
  Torleiv Kløve:
  The weight distribution of linear codes over GF(q^l) having generator matrix over GF(q>). Discret. Math. 23(2): 159-168 (1978)
• 
  Nathan Linial:
  Covering digraphs by paths. Discret. Math. 23(3): 257-272 (1978)
• 
  Beatrice Loerinc:
  Chromatic uniqueness of the generalized θ-graph. Discret. Math. 23(3): 313-316 (1978)
• 
  Jaroslav Nesetril, Vojtech Rödl:
  A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph. Discret. Math. 23(1): 49-55 (1978)
• 
  C. Payan:
  Coverings by minimal transversals. Discret. Math. 23(3): 273-277 (1978)
• 
  G. Schrage:
  Some inequalities for multidimensional (0, 1)- matrices. Discret. Math. 23(2): 169-175 (1978)

skipping 4 more matches