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

• 2014
• 
  Mohammad Alzohairi, Youssef Boudabbous:
  3-minimal triangle-free graphs. Discret. Math. 331: 3-8 (2014)
• 
  Andrei Asinowski, Gill Barequet, Toufik Mansour, Ron Y. Pinter:
  Cut equivalence of d-dimensional guillotine partitions. Discret. Math. 331: 165-174 (2014)
• 
  Jonathan E. Beagley, Walter D. Morris Jr.:
  Chromatic numbers of copoint graphs of convex geometries. Discret. Math. 331: 151-157 (2014)
• 
  Bocong Chen, Hongwei Liu, Guanghui Zhang:
  Some minimal cyclic codes over finite fields. Discret. Math. 331: 142-150 (2014)
• 
  Tuvi Etzion:
  The q-analog of the middle levels problem. Discret. Math. 331: 109-116 (2014)
• 
  Jesse Geneson, Tanya Khovanova, Jonathan Tidor:
  Convex geometric (k+2)-quasiplanar representations of semi-bar k-visibility graphs. Discret. Math. 331: 83-88 (2014)
• 
  Peter Horák:
  On graphs with many cycles. Discret. Math. 331: 1-2 (2014)
• 
  Samuel Clowes Huneke, Ryan B. Hayward, Bjarne Toft:
  A winning strategy for 3×n Cylindrical Hex. Discret. Math. 331: 93-97 (2014)
• 
  Shanmugasundaram Jeevadoss, Appu Muthusamy:
  Decomposition of complete bipartite graphs into paths and cycles. Discret. Math. 331: 98-108 (2014)
• 
  Stanislav Jendrol', Ingo Schiermeyer, Jianhua Tu:
  Rainbow numbers for matchings in plane triangulations. Discret. Math. 331: 158-164 (2014)
• 
  Daniel Kotlar:
  Computing the autotopy group of a Latin square by cycle structure. Discret. Math. 331: 74-82 (2014)
• 
  Michael S. Lang:
  Bipartite distance-regular graphs: The Q-polynomial property and pseudo primitive idempotents. Discret. Math. 331: 27-35 (2014)
• 
  Mingchao Li, Yan Zhang, Beiliang Du:
  Some new results on mutually orthogonal frequency squares. Discret. Math. 331: 175-187 (2014)
• 
  Yu-Chang Liang, Tsai-Lien Wong, Xuding Zhu:
  Anti-magic labeling of trees. Discret. Math. 331: 9-14 (2014)
• 
  Lan Lin, Yixun Lin, Douglas B. West:
  Cutwidth of triangular grids. Discret. Math. 331: 89-92 (2014)
• 
  Václav Linek, Shai J. Mor, Nabil Shalaby:
  Skolem and Rosa rectangles and related designs. Discret. Math. 331: 53-73 (2014)
• 
  Allan Lo:
  A note on the minimum size of k-rainbow-connected graphs. Discret. Math. 331: 20-21 (2014)
• 
  Salvatore Milici, Zsolt Tuza:
  Uniformly resolvable decompositions of K_v into P₃ and K₃ graphs. Discret. Math. 331: 137-141 (2014)
• 
  Gabriele Nebe:
  A fourth extremal even unimodular lattice of dimension 48. Discret. Math. 331: 133-136 (2014)
• 
  Nicola Pace:
  New ternary linear codes from projectivity groups. Discret. Math. 331: 22-26 (2014)
• 
  Jiangmin Pan, Zhaohong Huang, Fenghui Xu, Suyun Ding:
  On cyclic regular covers of complete graphs of small order. Discret. Math. 331: 36-42 (2014)
• 
  Erik E. Westlund:
  Hamilton decompositions of 6-regular Cayley graphs on even Abelian groups with involution-free connections sets. Discret. Math. 331: 117-132 (2014)
• 
  Ismael González Yero, Marko Jakovac, Dorota Kuziak, Andrej Taranenko:
  The partition dimension of strong product graphs and Cartesian product graphs. Discret. Math. 331: 43-52 (2014)
• 
  Junling Zhou, Yanxun Chang:
  A new result on Sylvester's problem. Discret. Math. 331: 15-19 (2014)