• 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

• 1979
• 
  Ian Anderson:
  Infinite families of biembedding numbers. J. Graph Theory 3(3): 263-268 (1979)
• 
  David Avis:
  On minimal 5-chromatic triangle-free graphs. J. Graph Theory 3(4): 397-400 (1979)
• 
  László Babai:
  Long cycles in vertex-transitive graphs. J. Graph Theory 3(3): 301-304 (1979)
• 
  Douglas Bauer, Ralph Tindell:
  Graphs with prescribed connectivity and line graph connectivity. J. Graph Theory 3(4): 393-395 (1979)
• 
  Kenneth A. Berman:
  Spanning arborescences, ingraphs, and outgraphs. J. Graph Theory 3(2): 141-150 (1979)
• 
  Kenneth A. Berman, H. Shank:
  Full 4-colorings of 4-regular maps. J. Graph Theory 3(3): 291-294 (1979)
• 
  Andreas Blass, Frank Harary:
  Properties of almost all graphs and complexes. J. Graph Theory 3(3): 225-240 (1979)
• 
  Béla Bollobás, Ernest J. Cockayne:
  Graph-theoretic parameters concerning domination, independence, and irredundance. J. Graph Theory 3(3): 241-249 (1979)
• 
  Guy Chaty, Michel Chein:
  Minimally 2-edge connected graphs. J. Graph Theory 3(1): 15-22 (1979)
• 
  Vasek Chvátal, Herbert Fleischner, J. Sheehan, Carsten Thomassen:
  Three-regular subgraphs of four-regular graphs. J. Graph Theory 3(4): 371-386 (1979)
• 
  C. R. J. Clapham:
  A class of self-complementary graphs and lower bounds of some ramsey numbers. J. Graph Theory 3(3): 287-289 (1979)
• 
  Charles J. Colbourn, Ronald C. Read:
  Orderly algorithms for generating restricted classes of graphs. J. Graph Theory 3(2): 187-195 (1979)
• 
  Dragos M. Cvetkovic, Slobodan K. Simic:
  A bibliography of graph equations. J. Graph Theory 3(4): 311-324 (1979)
• 
  Paul H. Edelman, Michael E. Saks:
  Group labelings of graphs. J. Graph Theory 3(2): 135-140 (1979)
• 
  Brian L. Garman:
  Voltage graph embeddings and the associated block designs. J. Graph Theory 3(1): 53-67 (1979)
• 
  Georg Gati:
  Further annotated bibliography on the isomorphism disease. J. Graph Theory 3(2): 95-109 (1979)
• 
  Ira M. Gessel:
  Tournaments and Vandermond's determinant. J. Graph Theory 3(3): 305-307 (1979)
• 
  Donald L. Goldsmith, Roger C. Entringer:
  A sufficient condition for equality of edge-connectivity and minimum degree of a graph. J. Graph Theory 3(3): 251-255 (1979)
• 
  Martin Grötschel:
  On minimal strong blocks. J. Graph Theory 3(3): 213-219 (1979)
• 
  Martin Grötschel, Frank Harary:
  The graphs for which all strong orientations are hamiltonian. J. Graph Theory 3(3): 221-223 (1979)
• 
  Seifollah Louis Hakimi, Edward F. Schmeichel:
  On the number of cycles of length k in a maximal planar graph. J. Graph Theory 3(1): 69-86 (1979)
• 
  Seifollah Louis Hakimi, Edward F. Schmeichel, Carsten Thomassen:
  On the number of hamiltonian cycles in a maximal planar graph. J. Graph Theory 3(4): 365-370 (1979)
• 
  Phil Hanlon:
  Enumeration of graphs by degree sequence. J. Graph Theory 3(3): 295-299 (1979)
• 
  Pavol Hell, Louis V. Quintas:
  An intermediate value theorem for graphs with given automorphism group. J. Graph Theory 3(1): 35-41 (1979)
• 
  François Jaeger:
  A Note on Sub-Eulerian Graphs. J. Graph Theory 3(1): 91-93 (1979)
• 
  François Jaeger, Charles Payan, Nguyen Huy Xuong:
  A class of upper-embeddable graphs. J. Graph Theory 3(4): 387-391 (1979)
• 
  Aram Kevorkian:
  Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal. J. Graph Theory 3(2): 151-174 (1979)
• 
  Aram Kevorkian:
  Erratum: Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal. J. Graph Theory 3(4): 411 (1979)
• 
  Anton Kotzig:
  1-Factorizations of cartesian products of regular graphs. J. Graph Theory 3(1): 23-34 (1979)
• 
  Marg Kropar, Ronald C. Read:
  On the construction of the self-complementary graphs on 12 nodes. J. Graph Theory 3(2): 111-125 (1979)

skipping 17 more matches