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

• 1991
• 
  Brian Alspach, C. C. Chen, Katherine Heinrich:
  Characterization of a class of triangle-free graphs with a certain adjacency property. J. Graph Theory 15(4): 375-388 (1991)
• 
  Peter Avery:
  Score sequences of oriented graphs. J. Graph Theory 15(3): 251-257 (1991)
• 
  László Babai:
  Vertex-transitive graphs and vertex-transitive maps. J. Graph Theory 15(6): 587-627 (1991)
• 
  Sheng Bau, Derek A. Holton:
  Cycles containing 12 vertices in 3-connected cubic graphs. J. Graph Theory 15(4): 421-429 (1991)
• 
  Claude Berge, Jean-Claude Fournier:
  A short proof for a generalization of Vizing's theorem. J. Graph Theory 15(3): 333-336 (1991)
• 
  Haitze J. Broersma, Henk Jan Veldman:
  Long dominating cycles and paths in graphs with large neighborhood unions. J. Graph Theory 15(1): 29-38 (1991)
• 
  Mao-Cheng Cai:
  [a, b]-factorizations of graphs. J. Graph Theory 15(3): 283-301 (1991)
• 
  Yair Caro:
  On zero-sum delta-systems and multiple copies of hypergraphs. J. Graph Theory 15(5): 511-521 (1991)
• 
  Yair Caro, Ilia Krasikov, Yehuda Roditty:
  On the largest tree of given maximum degree in a connected graph. J. Graph Theory 15(1): 7-13 (1991)
• 
  Yair Caro, Zsolt Tuza:
  Improved lower bounds on k-independence. J. Graph Theory 15(1): 99-107 (1991)
• 
  Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee:
  20-relative neighborhood graphs are hamiltonian. J. Graph Theory 15(5): 543-557 (1991)
• 
  Sharad Chaudhary, Gary Gordon:
  Tutte polynomials for trees. J. Graph Theory 15(3): 317-331 (1991)
• 
  Sheshayya A. Choudum, M. S. Paulraj:
  Regular factors in K_{1, 3}-free graphs. J. Graph Theory 15(3): 259-265 (1991)
• 
  Fan R. K. Chung, Ronald L. Graham:
  Quasi-random tournaments. J. Graph Theory 15(2): 173-198 (1991)
• 
  Xiaotie Deng, Christos H. Papadimitriou:
  On path lengths modulo three. J. Graph Theory 15(3): 267-282 (1991)
• 
  Guoli Ding:
  Covering the edges with consecutive sets. J. Graph Theory 15(5): 559-562 (1991)
• 
  Yoshimi Egawa, Katsuhiro Ota:
  Regular factors in K_{1, n} free graphs. J. Graph Theory 15(3): 337-344 (1991)
• 
  Mark N. Ellingham:
  Vertex-switching, isomorphism, and pseudosimilarity. J. Graph Theory 15(6): 563-572 (1991)
• 
  Paul Erdös, John G. Gimbel, Dieter Kratsch:
  Some extremal results in cochromatic and dichromatic theory. J. Graph Theory 15(6): 579-585 (1991)
• 
  Odile Favaron, Maryvonne Mahéo, Jean-François Saclé:
  On the residue of a graph. J. Graph Theory 15(1): 39-64 (1991)
• 
  Ronald J. Gould:
  Updating the hamiltonian problem - A survey. J. Graph Theory 15(2): 121-157 (1991)
• 
  Jonathan L. Gross, Robert G. Rieper:
  Local extrema in genus-stratified graphs. J. Graph Theory 15(2): 159-171 (1991)
• 
  David Hartvigsen, Russell Mardon:
  The prism-free planar graphs and their cycles bases. J. Graph Theory 15(4): 431-441 (1991)
• 
  Qingxue Huang:
  On the decomposition of K_n into complete m-partite graphs. J. Graph Theory 15(1): 1-6 (1991)
• 
  Bill Jackson:
  Neighborhood unions and hamilton cycles. J. Graph Theory 15(4): 443-451 (1991)
• 
  Michael S. Jacobson, Fred R. McMorris, Edward R. Scheinerman:
  General results on tolerance intersection graphs. J. Graph Theory 15(6): 573-577 (1991)
• 
  Atsushi Kaneko, Akira Saito:
  Cycles intersecting a prescribed vertex set. J. Graph Theory 15(6): 655-664 (1991)
• 
  André E. Kézdy, Patrick McGuinness:
  Do 3n - 5 edges force a subdivision of K₅? J. Graph Theory 15(4): 389-406 (1991)
• 
  Shigeru Kitakubo:
  Bounding the number of embeddings of 5-connected projective-planar graphs. J. Graph Theory 15(2): 199-205 (1991)
• 
  Zhikang Lu:
  On an upper bound for the harmonious chromatic number of a graph. J. Graph Theory 15(4): 345-347 (1991)

skipping 19 more matches