• 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

• 1998
• 
  Thomas Andreae:
  On the clique-transversal number of chordal graphs. Discret. Math. 191(1-3): 3-11 (1998)
• 
  Luitpold Babel:
  Tree-like P₄-connected graphs. Discret. Math. 191(1-3): 13-23 (1998)
• 
  Thomas Böhme, Jochen Harant:
  On Hamiltonian cycles in 4- and 5-connected plane triangulations. Discret. Math. 191(1-3): 25-30 (1998)
• 
  Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer:
  A planarity criterion for cubic bipartite graphs. Discret. Math. 191(1-3): 31-43 (1998)
• 
  Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:
  On kernel-perfect orientations of line graphs. Discret. Math. 191(1-3): 45-49 (1998)
• 
  Mieczyslaw Borowiecki, Danuta Michalak:
  Generalized independence and domination in graphs. Discret. Math. 191(1-3): 51-56 (1998)
• 
  Jan Brousek:
  Minimal 2-connected non-hamiltonian claw-free graphs. Discret. Math. 191(1-3): 57-64 (1998)
• 
  Guantao Chen, András Gyárfás, Richard H. Schelp:
  Vertex colorings with a distance restriction. Discret. Math. 191(1-3): 65-82 (1998)
• 
  Igor Fabrici, Stanislav Jendrol':
  Subgraphs with restricted degrees of their vertices in planar graphs. Discret. Math. 191(1-3): 83-90 (1998)
• 
  Harald Gropp:
  On configurations and the book of Sainte-Laguë. Discret. Math. 191(1-3): 91-99 (1998)
• 
  Gregory Z. Gutin, Benny Sudakov, Anders Yeo:
  Note on alternating directed cycles. Discret. Math. 191(1-3): 101-107 (1998)
• 
  Heiko Harborth:
  Empty triangles in drawings of the complete graph. Discret. Math. 191(1-3): 109-111 (1998)
• 
  Arnfried Kemnitz, Halka Kolberg:
  Coloring of integer distance graphs. Discret. Math. 191(1-3): 113-123 (1998)
• 
  Alexandr V. Kostochka, Michael Stiebitz:
  Colour-critical graphs with few edges. Discret. Math. 191(1-3): 125-137 (1998)
• 
  Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
  Complexity of choosing subsets from color sets. Discret. Math. 191(1-3): 139-148 (1998)
• 
  Peter Mihók, Jozef Bucko, Margit Voigt:
  On uniquely partitionable planar graphs. Discret. Math. 191(1-3): 149-158 (1998)
• 
  Bert Randerath, Lutz Volkmann:
  Characterization of graphs with equal domination and covering number. Discret. Math. 191(1-3): 159-169 (1998)
• 
  Zdenek Ryjácek, Ingo Schiermeyer:
  2-factors and hamiltonicity. Discret. Math. 191(1-3): 171-177 (1998)
• 
  Horst Sachs:
  Preface. Discret. Math. 191(1-3): 1-2 (1998)
• 
  Annette Schelten, Uwe Schelten:
  Neighborhood conditions for graphs with induced claws. Discret. Math. 191(1-3): 179-189 (1998)
• 
  Annette Schelten, Ingo Schiermeyer:
  Ramsey numbers r(K₃, G) for G =~ K₇ - 2P₂ and G =~ K₇ - 3P₂. Discret. Math. 191(1-3): 191-196 (1998)
• 
  Peter Smutný, Michal Tkác:
  On cubic polyhedral graphs with prescribed adjacency properties of their faces. Discret. Math. 191(1-3): 197-206 (1998)
• 
  Jerzy Topp, Preben D. Vestergaard:
  Interpolation theorems for domination numbers of a graph. Discret. Math. 191(1-3): 207-221 (1998)
• 
  Heinz-Jürgen Voss:
  Sachs triangulations and infinite sequences of regular maps on given type. Discret. Math. 191(1-3): 223-240 (1998)
• 
  Walter Wessel:
  A short solution of Heawood's empire problem in the plane. Discret. Math. 191(1-3): 241-245 (1998)