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

• 1981
• 
  M. E. Adams, Jaroslav Nesetril, Jirí Sichler:
  Quotients of rigid graphs. J. Comb. Theory B 30(3): 351-359 (1981)
• 
  Dana Angluin, A. Gardiner:
  Finite common coverings of pairs of regular graphs. J. Comb. Theory B 30(2): 184-187 (1981)
• 
  Richard P. Anstee:
  An analogue of group divisible designs for Moore graphs. J. Comb. Theory B 30(1): 11-20 (1981)
• 
  Frank E. Bennett, Dominique Sotteau:
  Almost resolvable decomposition of K_n^*. J. Comb. Theory B 30(2): 228-232 (1981)
• 
  Kenneth A. Berman:
  Three-colourings of planar 4-valent maps. J. Comb. Theory B 30(1): 82-88 (1981)
• 
  Kenneth A. Berman:
  Matchings and spanning trees in Boolean weighted graphs. J. Comb. Theory B 30(3): 343-350 (1981)
• 
  Béla Bollobás, Paul A. Catlin:
  Topological cliques of random graphs. J. Comb. Theory B 30(2): 224-227 (1981)
• 
  Béla Bollobás, Donald L. Goldsmith, Douglas R. Woodall:
  Indestructive deletions of edges from graphs. J. Comb. Theory B 30(3): 263-275 (1981)
• 
  William G. Bridges, R. A. Mena:
  X^k-Digraphs. J. Comb. Theory B 30(2): 136-143 (1981)
• 
  François Bry:
  Note on a theorem of J. Folkman on transversals of infinite families with finitely many infinite members. J. Comb. Theory B 30(1): 100-102 (1981)
• 
  Tom Brylawski:
  Intersection theory for graphs. J. Comb. Theory B 30(2): 233-246 (1981)
• 
  D. T. Busolini:
  2-Colored triangles in edge-colored complete graphs, II. J. Comb. Theory B 30(3): 360-363 (1981)
• 
  William H. Cunningham:
  On matroid connectivity. J. Comb. Theory B 30(1): 94-99 (1981)
• 
  W. A. Denig:
  A class of matroids derived from saturated chain partitions of partially ordered sets. J. Comb. Theory B 30(3): 302-317 (1981)
• 
  Hikoe Enomoto:
  Combinatorially homogeneous graphs. J. Comb. Theory B 30(2): 215-223 (1981)
• 
  R. J. Evans, J. R. Pulham, J. Sheehan:
  On the number of complete subgraphs contained in certain graphs. J. Comb. Theory B 30(3): 364-371 (1981)
• 
  Martin Feinberg:
  On a generalization of linear independence in finite-dimensional vector spaces. J. Comb. Theory B 30(1): 61-69 (1981)
• 
  Stanley Fiorini, Josef Lauri:
  The reconstruction of maximal planar graphs. I. Recognition. J. Comb. Theory B 30(2): 188-195 (1981)
• 
  N. Gaffke:
  Connected graphs with a minimal number of spanning trees. J. Comb. Theory B 30(2): 166-183 (1981)
• 
  Chris D. Godsil, Brendan D. McKay:
  Spectral conditions for the reconstructibility of a graph. J. Comb. Theory B 30(3): 285-289 (1981)
• 
  Charles M. Grinstead:
  The strong perfect graph conjecture for toroifal graphs. J. Comb. Theory B 30(1): 70-74 (1981)
• 
  Roland Häggkvist, G. G. Nicoghossian:
  A remark on Hamiltonian cycles. J. Comb. Theory B 30(1): 118-120 (1981)
• 
  Gena Hahn:
  The automorphism group of a product of hypergraphs. J. Comb. Theory B 30(3): 276-281 (1981)
• 
  Yahya Ould Hamidoune:
  Quelques problèmes de connexité dans les graphes orientés. J. Comb. Theory B 30(1): 1-10 (1981)
• 
  Yahya Ould Hamidoune:
  On multiply critically h-connected graphs. J. Comb. Theory B 30(1): 108-112 (1981)
• 
  Peter Hammond:
  q-Coverings, codes, and line graphs. J. Comb. Theory B 30(1): 32-35 (1981)
• 
  Jochen Harant, Hansjoachim Walther:
  On the radius of graphs. J. Comb. Theory B 30(1): 113-117 (1981)
• 
  Bill Jackson:
  Cycles in bipartite graphs. J. Comb. Theory B 30(3): 332-342 (1981)
• 
  R. H. Jeurissen:
  The incidence matrix and labelings of a graph. J. Comb. Theory B 30(3): 290-301 (1981)
• 
  John B. Kelly:
  Difference systems, graph designs, and coloring problems. J. Comb. Theory B 30(2): 144-165 (1981)

skipping 14 more matches