• 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

• 2001
• 
  Rommel M. Barbosa, Bert L. Hartnell:
  Characterization of Z_m-well-covered graphs for some classes of graphs. Discret. Math. 233(1-3): 293-297 (2001)
• 
  Vincent Barré:
  On vertex neighborhood in minimal imperfect graphs. Discret. Math. 233(1-3): 211-218 (2001)
• 
  Luis Boza, Maria Teresa Davila, Alberto Márquez, Rafael Moyano:
  Miscellaneous properties of embeddings of line, total and middle graphs. Discret. Math. 233(1-3): 37-54 (2001)
• 
  Hajo Broersma, Zdenek Ryjácek:
  Strengthening the closure concept in claw-free graphs. Discret. Math. 233(1-3): 55-63 (2001)
• 
  Rostislav Caha, Václav Koubek:
  Optimal embeddings of generalized ladders into hypercubes. Discret. Math. 233(1-3): 65-83 (2001)
• 
  Mao-cheng Cai, Evelyne Flandrin, Hao Li:
  On quasifactorability in graphs. Discret. Math. 233(1-3): 85-92 (2001)
• 
  Henry Crapo, Pierre Rosenstiehl:
  On lacets and their manifolds. Discret. Math. 233(1-3): 299-320 (2001)
• 
  Hikoe Enomoto:
  Graph partition problems into cycles and paths. Discret. Math. 233(1-3): 93-101 (2001)
• 
  Daniela Ferrero, Carles Padró:
  New bounds on the diameter vulnerability of iterated line digraphs. Discret. Math. 233(1-3): 103-113 (2001)
• 
  Miroslav Fiedler, Jan Kratochvíl, Jaroslav Nesetril:
  Foreword. Discret. Math. 233(1-3): 1-2 (2001)
• 
  Dalibor Froncek:
  On seed graphs with more than two components. Discret. Math. 233(1-3): 115-126 (2001)
• 
  Matús Harminc, Roman Soták:
  Graphs with average labellings. Discret. Math. 233(1-3): 127-132 (2001)
• 
  S. Mehdi Hashemi:
  Digraph embedding. Discret. Math. 233(1-3): 321-328 (2001)
• 
  Frédéric Havet:
  Channel assignment and multicolouring of the induced subgraphs of the triangular lattice. Discret. Math. 233(1-3): 219-231 (2001)
• 
  Christopher Carl Heckman, Robin Thomas:
  A new proof of the independence ratio of triangle-free cubic graphs. Discret. Math. 233(1-3): 233-237 (2001)
• 
  Pavel Hrnciar, Alfonz Haviar:
  All trees of diameter five are graceful. Discret. Math. 233(1-3): 133-150 (2001)
• 
  Stanislav Jendrol', Heinz-Jürgen Voss:
  Light subgraphs of multigraphs on compact 2-dimensional manifolds. Discret. Math. 233(1-3): 329-351 (2001)
• 
  Arnfried Kemnitz, Massimiliano Marangio:
  Chromatic numbers of integer distance graphs. Discret. Math. 233(1-3): 239-246 (2001)
• 
  Marián Klesc:
  The crossing numbers of Cartesian products of paths with 5-vertex graphs. Discret. Math. 233(1-3): 353-359 (2001)
• 
  Martin Knor, Ludovít Niepel:
  Diameter in iterated path graphs. Discret. Math. 233(1-3): 151-161 (2001)
• 
  Martin Kochol:
  Stable dominating circuits in snarks. Discret. Math. 233(1-3): 247-256 (2001)
• 
  Alexandr V. Kostochka, Jaroslav Nesetril, Petra Smolíková:
  Colorings and homomorphisms of degenerate and bounded degree graphs. Discret. Math. 233(1-3): 257-276 (2001)
• 
  Alexandr V. Kostochka, Douglas R. Woodall:
  Sparse sets in the complements of graphs with given girth. Discret. Math. 233(1-3): 163-174 (2001)
• 
  Martin Loebl, Martín Matamala:
  Some remarks on cycles in graphs and digraphs. Discret. Math. 233(1-3): 175-182 (2001)
• 
  Jirí Matousek:
  Lower bound on the minus-domination number. Discret. Math. 233(1-3): 361-370 (2001)
• 
  Jana Maxová, Jaroslav Nesetril:
  On oriented path double covers. Discret. Math. 233(1-3): 371-380 (2001)
• 
  Jaroslav Nesetril, Eva Milková, Helena Nesetrilová:
  Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history. Discret. Math. 233(1-3): 3-36 (2001)
• 
  Jaroslav Nesetril, Xuding Zhu:
  Construction of sparse graphs with prescribed circular colorings. Discret. Math. 233(1-3): 277-291 (2001)
• 
  Richard J. Nowakowski, Carol A. Whitehead:
  Ordered graceful labellings of the 2-star. Discret. Math. 233(1-3): 183-191 (2001)
• 
  Meike Tewes:
  Pancyclic in-tournaments. Discret. Math. 233(1-3): 193-204 (2001)

skipping 2 more matches