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

• 2005
• 
  Vito Abatangelo, Bambina Larato:
  Near-MDS codes arising from algebraic curves. Discret. Math. 301(1): 5-19 (2005)
• 
  Marién Abreu, Domenico Labbate, Stephen C. Locke:
  6-path-connectivity and 6-generation. Discret. Math. 301(1): 20-27 (2005)
• 
  Angela Aguglia, Antonio Cossidente, Gary L. Ebert:
  On pairs of permutable Hermitian surfaces. Discret. Math. 301(1): 28-33 (2005)
• 
  Ch. Sobhan Babu, Ajit A. Diwan:
  Degree conditions for forests in graphs. Discret. Math. 301(2-3): 228-231 (2005)
• 
  Anna Benini, Fiorenza Morini:
  Partially balanced incomplete block designs from weakly divisible nearrings. Discret. Math. 301(1): 34-45 (2005)
• 
  Andrea Blunck, Hans Havlicek:
  On bijections that preserve complementarity of subspaces. Discret. Math. 301(1): 46-56 (2005)
• 
  Gunnar Brinkmann, Brendan D. McKay:
  Construction of planar triangulations with minimum degree 5. Discret. Math. 301(2-3): 147-163 (2005)
• 
  Nicola Durante, Pia Maria Lo Re, Domenico Olanda:
  On regular planar spaces of type (k, n). Discret. Math. 301(1): 66-73 (2005)
• 
  Giovanni Lo Faro, Antoinette Tripodi:
  Strict colourings of STS(3v)s and uncolourable BSTS(3v)s. Discret. Math. 301(1): 117-123 (2005)
• 
  Gennian Ge:
  On (g, 4;1)-difference matrices. Discret. Math. 301(2-3): 164-174 (2005)
• 
  Sabine Giese, Hans Havlicek, Ralph-Hardo Schulz:
  Some constructions of divisible designs from Laguerre geometries. Discret. Math. 301(1): 74-82 (2005)
• 
  Michael A. Henning, Jacob Elgin Maritz:
  Stratification and domination in graphs with minimum degree two. Discret. Math. 301(2-3): 175-194 (2005)
• 
  Vikram Jha, Norman L. Johnson:
  Transitive conical flocks of even order. Discret. Math. 301(1): 83-88 (2005)
• 
  Gábor Korchmáros:
  Preface. Discret. Math. 301(1): 1 (2005)
• 
  Hans-Joachim Kroll, Rita Vincenti:
  PD-sets for the codes related to some classical varieties. Discret. Math. 301(1): 89-105 (2005)
• 
  Michel Lavrauw:
  Characterizations and properties of good eggs in PG(4n-1, q), q odd. Discret. Math. 301(1): 106-116 (2005)
• 
  Hung-Chih Lee, Chiang Lin:
  Balanced star decompositions of regular multigraphs and lambda-fold complete bipartite graphs. Discret. Math. 301(2-3): 195-206 (2005)
• 
  Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo, Josep Fàbrega:
  (delta, g)-cages with g geq 10 are 4-connected. Discret. Math. 301(1): 124-136 (2005)
• 
  Anna de Mier, Marc Noy:
  Tutte uniqueness of line graphs. Discret. Math. 301(1): 57-65 (2005)
• 
  Ron Shaw, Neil A. Gordon, Johannes G. Maks:
  Partial spreads in PG(4, 2) and flats in PG(9, 2) external to the Grassmannian G_{1, 4, 2}. Discret. Math. 301(1): 137-146 (2005)
• 
  Jinlong Shu, Cun-Quan Zhang:
  A note about shortest cycle covers. Discret. Math. 301(2-3): 232-238 (2005)
• 
  Daniel C. Slilaty:
  On cographic matroids and signed-graphic matroids. Discret. Math. 301(2-3): 207-217 (2005)
• 
  A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
  Erratum to "On self-complementary supergraphs of (n, n)-graphs" [Discrete Math. 292(2005) 167-185]. Discret. Math. 301(2-3): 247 (2005)
• 
  Baogang Xu:
  Minimally circular-imperfect graphs with a major vertex. Discret. Math. 301(2-3): 239-242 (2005)
• 
  Jian-Hua Yin, Jiong-Sheng Li:
  Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size. Discret. Math. 301(2-3): 218-227 (2005)
• 
  Zhongfu Zhang, Jianxun Zhang, Xinzhong Lu:
  The relation of matching with inverse degree of a graph. Discret. Math. 301(2-3): 243-246 (2005)