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

• 2019
• 
  Andrés Ángel, Jerson Borja:
  The evasiveness conjecture and graphs on 2p vertices. J. Graph Theory 91(1): 35-52 (2019)
• 
  Julien Baste, Dieter Rautenbach, Ignasi Sau:
  Upper bounds on the uniquely restricted chromatic index. J. Graph Theory 91(3): 251-258 (2019)
• 
  Stéphane Bessy, Pascal Ochem, Dieter Rautenbach:
  On the Kőnig?Egerváry theorem for k?paths. J. Graph Theory 91(1): 73-87 (2019)
• 
  Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
  Hereditary graph classes: When the complexities of coloring and clique cover coincide. J. Graph Theory 91(3): 267-289 (2019)
• 
  Valerio Boncompagni, Irena Penev, Kristina Vuskovic:
  Clique-cutsets beyond chordal graphs. J. Graph Theory 91(2): 192-246 (2019)
• 
  Sebastián Bustamante, Hiêp Hàn, Maya Stein:
  Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles. J. Graph Theory 91(1): 5-15 (2019)
• 
  Steven Chaplick, Radoslav Fulek, Pavel Klavík:
  Extending partial representations of circle graphs. J. Graph Theory 91(4): 365-394 (2019)
• 
  Ilkyoo Choi, Louis Esperet:
  Improper coloring of graphs on surfaces. J. Graph Theory 91(1): 16-34 (2019)
• 
  Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa, Natasha Morrison, Guilherme Oliveira Mota, Damian Reding, Barnaby Roberts:
  The size?Ramsey number of powers of paths. J. Graph Theory 91(3): 290-299 (2019)
• 
  Zdenek Dvorák:
  On distance r?dominating and 2r?independent sets in sparse graphs. J. Graph Theory 91(2): 162-173 (2019)
• 
  Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Balázs Patkós, Máté Vizer:
  An improvement on the maximum number of k?dominating independent sets. J. Graph Theory 91(1): 88-97 (2019)
• 
  Olivier Durand de Gevigney, Zoltán Szigeti:
  On (2, k)?connected graphs. J. Graph Theory 91(4): 305-325 (2019)
• 
  António Girão, Shoham Letzter, Julian Sahasrabudhe:
  Partitioning a graph into monochromatic connected subgraphs. J. Graph Theory 91(4): 353-364 (2019)
• 
  Pierre Ille, Robert E. Woodrow:
  Fractal graphs. J. Graph Theory 91(1): 53-72 (2019)
• 
  Seog-Jin Kim, Kenta Ozeki:
  A note on a Brooks' type theorem for DP?coloring. J. Graph Theory 91(2): 148-161 (2019)
• 
  Bart Litjens:
  On dihedral flows in embedded graphs. J. Graph Theory 91(2): 174-191 (2019)
• 
  Lucas Mol, Ortrud R. Oellermann:
  Maximizing the mean subtree order. J. Graph Theory 91(4): 326-352 (2019)
• 
  Oliver Schaudt, Maya Stein:
  Partitioning two?coloured complete multipartite graphs into monochromatic paths and cycles. J. Graph Theory 91(2): 122-147 (2019)
• 
  Paul Wollan, David R. Wood:
  Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor. J. Graph Theory 91(3): 259-266 (2019)
• 
  Douglas R. Woodall:
  The average degree of a subcubic edge?chromatic critical graph. J. Graph Theory 91(2): 103-121 (2019)