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

• 2011
• 
  Sarmad Abbasi, Laeeq Aslam:
  The Cycle Discrepancy of Three-Regular Graphs. Graphs Comb. 27(1): 27-46 (2011)
• 
  Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood:
  Every Large Point Set contains Many Collinear Points or an Empty Pentagon. Graphs Comb. 27(1): 47-60 (2011)
• 
  Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam:
  Cutting a Convex Polyhedron Out of a Sphere. Graphs Comb. 27(3): 307-319 (2011)
• 
  Jin Akiyama, Hiro Ito, Midori Kobayashi, Gisaku Nakamura:
  Arrangements of n Points whose Incident-Line-Numbers are at most n/2. Graphs Comb. 27(3): 321-326 (2011)
• 
  Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
  Colorful Strips. Graphs Comb. 27(3): 327-339 (2011)
• 
  Mustafa Atici, Claus Ernst:
  On the Range of Possible Integrities of Graphs G(n, k). Graphs Comb. 27(4): 475-485 (2011)
• 
  Rangaswami Balakrishnan, T. Kavaskar:
  Color Chain of a Graph. Graphs Comb. 27(4): 487-493 (2011)
• 
  Robert A. Beeler, Robert E. Jamison:
  Automorphic Decompositions of Graphs. Graphs Comb. 27(2): 149-160 (2011)
• 
  Diptendu Bhowmick, L. Sunil Chandran:
  Boxicity of Circular Arc Graphs. Graphs Comb. 27(6): 769-783 (2011)
• 
  Elizabeth J. Billington, Italo J. Dejter, Dean G. Hoffman, Charles Curtis Lindner:
  Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles. Graphs Comb. 27(2): 161-170 (2011)
• 
  Peter Borg:
  Maximum Hitting of a Set by Compressed Intersecting Families. Graphs Comb. 27(6): 785-797 (2011)
• 
  Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn:
  Path-Bicolorable Graphs. Graphs Comb. 27(6): 799-819 (2011)
• 
  Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno:
  Algorithmic Folding Complexity. Graphs Comb. 27(3): 341-351 (2011)
• 
  L. Sunil Chandran, Mathew C. Francis, Rogers Mathew:
  Boxicity of Leaf Powers. Graphs Comb. 27(1): 61-72 (2011)
• 
  L. Sunil Chandran, Mathew C. Francis, Rogers Mathew:
  Chordal Bipartite Graphs with High Boxicity. Graphs Comb. 27(3): 353-362 (2011)
• 
  Xue-Gang Chen, Moo Young Sohn:
  Domination Number of Graphs Without Small Cycles. Graphs Comb. 27(6): 821-830 (2011)
• 
  Vasek Chvátal:
  Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs. Graphs Comb. 27(2): 171-175 (2011)
• 
  Nathann Cohen, Frédéric Havet:
  Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree. Graphs Comb. 27(6): 831-849 (2011)
• 
  Július Czap, Stanislav Jendrol', Frantisek Kardos, Jozef Miskuf:
  Looseness of Plane Graphs. Graphs Comb. 27(1): 73-85 (2011)
• 
  Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke:
  Continuous Blooming of Convex Polyhedra. Graphs Comb. 27(3): 363-376 (2011)
• 
  Erik D. Demaine, Martin L. Demaine, Vi Hart, Gregory N. Price, Tomohiro Tachi:
  (Non)Existence of Pleated Folds: How Paper Folds Between Creases. Graphs Comb. 27(3): 377-397 (2011)
• 
  Chris Dowden:
  Random Planar Graphs with Bounds on the Maximum and Minimum Degrees. Graphs Comb. 27(1): 87-107 (2011)
• 
  Adrian Dumitrescu, János Pach:
  Minimum Clique Partition in Unit Disk Graphs. Graphs Comb. 27(3): 399-411 (2011)
• 
  Emanuela Fachini, János Körner:
  Forbiddance and Capacity. Graphs Comb. 27(4): 495-503 (2011)
• 
  Dalibor Froncek, Petr Kovár, Michael Kubesa:
  Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices. Graphs Comb. 27(5): 621-646 (2011)
• 
  Takuro Fukunaga:
  All 4-Edge-Connected HHD-Free Graphs are \mathbbZ₃-Connected. Graphs Comb. 27(5): 647-659 (2011)
• 
  David J. Galvin, Yufei Zhao:
  The Number of Independent Sets in a Graph with Small Maximum Degree. Graphs Comb. 27(2): 177-186 (2011)
• 
  Severino Villanueva Gervacio, Hiroshi Maehara:
  A Note on Lights-Out-Puzzle: Parity-State Graphs. Graphs Comb. 27(1): 109-119 (2011)
• 
  Stefan Geschke, Menachem Kojman:
  Symmetrized Induced Ramsey Theory. Graphs Comb. 27(6): 851-864 (2011)
• 
  Michael Goff:
  Higher Dimensional Moore Bounds. Graphs Comb. 27(4): 505-530 (2011)

skipping 40 more matches