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

• 1999
• 
  József Balogh, András Pluhár:
  A sharp edge bound on the interval number of a graph. J. Graph Theory 32(2): 153-159 (1999)
• 
  Thomas Böhme, Jochen Harant, Michal Tkác:
  On certain Hamiltonian cycles in planar graphs. J. Graph Theory 32(1): 81-96 (1999)
• 
  Thomas Böhme, Jochen Harant, Michal Tkác:
  More than one tough chordal planar graphs are Hamiltonian. J. Graph Theory 32(4): 405-410 (1999)
• 
  Thomas Böhme, Bojan Mohar, Michael Stiebitz:
  Dirac's map-color theorem for choosability. J. Graph Theory 32(4): 327-339 (1999)
• 
  Pierre Boiron, Éric Sopena, Laurence Vignal:
  Acrylic improper colorings of graphs. J. Graph Theory 32(1): 97-107 (1999)
• 
  Peter J. Cameron:
  SGDs with doubly transitive automorphism group. J. Graph Theory 32(3): 229-233 (1999)
• 
  Yair Caro, Christian Provstgaard:
  Zero-sum delta-systems and multiple copies of graphs. J. Graph Theory 32(2): 207-216 (1999)
• 
  Glenn G. Chappell:
  A lower bound for partial list colorings. J. Graph Theory 32(4): 390-393 (1999)
• 
  Xiaotie Deng, Christos H. Papadimitriou:
  Exploring an unknown graph. J. Graph Theory 32(3): 265-297 (1999)
• 
  Reinhard Diestel, Daniela Kühn:
  A universal planar graph under the minor relation. J. Graph Theory 32(2): 191-206 (1999)
• 
  Shao-Fei Du, Dragan Marusic:
  An infinite family of biprimitive semisymmetric graphs. J. Graph Theory 32(3): 217-228 (1999)
• 
  S. Louis Hakimi, Edward F. Schmeichel:
  Improved bounds for the chromatic index of graphs and multigraphs. J. Graph Theory 32(4): 311-326 (1999)
• 
  Richard H. Hammack:
  Cyclicity of graphs. J. Graph Theory 32(2): 160-170 (1999)
• 
  Petr Hlinený:
  A note on possible extensions of Negami's conjecture. J. Graph Theory 32(3): 234-240 (1999)
• 
  Lingling Huang, Gerard J. Chang:
  The circular chromatic number of the Mycielskian of G. J. Graph Theory 32(1): 63-71 (1999)
• 
  John F. P. Hudson:
  Distinguishing two graph-encoded manifolds of Lins. J. Graph Theory 32(3): 298-302 (1999)
• 
  Frank Jelen:
  k-Independence and the k-residue of a graph. J. Graph Theory 32(3): 241-249 (1999)
• 
  Tao Jiang, Douglas B. West:
  Coloring of trees with minimum sum of colors. J. Graph Theory 32(4): 354-358 (1999)
• 
  Martin Juvan, Bojan Mohar, Riste Skrekovski:
  Graphs of degree 4 are 5-edge-choosable. J. Graph Theory 32(3): 250-264 (1999)
• 
  Hal A. Kierstead, Gábor N. Sárközy, Stanley M. Selkow:
  On k-ordered Hamiltonian graphs. J. Graph Theory 32(1): 17-25 (1999)
• 
  Matthias Kriesell:
  On a conjecture of Thomassen and Toft. J. Graph Theory 32(2): 118-122 (1999)
• 
  In-Jen Lin, Malay K. Sen, Douglas B. West:
  Intersection representation of digraphs in trees with few leaves. J. Graph Theory 32(4): 340-353 (1999)
• 
  Konrad Piwakowski, Stanislaw P. Radziszowski, Sebastian Urbanski:
  Computation of the Folkman number F_e(3, 3; 5). J. Graph Theory 32(1): 41-49 (1999)
• 
  Romeo Rizzi:
  Indecomposable r-graphs and some other counterexamples. J. Graph Theory 32(1): 1-15 (1999)
• 
  Irena Rusu:
  Berge graphs with chordless cycles of bounded length. J. Graph Theory 32(1): 73-79 (1999)
• 
  Irena Rusu:
  Perfectly contractile diamond-free graphs. J. Graph Theory 32(4): 359-389 (1999)
• 
  Zdenek Ryjácek, Akira Saito, Richard H. Schelp:
  Closure, 2-factors, and cycle coverings in claw-free graphs. J. Graph Theory 32(2): 109-117 (1999)
• 
  Akira Saito:
  Degree sums and graphs that are not covered by two cycles. J. Graph Theory 32(1): 51-61 (1999)
• 
  Paul J. Tanenbaum:
  Simultaneous intersection representation of pairs of graphs. J. Graph Theory 32(2): 171-190 (1999)
• 
  Annegret Wagler:
  On critically perfect graphs. J. Graph Theory 32(4): 394-404 (1999)

skipping 4 more matches