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

• 2010
• 
  Abhijin Adiga, L. Sunil Chandran:
  Cubicity of interval graphs and the claw number. J. Graph Theory 65(4): 323-333 (2010)
• 
  Drago Bokal:
  Infinite families of crossing-critical graphs with prescribed average degree and crossing number. J. Graph Theory 65(2): 139-162 (2010)
• 
  Anthony Bonato, Gena Hahn, Claude Tardif:
  Large classes of infinite k-cop-win graphs. J. Graph Theory 65(4): 334-342 (2010)
• 
  Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, Pascal Ochem, André Raspaud:
  Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. J. Graph Theory 65(2): 83-93 (2010)
• 
  Leizhen Cai, Weifan Wang, Xuding Zhu:
  Choosability of toroidal graphs without short cycles. J. Graph Theory 65(1): 1-15 (2010)
• 
  Mathew Cropper, Anthony J. W. Hilton, Peter D. Johnson Jr., Jenö Lehel:
  List multicoloring problems involving the k-fold Hall numbers. J. Graph Theory 65(1): 16-34 (2010)
• 
  Ajit A. Diwan:
  Cycles of even lengths modulo k. J. Graph Theory 65(3): 246-252 (2010)
• 
  Keith Edwards:
  Achromatic number of fragmentable graphs. J. Graph Theory 65(2): 94-114 (2010)
• 
  Hikoe Enomoto, Kenta Ozeki:
  The independence number condition for the existence of a spanning f-tree. J. Graph Theory 65(3): 173-184 (2010)
• 
  Dennis D. A. Epple, Jing Huang:
  A note on the bichromatic numbers of graphs. J. Graph Theory 65(4): 263-269 (2010)
• 
  Pu Gao:
  Connectivity of random regular graphs generated by the pegging algorithm. J. Graph Theory 65(3): 185-197 (2010)
• 
  John Baptist Gauci, Anthony J. W. Hilton:
  Continuous k-to-1 functions between complete graphs whose orders are of a different parity. J. Graph Theory 65(1): 35-60 (2010)
• 
  Dan Hefetz, Annina Saluz, Huong T. T. Tran:
  An application of the combinatorial Nullstellensatz to a graph labelling problem. J. Graph Theory 65(1): 70-82 (2010)
• 
  Petr Hlinený, Gelasio Salazar:
  Stars and bonds in crossing-critical graphs. J. Graph Theory 65(3): 198-215 (2010)
• 
  Bin Jia, Zai Ping Lu, Gai Xia Wang:
  A class of symmetric graphs with 2-arc transitive quotients. J. Graph Theory 65(3): 232-245 (2010)
• 
  Alexandr V. Kostochka:
  On K_{s, t} minors in (s+t)-chromatic graphs. J. Graph Theory 65(4): 343-350 (2010)
• 
  István Kovács, Klavdija Kutnar, Dragan Marusic:
  Classification of edge-transitive rose window graphs. J. Graph Theory 65(3): 216-231 (2010)
• 
  Wolfgang Mader:
  Connectivity keeping paths in k-connected graphs. J. Graph Theory 65(1): 61-69 (2010)
• 
  Sean McGuinness:
  Cycle and cocycle coverings of graphs. J. Graph Theory 65(4): 270-284 (2010)
• 
  Arnaud Pêcher, Xuding Zhu:
  Claw-free circular-perfect graphs. J. Graph Theory 65(2): 163-172 (2010)
• 
  Momchil Rusinov, Pascal Schweitzer:
  Homomorphism-homogeneous graphs. J. Graph Theory 65(3): 253-262 (2010)
• 
  Diego Scheide, Michael Stiebitz:
  Vizing's coloring algorithm and the fan number. J. Graph Theory 65(2): 115-138 (2010)
• 
  Jin-Xin Zhou, Yan-Quan Feng:
  Cubic vertex-transitive graphs of order 2pq. J. Graph Theory 65(4): 285-302 (2010)
• 
  Yori Zwols:
  K₄-free graphs with no odd hole: Even pairs and the circular chromatic number. J. Graph Theory 65(4): 303-322 (2010)