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

• 1984
• 
  Ron Aharoni:
  Matchings in graphs of size N₁. J. Comb. Theory B 36(1): 113-117 (1984)
• 
  Michael O. Albertson, Karen L. Collins:
  Duality and perfection for edges in cliques. J. Comb. Theory B 36(3): 298-309 (1984)
• 
  Edward A. Bender, L. Bruce Richmond:
  The asymptotic enumeration of rooted convex polyhedra. J. Comb. Theory B 36(3): 276-283 (1984)
• 
  Jean-Claude Bermond, Charles Delorme, G. Farhi:
  Large graphs with given degree and diameter. II. J. Comb. Theory B 36(1): 32-48 (1984)
• 
  William H. Cunningham:
  Testing membership in matroid polyhedra. J. Comb. Theory B 36(2): 161-188 (1984)
• 
  Paul H. Edelman:
  The acyclic sets of an oriented matroid. J. Comb. Theory B 36(1): 26-31 (1984)
• 
  András Frank:
  Finding feasible vectors of Edmonds-Giles polyhedra. J. Comb. Theory B 36(3): 221-239 (1984)
• 
  Peter M. Gibson:
  A bound for the number of tournaments with specified scores. J. Comb. Theory B 36(3): 240-243 (1984)
• 
  Anthony J. W. Hilton:
  Hamiltonian decompositions of complete graphs. J. Comb. Theory B 36(2): 125-134 (1984)
• 
  Tomio Hirata, Kiyohito Kubota, Osami Saito:
  A sufficient condition for a graph to be weakly k-linked. J. Comb. Theory B 36(1): 85-94 (1984)
• 
  Peter Hoffman, R. Bruce Richter:
  Embedding graphs in surfaces. J. Comb. Theory B 36(1): 65-84 (1984)
• 
  Wilfried Imrich, J. M. S. Simões-Pereira, Christina Zamfirescu:
  On optimal embeddings of metrics in graphs. J. Comb. Theory B 36(1): 1-15 (1984)
• 
  Henry A. Kierstead:
  On the chromatic index of multigraphs without large triangles. J. Comb. Theory B 36(2): 156-160 (1984)
• 
  Václav Koubek, Vojtech Rödl:
  On the minimum order of graphs with given semigroup. J. Comb. Theory B 36(2): 135-155 (1984)
• 
  Nathan Linial:
  Graph decompositions without isolates. J. Comb. Theory B 36(1): 16-25 (1984)
• 
  Yanpei Liu:
  On the number of rooted c-nets. J. Comb. Theory B 36(1): 118-123 (1984)
• 
  Han-Kun Ma:
  A counterexample to the conjecture of Aksionov and Mel'nikov on non-3-colorable planar graphs. J. Comb. Theory B 36(2): 218-219 (1984)
• 
  Luis Montejano, Victor Neumann-Lara:
  A variation of Menger's theorem for long paths. J. Comb. Theory B 36(2): 213-217 (1984)
• 
  Seiya Negami:
  Uniquely and faithfully embeddable projective-planar triangulations. J. Comb. Theory B 36(2): 189-193 (1984)
• 
  Ján Plesník:
  A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs. J. Comb. Theory B 36(3): 284-297 (1984)
• 
  Neil Robertson, Paul D. Seymour:
  Graph minors. III. Planar tree-width. J. Comb. Theory B 36(1): 49-64 (1984)
• 
  Tiong-Seng Tay:
  Rigidity of multi-graphs. I. Linking rigid bodies in n-space. J. Comb. Theory B 36(1): 95-112 (1984)
• 
  Thomas W. Tucker:
  A refined Hurwitz theorem for imbeddings of irredundant Cayley graphs. J. Comb. Theory B 36(3): 244-268 (1984)
• 
  Thomas W. Tucker:
  There is one group of genus two. J. Comb. Theory B 36(3): 269-275 (1984)
• 
  Albert L. Wells Jr.:
  Even signings, signed switching classes, and (-1, 1)-matrices. J. Comb. Theory B 36(2): 194-212 (1984)