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

• 2003
• 
  Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Akira Saito:
  M-alternating paths in n-extendable bipartite graphs. Discret. Math. 269(1-3): 1-11 (2003)
• 
  Ibrahim Assem, María Inés Platzeck, María Julia Redondo, Sonia Trepode:
  Simply connected incidence algebras. Discret. Math. 269(1-3): 333-355 (2003)
• 
  Camino Balbuena, Daniela Ferrero:
  Edge-connectivity and super edge-connectivity of P₂-path graphs. Discret. Math. 269(1-3): 13-20 (2003)
• 
  Airat Bekmetjev, Graham R. Brightwell, Andrzej Czygrinow, Glenn Hurlbert:
  Thresholds for families of multisets, with an application to graph pebbling. Discret. Math. 269(1-3): 21-34 (2003)
• 
  Christian Bey:
  An upper bound on the sum of squares of degrees in a hypergraph. Discret. Math. 269(1-3): 259-263 (2003)
• 
  Yair Caro, Raphael Yuster:
  2-connected graphs with small 2-connected dominating sets. Discret. Math. 269(1-3): 265-271 (2003)
• 
  Donald I. Cartwright, Patrick Solé, Andrzej Zuk:
  Ramanujan geometries of type Ã_n. Discret. Math. 269(1-3): 35-43 (2003)
• 
  An Chang:
  On the largest eigenvalue of a tree with perfect matchings. Discret. Math. 269(1-3): 45-63 (2003)
• 
  Gary Chartrand, David Erwin, Michael A. Henning, Peter J. Slater, Ping Zhang:
  Graphs of order n with locating-chromatic number n-1. Discret. Math. 269(1-3): 65-79 (2003)
• 
  Liang Chen, Naoyuki Tokuda:
  n-Tokyoites' loop-line commuter problem. Discret. Math. 269(1-3): 81-91 (2003)
• 
  Anders Claesson, Chris D. Godsil, David G. Wagner:
  A permutation group determined by an ordered set. Discret. Math. 269(1-3): 273-279 (2003)
• 
  Grégory Duby:
  Countable ultrahomogeneous antimatroids of convex dimension 2. Discret. Math. 269(1-3): 113-125 (2003)
• 
  Yan-Quan Feng, Jin Ho Kwak:
  An infinite family of cubic one-regular graphs with unsolvable automorphism groups. Discret. Math. 269(1-3): 281-286 (2003)
• 
  John P. Georges, David W. Mauro:
  Labeling trees with a condition at distance two. Discret. Math. 269(1-3): 127-148 (2003)
• 
  Mike J. Grannell, Terry S. Griggs, Vladimir P. Korzhik, Jozef Sirán:
  On the minimal nonzero distance between triangular embeddings of a complete graph. Discret. Math. 269(1-3): 149-160 (2003)
• 
  Sylvain Gravier, Sandi Klavzar, Michel Mollard:
  Isometric embeddings of subdivided wheels in hypercubes. Discret. Math. 269(1-3): 287-293 (2003)
• 
  Hong-Jian Lai, Xiangwen Li:
  Small cycle cover of 2-connected cubic graphs. Discret. Math. 269(1-3): 295-302 (2003)
• 
  Manoel Lemos:
  Uniqueness of the decomposition of the rank function of a 2-polymatroid. Discret. Math. 269(1-3): 161-179 (2003)
• 
  Ko-Wei Lih, Wei-Fan Wang, Xuding Zhu:
  Coloring the square of a K₄-minor free graph. Discret. Math. 269(1-3): 303-309 (2003)
• 
  Weijun Liu:
  Suzuki groups and automorphisms of finite linear spaces. Discret. Math. 269(1-3): 181-190 (2003)
• 
  Zhengke Miao:
  Improper choosability of graphs embedded on the surface of genus r. Discret. Math. 269(1-3): 311-314 (2003)
• 
  Antonio Di Nola, Ada Lettieri:
  Finite BL-algebras. Discret. Math. 269(1-3): 93-112 (2003)
• 
  Arnaud Pêcher:
  Partitionable graphs arising from near-factorizations of finite groups. Discret. Math. 269(1-3): 191-218 (2003)
• 
  Jane G. Pitkethly:
  Inherent dualisability. Discret. Math. 269(1-3): 219-237 (2003)
• 
  Manfred Schocker:
  Idempotents for derangement numbers. Discret. Math. 269(1-3): 239-248 (2003)
• 
  Jinsong Tan:
  On Cheeger inequalities of a graph. Discret. Math. 269(1-3): 315-323 (2003)
• 
  Stephanie van Willigenburg:
  Properties of the descent algebras of type D. Discret. Math. 269(1-3): 325-332 (2003)
• 
  Yuansheng Yang, Weifa Liang:
  The minimum number of vertices with girth 6 and degree set D={r, m}. Discret. Math. 269(1-3): 249-258 (2003)