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

• 1982
• 
  Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary:
  The smallest 2-connected cubic bipartite planar nonhamiltonian graph. Discret. Math. 38(1): 1-6 (1982)
• 
  Jacques Aubert, Bernadette Schneider:
  Decomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens. Discret. Math. 38(1): 7-16 (1982)
• 
  Vladimir Batagelj, Tomaz Pisanski:
  Hamiltonian cycles in the cartesian product of a tree and a cycle. Discret. Math. 38(2-3): 311-312 (1982)
• 
  G. Boccara:
  Cycles comme produit de deux permutations de classes donnees. Discret. Math. 38(2-3): 129-142 (1982)
• 
  David M. Bressoud, Doron Zeilberger:
  A short Rogers-Ramanujan bijection. Discret. Math. 38(2-3): 313-315 (1982)
• 
  Fred Buckley:
  The central ratio of a graph. Discret. Math. 38(1): 17-21 (1982)
• 
  Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
  Ramsey-minimal graphs for forests. Discret. Math. 38(1): 23-32 (1982)
• 
  Olivier Cogis:
  Ferrers digraphs and threshold graphs. Discret. Math. 38(1): 33-46 (1982)
• 
  Olivier Cogis:
  On the Ferrers dimension of a digraph. Discret. Math. 38(1): 47-52 (1982)
• 
  John H. Conway, Vera Pless:
  On primes dividing the group order of a doubly-even (72, 36, 16) code and the group order of a quaternary (24, 12, 10) code. Discret. Math. 38(2-3): 157-162 (1982)
• 
  Nelly Darcel, Yvette Zimmermann:
  Partition en cycles du graphe de comparabilite d'un arbre. Discret. Math. 38(1): 53-64 (1982)
• 
  Edward J. Farrell:
  Cycle decompositions of complete graphs. Discret. Math. 38(2-3): 143-156 (1982)
• 
  Jean-Luc Fouquet:
  Note sur la non existence d'un snark d'ordre 16. Discret. Math. 38(2-3): 163-171 (1982)
• 
  T. Gangopadhyay:
  Characterisation of potentially bipartite self-complementary bipartitioned sequences. Discret. Math. 38(2-3): 173-184 (1982)
• 
  Mike J. Grannell, Terry S. Griggs:
  A cyclic Steiner quadruple system of order 32. Discret. Math. 38(1): 109-111 (1982)
• 
  Marie-Claude Heydemann:
  Cycles in strong oriented graphs. Discret. Math. 38(2-3): 185-190 (1982)
• 
  Wen-Lian Hsu, George L. Nemhauser:
  A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs. Discret. Math. 38(1): 65-71 (1982)
• 
  Michael S. Jacobson:
  On a generalization of Ramsey theory. Discret. Math. 38(2-3): 191-195 (1982)
• 
  Alexander K. Kelmans, M. V. Lomonosov:
  When m vertices in a k-connected graph cannot be walked round along a simple cycle. Discret. Math. 38(2-3): 317-322 (1982)
• 
  V. Krishnamoorthy, K. R. Parthasarathy:
  On the reconstruction of separable graphs from elementary contractions. Discret. Math. 38(2-3): 197-205 (1982)
• 
  Aldo de Luca:
  On some combinatorial problems in free monoids. Discret. Math. 38(2-3): 207-225 (1982)
• 
  T. P. McDonough:
  A 2-design admitting Co₃. Discret. Math. 38(1): 113-115 (1982)
• 
  P. A. Picon:
  Un résultat d'intégrité. Discret. Math. 38(2-3): 227-241 (1982)
• 
  Norbert Polat:
  Sous-graphes traçables des graphes infinis. Discret. Math. 38(2-3): 243-263 (1982)
• 
  Stefan Porubský:
  A characterization of finite unions of arithmetic sequences. Discret. Math. 38(1): 73-77 (1982)
• 
  Christiane Poupard:
  De nouvelles significations enumeratives des nombres d'entringer. Discret. Math. 38(2-3): 265-271 (1982)
• 
  C. R. Pranesachar:
  On the number of two-line and three-line latin rectangles - an alternative approach. Discret. Math. 38(1): 79-86 (1982)
• 
  George B. Purdy:
  The independent sets of rank k of a matroid. Discret. Math. 38(1): 87-91 (1982)
• 
  K. B. Reid:
  Every vertex a king. Discret. Math. 38(1): 93-98 (1982)
• 
  Richard L. Roth:
  Color symmetry and group theory. Discret. Math. 38(2-3): 273-296 (1982)

skipping 5 more matches