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

• 2005
• 
  Jens-P. Bode, Heiko Harborth:
  Directed paths of diagonals within polygons. Discret. Math. 299(1-3): 3-10 (2005)
• 
  Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin:
  Bisplit graphs. Discret. Math. 299(1-3): 11-32 (2005)
• 
  Marco Buratti, Francesco Rania, Fulvio Zuanni:
  Some constructions for cyclic perfect cycle systems. Discret. Math. 299(1-3): 33-48 (2005)
• 
  Kathie Cameron, Tracy Walker:
  The graphs with maximum induced matching and maximum matching the same size. Discret. Math. 299(1-3): 49-55 (2005)
• 
  Nancy E. Clarke, Richard J. Nowakowski:
  Tandem-win graphs. Discret. Math. 299(1-3): 56-64 (2005)
• 
  Edward Dobson:
  On groups of odd prime-power degree that contain a full cycle. Discret. Math. 299(1-3): 65-78 (2005)
• 
  Edward Dobson, Joy Morris:
  On automorphism groups of circulant digraphs of square-free order. Discret. Math. 299(1-3): 79-98 (2005)
• 
  Dalibor Froncek, Brett Stevens:
  Pancomponented 2-factorizations of complete graphs. Discret. Math. 299(1-3): 99-112 (2005)
• 
  Pavol Hell, Jing Huang:
  A generalization of the theorem of Lekkerkerker and Boland. Discret. Math. 299(1-3): 113-119 (2005)
• 
  Peter Horák:
  On the chromatic number of Steiner triple systems of order 25. Discret. Math. 299(1-3): 120-128 (2005)
• 
  Peter Horák, Alexander Rosa:
  Extended Petersen graphs. Discret. Math. 299(1-3): 129-140 (2005)
• 
  P. Mark Kayll:
  A note on weak Sidon sequences. Discret. Math. 299(1-3): 141-144 (2005)
• 
  Hadi Kharaghani, Alexander Rosa:
  Preface. Discret. Math. 299(1-3): 1 (2005)
• 
  Sandi Klavzar:
  On median nature and enumerative properties of Fibonacci-like cubes. Discret. Math. 299(1-3): 145-153 (2005)
• 
  Midori Kobayashi, Gisaku Nakamura, Chie Nara:
  Uniform coverings of 2-paths with 5-paths in the complete graph. Discret. Math. 299(1-3): 154-161 (2005)
• 
  Yuqing Lin, Mirka Miller, Camino Balbuena:
  Improved lower bound for the vertex connectivity of (delta;;g)-cages. Discret. Math. 299(1-3): 162-171 (2005)
• 
  Jiping Liu:
  A characterization of pancyclic complements of line graphs. Discret. Math. 299(1-3): 172-179 (2005)
• 
  Dragan Marusic:
  Quartic half-arc-transitive graphs with large vertex stabilizers. Discret. Math. 299(1-3): 180-193 (2005)
• 
  Montserrat Maureso, Josep M. Brunat:
  On endo-Cayley digraphs: The hamiltonian property. Discret. Math. 299(1-3): 194-207 (2005)
• 
  Dave Witte Morris, Joy Morris, David Petrie Moulton:
  Flows that are sums of hamiltonian cycles in Cayley graphs on abelian groups. Discret. Math. 299(1-3): 208-268 (2005)
• 
  Joy Morris, Mateja Sajna:
  Brian Alspach and his work. Discret. Math. 299(1-3): 269-287 (2005)
• 
  Nenad Obradoviç, Joseph G. Peters, Goran Ruzic:
  Minimum chromaticity of circulant graphs. Discret. Math. 299(1-3): 288-296 (2005)
• 
  Ebrahim Salehi, Sin-Min Lee, Mahdad Khatirinejad:
  IC-Colorings and IC-Indices of graphs. Discret. Math. 299(1-3): 297-310 (2005)
• 
  Elkin Vumar, Heinz Adolf Jung:
  Some degree bounds for the circumference of graphs. Discret. Math. 299(1-3): 311-334 (2005)
• 
  Rui Xu, Cun-Quan Zhang:
  On flows in bidirected graphs. Discret. Math. 299(1-3): 335-343 (2005)