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

• 1990
• 
  Noga Alon:
  Transversal numbers of uniform hypergraphs. Graphs Comb. 6(1): 1-4 (1990)
• 
  Pierre Baldi:
  On a generalized family of colorings. Graphs Comb. 6(2): 95-110 (1990)
• 
  Thomas Bier:
  Totient-numbers of the rectangular association scheme. Graphs Comb. 6(1): 5-15 (1990)
• 
  Philip L. Bowers:
  The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets. Graphs Comb. 6(3): 207-222 (1990)
• 
  Graham R. Brightwell:
  Events correlated with respect to every subposet of a fixed poset. Graphs Comb. 6(2): 111-131 (1990)
• 
  Roger B. Eggleton, Paul Erdös, D. K. Skilton:
  Colouring prime distance graphs. Graphs Comb. 6(1): 17-32 (1990)
• 
  I. A. Faradzev, Alexandre A. Ivanov, Mikhail H. Klin:
  Galois correspondence between permutation groups and cellular rings (association schemes). Graphs Comb. 6(4): 303-332 (1990)
• 
  Peter Frankl:
  Asymptotic solution of a turán-type problem. Graphs Comb. 6(3): 223-227 (1990)
• 
  Zoltán Füredi:
  Graphs of diameter 3 with the minimum number of edges. Graphs Comb. 6(4): 333-337 (1990)
• 
  Jerrold R. Griggs, Phil Hanlon, Andrew M. Odlyzko, Michael S. Waterman:
  On the number of alignments of k sequences. Graphs Comb. 6(2): 133-146 (1990)
• 
  Robert Grone, Russell Merris:
  Ordering trees by algebraic connectivity. Graphs Comb. 6(3): 229-237 (1990)
• 
  Yahya Ould Hamidoune:
  A note on the addition of residues. Graphs Comb. 6(2): 147-152 (1990)
• 
  Ryan Hayward, Chính T. Hoàng, Frédéric Maffray:
  Optimizing weakly triangulated graphs. Graphs Comb. 6(1): 33-35 (1990)
• 
  H. R. Hind:
  An upper bound for the total chromatic number. Graphs Comb. 6(2): 153-159 (1990)
• 
  Yasushi Iwakata:
  Minimal subschemes of the group association schemes of Mathieu groups. Graphs Comb. 6(3): 239-244 (1990)
• 
  Leif K. Jørgensen, László Pyber:
  Covering a graph by topological complete subgraphs. Graphs Comb. 6(2): 161-171 (1990)
• 
  Atsushi Kaneko:
  Paths and cycles concerning independent edges. Graphs Comb. 6(4): 339-363 (1990)
• 
  Mikio Kano:
  A sufficient condition for a graph to have [a, b]-factors. Graphs Comb. 6(3): 245-251 (1990)
• 
  P. Katerinis:
  Minimum degree of bipartite graphs and the existence ofk-factors. Graphs Comb. 6(3): 253-258 (1990)
• 
  Dongsu Kim:
  A bijective proof of Kadell's conjecture on plane partitions. Graphs Comb. 6(2): 173-178 (1990)
• 
  Khee Meng Koh, Kee L. Teo:
  The search for chromatically unique graphs. Graphs Comb. 6(3): 259-285 (1990)
• 
  Ilia Krasikov, Yehuda Roditty:
  Some applications of the nash-williams lemma to the edge-reconstruction conjecture. Graphs Comb. 6(1): 37-39 (1990)
• 
  Igor Kríz, Robin Thomas:
  On well-quasi-ordering finite structures with labels. Graphs Comb. 6(1): 41-49 (1990)
• 
  Bruce M. Landman, Raymond N. Greenwell:
  Some new bounds and values for van der Waerden-like numbers. Graphs Comb. 6(3): 287-291 (1990)
• 
  Hiroshi Maehara, Vojtech Rödl:
  On the dimension to represent a graph by a unit distance graph. Graphs Comb. 6(4): 365-367 (1990)
• 
  Yoshio Mimura:
  A construction of spherical 2-design. Graphs Comb. 6(4): 369-372 (1990)
• 
  Haruko Okamura:
  Every 4k-edge-connected graph is Weakly 3k-linked. Graphs Comb. 6(2): 179-185 (1990)
• 
  Vojtech Rödl:
  On ramsey families of sets. Graphs Comb. 6(2): 187-195 (1990)
• 
  Hiroshi Suzuki:
  2-designs overGF(2^m). Graphs Comb. 6(3): 293-296 (1990)
• 
  S. K. Teo, H. P. Yap:
  Packing two graphs of ordern having total size at most 2n - 2. Graphs Comb. 6(2): 197-205 (1990)

skipping 7 more matches