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

• 2007
• 
  Robert E. L. Aldred, Bill Jackson:
  Edge proximity conditions for extendability in cubic bipartite graphs. J. Graph Theory 55(2): 112-120 (2007)
• 
  Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott:
  Maximum directed cuts in acyclic digraphs. J. Graph Theory 55(1): 1-13 (2007)
• 
  Florent Balacheff:
  Volume entropy, weighted girths and stable balls on graphs. J. Graph Theory 55(4): 291-305 (2007)
• 
  Camino Balbuena, T. Jiang, Yuqing Lin, Xavier Marcote, Mirka Miller:
  A lower bound on the order of regular graphs with given girth pair. J. Graph Theory 55(2): 153-163 (2007)
• 
  Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel:
  Tutte sets in graphs I: Maximal tutte sets and D-graphs. J. Graph Theory 55(4): 343-358 (2007)
• 
  Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger:
  Backbone colorings for graphs: Tree and path backbones. J. Graph Theory 55(2): 137-152 (2007)
• 
  Weiting Cao, Peter Hamburger:
  Solution of fink & straight conjecture on path-perfect complete bipartite graphs. J. Graph Theory 55(2): 91-111 (2007)
• 
  Zhi-Zhong Chen:
  New bounds on the edge number of a k-map graph. J. Graph Theory 55(4): 267-290 (2007)
• 
  David Coudert, Florian Huc, Jean-Sébastien Sereni:
  Pathwidth of outerplanar graphs. J. Graph Theory 55(1): 27-41 (2007)
• 
  Dror Fidler, Raphael Yuster:
  Remarks on the second neighborhood problem. J. Graph Theory 55(3): 208-220 (2007)
• 
  Fedor V. Fomin, Dimitrios M. Thilikos:
  On self duality of pathwidth in polyhedral graph embeddings. J. Graph Theory 55(1): 42-54 (2007)
• 
  Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, Shenggui Zhang:
  The upper bound of the number of cycles in a 2-factor of a line graph. J. Graph Theory 55(1): 72-82 (2007)
• 
  András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi:
  Tripartite Ramsey numbers for paths. J. Graph Theory 55(2): 164-174 (2007)
• 
  Zemin Jin, Xingxing Yu, Xiaoyan Zhang:
  Contractible subgraphs in k-connected graphs. J. Graph Theory 55(2): 121-136 (2007)
• 
  Leif K. Jørgensen, Ken-ichi Kawarabayashi:
  Extremal results for rooted minor problems. J. Graph Theory 55(3): 191-207 (2007)
• 
  Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki:
  Spanning trees with leaf distance at least four. J. Graph Theory 55(1): 83-90 (2007)
• 
  Alexander K. Kelmans:
  Packing k-edge trees in graphs of restricted vertex degrees. J. Graph Theory 55(4): 306-324 (2007)
• 
  T. H. Marshall:
  Homomorphism bounds for oriented planar graphs. J. Graph Theory 55(3): 175-190 (2007)
• 
  Martín Matamala:
  Vertex partitions and maximum degenerate subgraphs. J. Graph Theory 55(3): 227-232 (2007)
• 
  Stefko Miklavic, Primoz Potocnik, Steve Wilson:
  Overlap in consistent cycles. J. Graph Theory 55(1): 55-71 (2007)
• 
  André Raspaud, Xuding Zhu:
  List circular coloring of trees and cycles. J. Graph Theory 55(3): 249-265 (2007)
• 
  Amine El Sahili, Mekkia Kouider:
  About paths with two blocks. J. Graph Theory 55(3): 221-226 (2007)
• 
  Jozef Sirán, Thomas W. Tucker:
  Characterization of graphs which admit vertex-transitive embeddings. J. Graph Theory 55(3): 233-248 (2007)
• 
  Chin-Ann Soh:
  The circular chromatic numbers of planar digraphs. J. Graph Theory 55(1): 14-26 (2007)
• 
  Anders Yeo:
  Relationships between total domination, order, size, and maximum degree of graphs. J. Graph Theory 55(4): 325-337 (2007)
• 
  Carol T. Zamfirescu, Tudor Zamfirescu:
  A planar hypohamiltonian graph with 48 vertices. J. Graph Theory 55(4): 338-342 (2007)