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

• 1999
• 
  Jørgen Bang-Jensen, Yubao Guo:
  A note on vertex pancyclic oriented graphs. J. Graph Theory 31(4): 313-318 (1999)
• 
  C. Paul Bonnington, Jozef Sirán:
  Bipartite labeling of trees with maximum degree three. J. Graph Theory 31(1): 7-15 (1999)
• 
  Steve Bowser, Charles Cable, J. Richard Lundgren:
  Niche graphs and mixed pair graphs of tournaments. J. Graph Theory 31(4): 319-332 (1999)
• 
  Gerard J. Chang, Frank K. Hwang, Li-Da Tong:
  The consecutive-4 digraphs are Hamiltonian. J. Graph Theory 31(1): 1-6 (1999)
• 
  Michael Drmota, Bernhard Gittenberger:
  The distribution of nodes of given degree in random trees. J. Graph Theory 31(3): 227-253 (1999)
• 
  Eldar Fischer:
  Variants of the Hajnal-Szemerédi Theorem. J. Graph Theory 31(4): 275-282 (1999)
• 
  Lorenz Halbeisen, Norbert Hungerbühler:
  Generation of isospectral graphs. J. Graph Theory 31(3): 255-265 (1999)
• 
  Katherine Heinrich, Jiping Liu, Min-Li Yu:
  P₄-decompositions of regular graphs. J. Graph Theory 31(2): 135-143 (1999)
• 
  Chính T. Hoàng, Frédéric Maffray, Marc Noy:
  A characterization of P₄-indifference graphs. J. Graph Theory 31(3): 155-162 (1999)
• 
  Stefan Hougardy:
  On wing-perfect graphs. J. Graph Theory 31(1): 51-66 (1999)
• 
  Tibor Jordán:
  Extremal graphs in connectivity augmentation. J. Graph Theory 31(3): 179-193 (1999)
• 
  Tibor Jordán:
  On the number of shredders. J. Graph Theory 31(3): 195-200 (1999)
• 
  Heinz Adolf Jung, P. Wittmann:
  Longest cycles in tough graphs. J. Graph Theory 31(2): 107-127 (1999)
• 
  Yung-Ling Lai, Kenneth Williams:
  A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs. J. Graph Theory 31(2): 75-94 (1999)
• 
  John Maharry:
  An excluded minor theorem for the octahedron. J. Graph Theory 31(2): 95-100 (1999)
• 
  Daniel A. Marcus:
  Directed cycles with chords. J. Graph Theory 31(1): 17-28 (1999)
• 
  Leonid S. Melnikov, Vadym G. Vizing:
  The edge chromatic number of a directed/mixed multigraph. J. Graph Theory 31(4): 267-273 (1999)
• 
  Michael Molloy:
  Chromatic neighborhood sets. J. Graph Theory 31(4): 303-311 (1999)
• 
  Joy Morris:
  Isomorphic Cayley graphs on nonisomorphic groups. J. Graph Theory 31(4): 345-362 (1999)
• 
  Christina M. Mynhardt:
  Vertices contained in every minimum dominating set of a tree. J. Graph Theory 31(3): 163-177 (1999)
• 
  Alon Nilli:
  Short odd cycles in 4-chromatic graphs. J. Graph Theory 31(2): 145-147 (1999)
• 
  Uri N. Peled, Rossella Petreschi, Andrea Sterbini:
  (n, e)-Graphs with maximum sum of squares of degrees. J. Graph Theory 31(4): 283-295 (1999)
• 
  Dieter Rautenbach:
  A linear vizing-like relation between the size and the domination number of a graph. J. Graph Theory 31(4): 297-302 (1999)
• 
  Bruce A. Reed:
  The list colouring constants. J. Graph Theory 31(2): 149-153 (1999)
• 
  Daniel P. Sanders, Yue Zhao:
  On total 9-coloring planar graphs of maximum degree seven. J. Graph Theory 31(1): 67-73 (1999)
• 
  Van H. Vu:
  On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs. J. Graph Theory 31(3): 201-226 (1999)
• 
  Hong Wang:
  On 2-factors of a bipartite graph. J. Graph Theory 31(2): 101-106 (1999)
• 
  Hong Wang:
  Proof of a conjecture on cycles in a bipartite graph. J. Graph Theory 31(4): 333-343 (1999)
• 
  Jian-Liang Wu:
  On the linear arboricity of planar graphs. J. Graph Theory 31(2): 129-134 (1999)
• 
  Igor E. Zverovich, Vadim E. Zverovich:
  A semi-induced subgraph characterization of upper domination perfect graphs. J. Graph Theory 31(1): 29-49 (1999)