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

• 1990
• 
  Ron Aharoni, E. C. Milner, Karel Prikry:
  Unfriendly partitions of a graph. J. Comb. Theory B 50(1): 1-10 (1990)
• 
  Ron Aharoni, Ran Ziv:
  LP duality in infinite hypergraphs. J. Comb. Theory B 50(1): 82-92 (1990)
• 
  Ron Aharoni, Mao Lin Zheng:
  Counting 1-factors in infinite graphs. J. Comb. Theory B 50(2): 168-178 (1990)
• 
  Marion Alfter, Walter Kern, Alfred Wanka:
  On adjoints and dual matroids. J. Comb. Theory B 50(2): 208-213 (1990)
• 
  Denise Amar, Yannis Manoussakis:
  Cycles and paths of many lengths in bipartite digraphs. J. Comb. Theory B 50(2): 254-264 (1990)
• 
  Marc E. Bertschi:
  Perfectly contractile graphs. J. Comb. Theory B 50(2): 222-230 (1990)
• 
  W. Bienia, I. P. da Silva:
  On the inversion of the sign of one basis in an oriented matroid. J. Comb. Theory B 50(2): 299-308 (1990)
• 
  Béla Bollobás, Roland Häggkvist:
  Powers of Hamilton cycles in tournaments. J. Comb. Theory B 50(2): 309-318 (1990)
• 
  Reinhard Diestel:
  Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions. J. Comb. Theory B 50(1): 93-116 (1990)
• 
  Reinhard Diestel:
  Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions. J. Comb. Theory B 50(1): 117-128 (1990)
• 
  Herbert Fleischner, András Frank:
  On circuit decomposition of planar Eulerian graphs. J. Comb. Theory B 50(2): 245-253 (1990)
• 
  Luis A. Goddyn:
  Quantizers and the worst-case Euclidean traveling salesman problem. J. Comb. Theory B 50(1): 65-81 (1990)
• 
  Yahya Ould Hamidoune:
  On the numbers of independent k-sets in a claw free graph. J. Comb. Theory B 50(2): 241-244 (1990)
• 
  Alain Hertz:
  A fast algorithm for coloring Meyniel graphs. J. Comb. Theory B 50(2): 231-240 (1990)
• 
  Peter Horák:
  A coloring problem related to the Erdös-Faber-Lovász conjecture. J. Comb. Theory B 50(2): 321-322 (1990)
• 
  Li Jiongsheng, Huang Daode, Pan Qun:
  Digraphs with degree equivalent induced subdigraphs. J. Comb. Theory B 50(2): 288-298 (1990)
• 
  Gil Kalai:
  Symmetric matroids. J. Comb. Theory B 50(1): 54-64 (1990)
• 
  Joseph P. S. Kung:
  The long-line graph of a combinatorial geometry. II. Geometries representable over two fields of different characteristics. J. Comb. Theory B 50(1): 41-53 (1990)
• 
  Feng-Chu Lai, Gerard J. Chang:
  An upper bound for the transversal numbers of 4-uniform hypergraphs. J. Comb. Theory B 50(1): 129-133 (1990)
• 
  Jon Lee:
  The incidence structure of subspaces with well-scaled frames. J. Comb. Theory B 50(2): 265-287 (1990)
• 
  Kazumasa Nomura:
  Distance-regular graphs of hamming type. J. Comb. Theory B 50(2): 160-167 (1990)
• 
  Kazumasa Nomura:
  Intersection diagrams of distance-biregular graphs. J. Comb. Theory B 50(2): 214-221 (1990)
• 
  Myriam Preissmann:
  Locally perfect graphs. J. Comb. Theory B 50(1): 22-40 (1990)
• 
  Shaoji Xu:
  The size of uniquely colorable graphs. J. Comb. Theory B 50(2): 319-320 (1990)
• 
  David B. Surowski:
  Lifting map automorphisms and MacBeath's theorem. J. Comb. Theory B 50(2): 135-149 (1990)
• 
  Éva Tardos:
  An intersection theorem for supermatroids. J. Comb. Theory B 50(2): 150-159 (1990)
• 
  Carsten Thomassen:
  Bidirectional retracting-free double tracings and upper embeddability of graphs. J. Comb. Theory B 50(2): 198-207 (1990)
• 
  Yves Colin de Verdière:
  Sur un nouvel invariant des graphes et un critère de planarité. J. Comb. Theory B 50(1): 11-21 (1990)
• 
  Elke Wilkeit:
  Isometric embeddings in Hamming graphs. J. Comb. Theory B 50(2): 179-197 (1990)