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

• 2004
• 
  Martin Anthony:
  Partitioning points by parallel planes. Discret. Math. 282(1-3): 17-21 (2004)
• 
  Makoto Araya, Masaaki Harada:
  MDS codes over F₉ related to the ternary Golay code. Discret. Math. 282(1-3): 233-237 (2004)
• 
  Pedro Berrizbeitia, Reinaldo E. Giudici:
  On cycles in the sequence of unitary Cayley graphs. Discret. Math. 282(1-3): 239-243 (2004)
• 
  Marianna Bolla, Gábor Molnár-Sáska:
  Optimization problems for weighted graphs and related correlation estimates. Discret. Math. 282(1-3): 23-33 (2004)
• 
  Prosenjit Bose, Michiel H. M. Smid, David R. Wood:
  Light edges in degree-constrained graphs. Discret. Math. 282(1-3): 35-41 (2004)
• 
  Bostjan Bresar:
  On subgraphs of Cartesian product graphs and S-primeness. Discret. Math. 282(1-3): 43-52 (2004)
• 
  Pierce G. Buckley, Deryk Osthus:
  Popularity based random graph models leading to a scale-free degree sequence. Discret. Math. 282(1-3): 53-68 (2004)
• 
  Ilaria Cardinali, Nicola Durante, Tim Penttila, Rocco Trombetti:
  Bruen chains over fields of small order. Discret. Math. 282(1-3): 245-247 (2004)
• 
  Xiebin Chen, Qiuying Lin, Fuji Zhang:
  The number of spanning trees in odd valent circulant graphs. Discret. Math. 282(1-3): 69-79 (2004)
• 
  YoungJu Choie, Patrick Solé:
  Ternary codes and Jacobi forms. Discret. Math. 282(1-3): 81-87 (2004)
• 
  Curtis Coker:
  A family of eigensequences. Discret. Math. 282(1-3): 249-250 (2004)
• 
  Emeric Deutsch:
  Ordered trees with prescribed root degrees, node degrees, and branch lengths. Discret. Math. 282(1-3): 89-94 (2004)
• 
  Feng Ming Dong:
  The largest non-integer real zero of chromatic polynomials of graphs with fixed order. Discret. Math. 282(1-3): 103-112 (2004)
• 
  Feng Ming Dong, Khee Meng Koh:
  On upper bounds for real roots of chromatic polynomials. Discret. Math. 282(1-3): 95-101 (2004)
• 
  Encarnación Algaba Durán, Jesús Mario Bilbao, René van den Brink, Andrés Jiménez-Losada:
  Cooperative games on antimatroids. Discret. Math. 282(1-3): 1-15 (2004)
• 
  Jürgen Eckhoff:
  A new Tura'n-type theorem for cliques in graphs. Discret. Math. 282(1-3): 113-122 (2004)
• 
  Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach:
  Competition polysemy. Discret. Math. 282(1-3): 251-255 (2004)
• 
  Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach:
  The solution of two problems on bound polysemy. Discret. Math. 282(1-3): 257-261 (2004)
• 
  Marc P. C. Fossorier, Jaroslav Jezek, James B. Nation, Alex Pogel:
  Ordinary graphs and subplane partitions. Discret. Math. 282(1-3): 137-148 (2004)
• 
  Martín Eduardo Frías-Armenta, Victor Neumann-Lara, Miguel A. Pizaña:
  Dismantlings and iterated clique graphs. Discret. Math. 282(1-3): 263-265 (2004)
• 
  Chin-Mei Fu, Wen-Chung Huang, Yi-Hsin Shih, Yu-Ju Yaon:
  Totally symmetric latin squares with prescribed intersection numbers. Discret. Math. 282(1-3): 123-136 (2004)
• 
  Hung-Lin Fu, Shung-Liang Wu:
  Cyclically decomposing the complete graph into cycles. Discret. Math. 282(1-3): 267-273 (2004)
• 
  Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
  A counterexample to a conjecture on edge-coloured tournaments. Discret. Math. 282(1-3): 275-276 (2004)
• 
  Jaroslaw Grytczuk:
  Another variation on Conway's recursive sequence. Discret. Math. 282(1-3): 149-161 (2004)
• 
  Masasi Higasikawa:
  There is no universal countable random-free graph. Discret. Math. 282(1-3): 277-279 (2004)
• 
  Tayuan Huang, Chih-Wen Weng:
  Pooling spaces and non-adaptive pooling designs. Discret. Math. 282(1-3): 163-169 (2004)
• 
  Jennifer D. Key, Jamshid Moori, Bernardo Gabriel Rodrigues:
  Binary codes from graphs on triples. Discret. Math. 282(1-3): 171-182 (2004)
• 
  Francisco Larrión, Célia Picinin de Mello, Aurora Morgana, Victor Neumann-Lara, Miguel A. Pizaña:
  The clique operator on cographs and serial graphs. Discret. Math. 282(1-3): 183-191 (2004)
• 
  Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña, Thomas Dale Porter:
  A hierarchy of self-clique graphs. Discret. Math. 282(1-3): 193-208 (2004)
• 
  Valery A. Liskovets, Timothy R. S. Walsh:
  Enumeration of eulerian and unicursal planar maps. Discret. Math. 282(1-3): 209-221 (2004)

skipping 2 more matches