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

• 1997
• 
  Lowell W. Beineke, Robert C. Vandell:
  Decycling graphs. J. Graph Theory 25(1): 59-77 (1997)
• 
  Yair Caro:
  Subdivisions, parity and well-covered graphs. J. Graph Theory 25(1): 85-94 (1997)
• 
  F. R. K. Chung:
  Open problems of Paul Erdös in graph theory. J. Graph Theory 25(1): 3-36 (1997)
• 
  T. A. Clarke, Robert A. Hochberg, Glenn H. Hurlbert:
  Pebbling in diameter two graphs and products of paths. J. Graph Theory 25(2): 119-128 (1997)
• 
  Marston D. E. Conder, Margaret Morton, Cheryl E. Praeger:
  Partition graphs for finite symmetric groups. J. Graph Theory 25(2): 107-117 (1997)
• 
  Edward Dobson:
  Packing almost stars into the complete graph. J. Graph Theory 25(2): 169-172 (1997)
• 
  Yoshimi Egawa, Mikio Kano, Alexander K. Kelmans:
  Star partitions of graphs. J. Graph Theory 25(3): 185-190 (1997)
• 
  Genghua Fan:
  Minimum cycle covers of graphs. J. Graph Theory 25(3): 229-242 (1997)
• 
  Odile Favaron, Feng Tian, Lei Zhang:
  Independence and hamiltonicity in 3-domination-critical graphs. J. Graph Theory 25(3): 173-184 (1997)
• 
  Zoltán Füredi, Péter Komjáth:
  On the existence of countable universal graphs. J. Graph Theory 25(1): 53-58 (1997)
• 
  Alexandr V. Kostochka, Douglas B. West:
  Total interval number for graphs with bounded degree. J. Graph Theory 25(1): 79-84 (1997)
• 
  Mekkia Kouider, Peter Winkler:
  Mean distance and minimum degree. J. Graph Theory 25(1): 95-99 (1997)
• 
  Jan Kratochvíl, András Sebö:
  Coloring precolored perfect graphs. J. Graph Theory 25(3): 207-215 (1997)
• 
  Yury Makarychev:
  A short proof of Kuratowski's graph planarity criterion. J. Graph Theory 25(2): 129-131 (1997)
• 
  Dragan Marusic, Ming-Yao Xu:
  A ½-transitive graph of valency 4 with a nonsolvable group of automorphisms. J. Graph Theory 25(2): 133-138 (1997)
• 
  B. Menke, Tudor Zamfirescu, Christina Zamfirescu:
  Intersections of longest cycles in grid graphs. J. Graph Theory 25(1): 37-52 (1997)
• 
  Stephen G. Penrice:
  Dominating sets with small clique covering number. J. Graph Theory 25(2): 101-105 (1997)
• 
  Scott P. Randby:
  Minimal embeddings in the projective plane. J. Graph Theory 25(2): 153-163 (1997)
• 
  Tadashi Sakuma:
  A counterexample to the bold conjecture. J. Graph Theory 25(2): 165-168 (1997)
• 
  Laura A. Sanchis:
  Bounds related to domination in graphs with minimum degree two. J. Graph Theory 25(2): 139-152 (1997)
• 
  Éric Sopena:
  The chromatic number of oriented graphs. J. Graph Theory 25(3): 191-205 (1997)
• 
  Bing Wei, Yongjin Zhu:
  Hamiltonian κ-factors in graphs. J. Graph Theory 25(3): 217-227 (1997)