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

• 2017
• 
  Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon:
  Coloring Graphs with Constraints on Connectivity. J. Graph Theory 85(4): 814-838 (2017)
• 
  Júlio César Silva Araújo, Alexandre A. Cezar, Ana Silva:
  On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring. J. Graph Theory 85(4): 808-813 (2017)
• 
  Alan Arroyo, R. Bruce Richter:
  Characterizing Graphs with Crossing Number at Least 2. J. Graph Theory 85(4): 738-746 (2017)
• 
  Maria Axenovich, Torsten Ueckerdt, Pascal Weiner:
  Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths. J. Graph Theory 85(3): 601-618 (2017)
• 
  Jørgen Bang-Jensen, Tilde My Christiansen, Alessandro Maddaloni:
  Disjoint Paths in Decomposable Digraphs. J. Graph Theory 85(2): 545-567 (2017)
• 
  René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
  Partitioning Perfect Graphs into Stars. J. Graph Theory 85(2): 297-335 (2017)
• 
  Marthe Bonamy, Jakub Przybylo:
  On the Neighbor Sum Distinguishing Index of Planar Graphs. J. Graph Theory 85(3): 669-690 (2017)
• 
  Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka:
  Tight Descriptions of 3-Paths in Normal Plane Maps : Dedicated to Andre Raspaud on the occasion of his 70th birthday. J. Graph Theory 85(1): 115-132 (2017)
• 
  Izak Broere, Moroli D. V. Matsoha:
  Applications of Hajós-Type Constructions to the Hedetniemi Conjecture. J. Graph Theory 85(2): 585-594 (2017)
• 
  James M. Carraher, William B. Kinnersley, Benjamin Reiniger, Douglas B. West:
  The Game Saturation Number of a Graph. J. Graph Theory 85(2): 481-495 (2017)
• 
  Xiao Chang, Hao Xu:
  Chung-Yau Invariants and Graphs with Symmetric Hitting Times. J. Graph Theory 85(3): 691-705 (2017)
• 
  Ilkyoo Choi:
  Toroidal graphs containing neither K5- nor 6-cycles are 4-choosable. J. Graph Theory 85(1): 172-186 (2017)
• 
  Gérard D. Cohen, Emanuela Fachini, János Körner:
  Path Separation by Short Cycles. J. Graph Theory 85(1): 107-114 (2017)
• 
  Leonardo Nagami Coregliano, Alexander A. Razborov:
  On the Density of Transitive Tournaments. J. Graph Theory 85(1): 12-21 (2017)
• 
  Daniel W. Cranston, Bobby Jaeger:
  List-Coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles. J. Graph Theory 85(4): 721-737 (2017)
• 
  Cristina Dalfó, Miguel Angel Fiol:
  A Note on the Order of Iterated Line Digraphs. J. Graph Theory 85(2): 395-399 (2017)
• 
  Fengming Dong, Weigen Yan:
  Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs. J. Graph Theory 85(1): 74-93 (2017)
• 
  John Engbers:
  Maximizing H-Colorings of Connected Graphs with Fixed Minimum Degree. J. Graph Theory 85(4): 780-787 (2017)
• 
  Asaf Ferber, Michael Krivelevich, Gal Kronenberg:
  Efficient Winning Strategies in Random-Turn Maker-Breaker Games. J. Graph Theory 85(2): 446-465 (2017)
• 
  Adam Gagol, Piotr Micek, Bartosz Walczak:
  Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision. J. Graph Theory 85(1): 22-50 (2017)
• 
  Andrey Grinshpun, Raj Raina, Rik Sengupta:
  Minimum Degrees of Minimal Ramsey Graphs for Almost-Cliques. J. Graph Theory 85(2): 349-362 (2017)
• 
  Krystal Guo, Bojan Mohar:
  Hermitian Adjacency Matrix of Digraphs and Mixed Graphs. J. Graph Theory 85(1): 217-248 (2017)
• 
  Gregory Z. Gutin, Anders Yeo:
  Note on Perfect Forests in Digraphs. J. Graph Theory 85(2): 372-377 (2017)
• 
  Tatiana Romina Hartinger, Martin Milanic:
  Partial Characterizations of 1-Perfectly Orientable Graphs. J. Graph Theory 85(2): 378-394 (2017)
• 
  Penny E. Haxell, Alexander D. Scott:
  On Lower Bounds for the Matching Number of Subcubic Graphs. J. Graph Theory 85(2): 336-348 (2017)
• 
  Jianfeng Hou, Qinghou Zeng:
  On a Problem of Judicious k-Partitions of Graphs. J. Graph Theory 85(3): 619-643 (2017)
• 
  Attila Joó:
  Highly Connected Infinite Digraphs Without Edge-Disjoint Back and Forth Paths Between a Certain Vertex Pair. J. Graph Theory 85(1): 51-55 (2017)
• 
  Felix Joos:
  Parity Linkage and the Erdős-Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs. J. Graph Theory 85(4): 747-758 (2017)
• 
  Maciej Kalkowski, Michal Karonski, Florian Pfender:
  The 1-2-3-Conjecture for Hypergraphs. J. Graph Theory 85(3): 706-715 (2017)
• 
  Liying Kang, Nicholas C. Wormald:
  Minimum Power Dominating Sets of Random Cubic Graphs. J. Graph Theory 85(1): 152-171 (2017)

skipping 25 more matches