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

• 1993
• 
  Andrzej Rucinski, Andrew Vince:
  The solution to an extremal problem on balanced extensions of graphs. J. Graph Theory 17(3): 417-431 (1993)
• 
  H. L. Abbott, Bing Zhou:
  The star chromatic number of a graph. J. Graph Theory 17(3): 349-360 (1993)
• 
  Michael O. Albertson, Lily Chan, Ruth Haas:
  Independence and graph homomorphisms graph homomorphisms. J. Graph Theory 17(5): 581-588 (1993)
• 
  Robert E. L. Aldred, Derek A. Holton, Dingjun Lou:
  N-extendability of symmetric graphs. J. Graph Theory 17(2): 253-261 (1993)
• 
  Robert E. L. Aldred, Robert L. Hemminger, Katsuhiro Ota:
  The 3-connected graphs having a longest cycle containing only three contractible edges. J. Graph Theory 17(3): 361-371 (1993)
• 
  Noga Alon, Yair Caro:
  On three zero-sum Ramsey-type problems. J. Graph Theory 17(2): 177-192 (1993)
• 
  Jean-Claude Bermond, Pavol Hell:
  On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs. J. Graph Theory 17(5): 647-655 (1993)
• 
  Daniel Bienstock, Nathaniel Dean:
  Bounds for rectilinear crossing numbers. J. Graph Theory 17(3): 333-348 (1993)
• 
  Phillip Botti, Russell Merris:
  Almost all trees share a complete set of immanantal polynomials. J. Graph Theory 17(4): 467-476 (1993)
• 
  Haitze J. Broersma, A. J. W. Duijvestijn, F. Göbel:
  Generating all 3-connected 4-regular planar graphs from the octahedron graph. J. Graph Theory 17(5): 613-620 (1993)
• 
  Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman:
  Cycles containing all vertices of maximum degree. J. Graph Theory 17(3): 373-385 (1993)
• 
  Dasong Cao, Hong Yuan:
  Graphs characterized by the second eigenvalue. J. Graph Theory 17(3): 325-331 (1993)
• 
  Tony Yu Chang, William Edwin Clark:
  The domination numbers of the 5 × n and 6 × n grid graphs. J. Graph Theory 17(1): 81-107 (1993)
• 
  Robin J. Chapman, Julie Haviland:
  Generalized Rotation numbers. J. Graph Theory 17(3): 291-301 (1993)
• 
  Gary Chartrand, Garry L. Johns, Songlin Tian, Steven J. Winters:
  Directed distance in digraphs: Centers and medians. J. Graph Theory 17(4): 509-521 (1993)
• 
  Zhi-Hong Chen:
  A degree condition for spanning eulerian subgraphs. J. Graph Theory 17(1): 5-21 (1993)
• 
  Guantao Chen, Johannes H. Hattingh, Cecil C. Rousseau:
  Asymptotic bounds for irredundant and mixed Ramsey numbers. J. Graph Theory 17(2): 193-206 (1993)
• 
  Zhi-Hong Chen, Hong-Jian Lai:
  Collapsible graphs and matchings. J. Graph Theory 17(5): 597-605 (1993)
• 
  Sheshayya A. Choudum:
  Edge-chromatic critical graphs and the existence of 1-factors. J. Graph Theory 17(1): 23-29 (1993)
• 
  Myung S. Chung, Douglas B. West:
  Large P₄-free graphs with bounded degree. J. Graph Theory 17(1): 109-116 (1993)
• 
  Marston D. E. Conder:
  Hexagon-free subgraphs of hypercubes. J. Graph Theory 17(4): 477-479 (1993)
• 
  Andrey A. Dobrynin:
  Cubic graphs with 62 vertices having the same path layer matrix. J. Graph Theory 17(1): 1-4 (1993)
• 
  Klaus Dohmen:
  Lower bounds and upper bounds for chromatic polynomials. J. Graph Theory 17(1): 75-80 (1993)
• 
  Feng Ming Dong:
  On chromatic uniqueness of two infinite families of graphs. J. Graph Theory 17(3): 387-392 (1993)
• 
  Jürgen Eckhoff:
  Extremal interval graphs. J. Graph Theory 17(1): 117-127 (1993)
• 
  David Eppstein:
  Connectivity, graph minors, and subgraph multiplicity. J. Graph Theory 17(3): 409-416 (1993)
• 
  Martin Erickson:
  An upper bound for the Folkman number F(3, 3; 5). J. Graph Theory 17(6): 679-681 (1993)
• 
  Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li:
  The complete closure of a graph. J. Graph Theory 17(4): 481-494 (1993)
• 
  Ralph J. Faudree, András Gyárfás, Linda M. Lesniak, Richard H. Schelp:
  Rainbow coloring the cube. J. Graph Theory 17(5): 607-612 (1993)
• 
  Miquel A. Fiol:
  The connectivity of large digraphs and graphs. J. Graph Theory 17(1): 31-45 (1993)

skipping 38 more matches