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

• 2006
• 
  Sarmad Abbasi, Asif Jamshed:
  A Degree Constraint for Uniquely Hamiltonian Graphs. Graphs Comb. 22(4): 433-442 (2006)
• 
  Lech Adamus, A. Pawel Wojda:
  Almost Symmetric Cycles in Large Digraphs. Graphs Comb. 22(4): 443-452 (2006)
• 
  Michael O. Albertson, Bojan Mohar:
  Coloring Vertices and Faces of Locally Planar Graphs. Graphs Comb. 22(3): 289-295 (2006)
• 
  Lars Døvling Andersen, Preben D. Vestergaard, Zsolt Tuza:
  Largest Non-Unique Subgraphs. Graphs Comb. 22(4): 453-470 (2006)
• 
  Joe Anderson, Haidong Wu:
  An Extremal Problem on Contractible Edges in 3-Connected Graphs. Graphs Comb. 22(2): 145-152 (2006)
• 
  Armen S. Asratian:
  New Local Conditions for a Graph to be Hamiltonian. Graphs Comb. 22(2): 153-160 (2006)
• 
  Maria Axenovich, Ryan R. Martin:
  Sub-Ramsey Numbers for Arithmetic Progressions. Graphs Comb. 22(3): 297-309 (2006)
• 
  János Barát:
  Directed Path-width and Monotonicity in Digraph Searching. Graphs Comb. 22(2): 161-172 (2006)
• 
  Douglas Bauer, Hajo Broersma, Edward F. Schmeichel:
  Toughness in Graphs - A Survey. Graphs Comb. 22(1): 1-35 (2006)
• 
  Adam H. Berliner, Ulrike Bostelmann, Richard A. Brualdi, Louis Deaett:
  Sum List Coloring Graphs. Graphs Comb. 22(2): 173-183 (2006)
• 
  Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer:
  Planar Graphs, via Well-Orderly Maps and Trees. Graphs Comb. 22(2): 185-202 (2006)
• 
  Bart De Bruyn:
  Distance-j-Ovoids in Regular Near 2d-Gons. Graphs Comb. 22(2): 203-216 (2006)
• 
  Peter Danziger, Peter Dukes, Terry S. Griggs, Eric Mendelsohn:
  On the Intersection Problem for Steiner Triple Systems of Different Orders. Graphs Comb. 22(3): 311-329 (2006)
• 
  Matthew Dean:
  On Hamilton Cycle Decomposition of 6-regular Circulant Graphs. Graphs Comb. 22(3): 331-340 (2006)
• 
  Adrian Dumitrescu, János Pach:
  Pushing Squares Around. Graphs Comb. 22(1): 37-50 (2006)
• 
  Keith Edwards, Mirko Hornák, Mariusz Wozniak:
  On the Neighbour-Distinguishing Index of a Graph. Graphs Comb. 22(3): 341-350 (2006)
• 
  Michael Ferrara, Ronald J. Gould, Gerard Tansey, Thor Whalen:
  On H-Linked Graphs. Graphs Comb. 22(2): 217-224 (2006)
• 
  Peter Frankl, Norihide Tokushige:
  The Maximum Size of 3-Wise Intersecting and 3-Wise Union Families. Graphs Comb. 22(2): 225-231 (2006)
• 
  Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak:
  A Note on a Packing Problem in Transitive Tournaments. Graphs Comb. 22(2): 233-239 (2006)
• 
  David J. Grynkiewicz, Andrew Schultz:
  A Five Color Zero-Sum Generalization. Graphs Comb. 22(3): 351-360 (2006)
• 
  Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
  On n-partite Tournaments with Unique n-cycle. Graphs Comb. 22(2): 241-249 (2006)
• 
  Xiaolong Huang, Zemin Jin, Xingxing Yu, Xiaoyan Zhang:
  Contractible Cliques in k-Connected Graphs. Graphs Comb. 22(3): 361-370 (2006)
• 
  Lijun Ji:
  Partition of Triples of Order 6k+5 into 6k+3 Optimal Packings and One Packing of Size 8k+4. Graphs Comb. 22(2): 251-260 (2006)
• 
  Tomás Kaiser, Matthias Kriesell:
  On the Pancyclicity of Lexicographic Products. Graphs Comb. 22(1): 51-58 (2006)
• 
  M. G. Karunambigai, Appu Muthusamy:
  On Resolvable Multipartite G-Designs II. Graphs Comb. 22(1): 59-67 (2006)
• 
  Sandra R. Kingan, Manoel Lemos:
  On the Circuit-cocircuit Intersection Conjecture. Graphs Comb. 22(4): 471-480 (2006)
• 
  Matthias Kriesell:
  There Exist Highly Critically Connected Graphs of Diameter Three. Graphs Comb. 22(4): 481-485 (2006)
• 
  Tero Laihonen:
  Optimal t-Edge-Robust r-Identifying Codes in the King Lattice. Graphs Comb. 22(4): 487-496 (2006)
• 
  Manoel Lemos:
  Weight Distribution of the Bases of a Matroid. Graphs Comb. 22(1): 69-82 (2006)
• 
  Xuechao Li:
  Sizes of Critical Graphs with Small Maximum Degrees. Graphs Comb. 22(4): 503-513 (2006)

skipping 17 more matches