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

• 2017
• 
  Zbigniew R. Bogdanowicz:
  On decomposition of the Cartesian product of directed cycles into cycles of equal lengths. Discret. Appl. Math. 229: 148-150 (2017)
• 
  Nathan J. Bowler, Joshua Erde, Florian Lehner, Martin Merker, Max Pitz, Konstantinos S. Stavropoulos:
  A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs. Discret. Appl. Math. 229: 151-153 (2017)
• 
  Boris Brimkov, Illya V. Hicks:
  Complexity and computation of connected zero forcing. Discret. Appl. Math. 229: 31-45 (2017)
• 
  Sebastian M. Cioaba, Randall J. Elzinga, Michelle Markiewitz, Kevin N. Vander Meulen, Trevor Vanderwoerd:
  Addressing graph products and distance-regular graphs. Discret. Appl. Math. 229: 46-54 (2017)
• 
  Alejandro Contreras-Balbuena, Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
  A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs. Discret. Appl. Math. 229: 55-63 (2017)
• 
  Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr:
  The complexity of tropical graph homomorphisms. Discret. Appl. Math. 229: 64-81 (2017)
• 
  Shuhong Gao, Fiona Knoll, Felice Manganiello, Gretchen L. Matthews:
  Codes for distributed storage from 3-regular graphs. Discret. Appl. Math. 229: 82-89 (2017)
• 
  Helin Gong, Shuli Li:
  The number of spanning trees of a family of 2-separable weighted graphs. Discret. Appl. Math. 229: 154-160 (2017)
• 
  Xiaomin Hu, Bin Zhao, Yingzhi Tian, Jixiang Meng:
  Matching preclusion for k-ary n-cubes with odd k ≥ 3. Discret. Appl. Math. 229: 90-100 (2017)
• 
  Wen An Liu, Ming Yue Wang:
  Multi-player Wythoff's game and its variants. Discret. Appl. Math. 229: 1-16 (2017)
• 
  Longcheng Liu, Wenhao Zheng, Chao Li:
  Inverse minimum flow problem under the weighted sum-type Hamming distance. Discret. Appl. Math. 229: 101-112 (2017)
• 
  John Martinovic, Guntram Scheithauer:
  An upper bound of Δ(E) < 3 / 2 for skiving stock instances of the divisible case. Discret. Appl. Math. 229: 161-167 (2017)
• 
  Lianying Miao, Shiyou Pang, Fang Liu, Eryan Wang, Xiaoqing Guo:
  On the extremal values of the eccentric distance sum of trees with a given domination number. Discret. Appl. Math. 229: 113-120 (2017)
• 
  Sara Nicoloso, Ugo Pietropaoli:
  Vertex-colouring of 3-chromatic circulant graphs. Discret. Appl. Math. 229: 121-138 (2017)
• 
  Eda Uyanik, Olivier Sobrie, Vincent Mousseau, Marc Pirlot:
  Enumerating and categorizing positive Boolean functions separable by a k-additive capacity. Discret. Appl. Math. 229: 17-30 (2017)
• 
  Huihui Zhang, Shuchao Li:
  On the Laplacian spectral radius of bipartite graphs with fixed order and size. Discret. Appl. Math. 229: 139-147 (2017)