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

• 1997
• 
  Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Amel Harkat-Benhamdine, Hao Li:
  Dlambda-cycles in lambda-claw-free graphs. Discret. Math. 165-166: 11-20 (1997)
• 
  Demetrios Achlioptas:
  The complexity of G-free colourability. Discret. Math. 165-166: 21-30 (1997)
• 
  Noga Alon, Zsolt Tuza, Margit Voigt:
  Choosability and fractional chromatic numbers. Discret. Math. 165-166: 31-38 (1997)
• 
  Jørgen Bang-Jensen, Gregory Z. Gutin:
  Alternating cycles and paths in edge-coloured multigraphs: A survey. Discret. Math. 165-166: 39-60 (1997)
• 
  Claude Berge:
  Motivations and history of some of my conjectures. Discret. Math. 165-166: 61-70 (1997)
• 
  J. Adrian Bondy:
  Counting subgraphs a new approach to the Caccetta-Häggkvist conjecture. Discret. Math. 165-166: 71-80 (1997)
• 
  Endre Boros, Ondrej Cepek:
  On perfect 0, +/- 1 matrices^, . Discret. Math. 165-166: 81-100 (1997)
• 
  Mustapha Bouchakour, Ali Ridha Mahjoub:
  One-node cutsets and the dominating set polytope. Discret. Math. 165-166: 101-123 (1997)
• 
  Josep M. Brunat, Montserrat Maureso, M. Mora:
  Characterization of c-circulant digraphs of degree two which are circulant. Discret. Math. 165-166: 125-137 (1997)
• 
  Irène Charon, A. Guénoche, Olivier Hudry, Frédéric Woirgard:
  New results on the computation of median orders. Discret. Math. 165-166: 139-153 (1997)
• 
  Vasek Chvátal:
  In praise of Claude Berge. Discret. Math. 165-166: 3-9 (1997)
• 
  Raul Cordovil:
  Coloring matroids. Discret. Math. 165-166: 155-160 (1997)
• 
  Charles Delorme, Jean-Pierre Tillich:
  Eigenvalues, eigenspaces and distances to subsets. Discret. Math. 165-166: 171-194 (1997)
• 
  Walter A. Deuber, Xuding Zhu:
  The chromatic numbers of distance graphs. Discret. Math. 165-166: 195-204 (1997)
• 
  Michel Deza, Viatcheslav P. Grishukhin:
  The skeleton of the 120-cell is not 5-gonal. Discret. Math. 165-166: 205-210 (1997)
• 
  Guoli Ding, Peter L. Hammer:
  Matroids arisen from matrogenic graphs. Discret. Math. 165-166: 211-217 (1997)
• 
  Jack Edmonds, Monique Laurent, Alexander Schrijver:
  A minor-monotone graph parameter based on oriented matroids. Discret. Math. 165-166: 219-226 (1997)
• 
  Paul Erdös:
  Some old and new problems in various branches of combinatorics. Discret. Math. 165-166: 227-231 (1997)
• 
  Hazel Everett, Celina M. H. de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed:
  Path parity and perfection. Discret. Math. 165-166: 233-252 (1997)
• 
  Odile Favaron, Y. Redouane:
  Minimum independent generalized t-degree and independence number in K_{1, r+1}-free graphs. Discret. Math. 165-166: 253-261 (1997)
• 
  Herbert Fleischner:
  A numbering of the vertices of special networks. Discret. Math. 165-166: 263-276 (1997)
• 
  Jean-Luc Fouquet, Vassilis Giakoumakis:
  On semi-P₄-sparse graphs. Discret. Math. 165-166: 277-300 (1997)
• 
  Jean-Luc Fouquet, Frédéric Maire, Irena Rusu, Henri Thuillier:
  On transversals in minimal imperfect graphs. Discret. Math. 165-166: 301-312 (1997)
• 
  Jean-Luc Fouquet, Pierre Rosenstiehl:
  Preface. Discret. Math. 165-166: 1-2 (1997)
• 
  Jean-Claude Fournier:
  Tiling pictures of the plane with dominoes. Discret. Math. 165-166: 313-320 (1997)
• 
  Vassilis Giakoumakis, Florian Roussel, Henri Thuillier:
  Scattering number and modular decomposition. Discret. Math. 165-166: 321-342 (1997)
• 
  John Gimbel, Maryvonne Mahéo, Christine Virlouvet:
  Double total domination of graphs. Discret. Math. 165-166: 343-351 (1997)
• 
  Sylvain Gravier, Frédéric Maffray:
  Choice number of 3-colorable elementary graphs. Discret. Math. 165-166: 353-358 (1997)
• 
  Harald Gropp:
  Blocking set free configurations and their relations to digraphs and hypergraphs. Discret. Math. 165-166: 359-370 (1997)
• 
  Ervin Györi:
  C₆-free bipartite graphs and product representation of squares. Discret. Math. 165-166: 371-375 (1997)

skipping 26 more matches