Note: The references are not ordered alphabetically!
| 900 |
A. Raychaudhuri On powers of strongly chordal and circular arc graphs Ars Combinatoria 34 1992 147--160 ZMath 0770.05066 |
| 901 |
B. Reed A semi--strong perfect graph theorem Ph. D. Thesis, McGill University, Qu\'ebec, 1986 ZMath 0647.05052 |
| 902 |
B. Reed A semi--strong perfect graph theorem J. Comb. Theory $(B)$ 43 1987 223--240 ZMath 0647.05052 |
| 903 |
B. Reed, N. Sbihi Recognizing bull--free perfect graphs Graphs and Combinatorics 11 1995 171--178 ZMath 0832.05039 |
| 904 |
J.H. Reif Polynomial time recognition of grahs of fixed genus unpublished manuscript |
| 905 |
J. Reiterman, V. R\"odl, E. \v{S}inajov\'a Geometrical embeddings of graphs Discrete Math. 74 1989 291--319 ZMath 0684.05018 |
| 906 |
P.L. Renz Intersection representation of graphs by arcs Pacific J. Math. 34 1970 501--510 ZMath 0191.55103 |
| 907 |
J. Riordan, C.E. Shannon The number of two--terminal series--parallel networks J. Math. and Physics 21 83 1942 |
| 908 |
F.S. Roberts Indifference graphs {\sl Proof Techniques in Graph Theory},{\sc F.Harary}, ed.,Academic Press, New York 1969 139--146 ZMath 0193.24205 |
| 909 |
F.S. Roberts On the boxicity and cubicity of a graph Recent Progress in Combinatorics, W.T. Tutte, ed., Academic Press, New York 1969 301--310 ZMath 0193.24301 |
| 910 |
F.S. Roberts, J.H. Spencer A characterization of clique graphs J. Comb. Theory $(B)$ 10 1971 102--108 ZMath 0215.05801 |
| 911 |
N. Robertson, P.D. Seymour Graph minors. I. Excluding a forest J. Comb. Theory $(B)$ 35 1983 39--61 ZMath 0521.05062 |
| 912 |
N. Robertson, P.D. Seymour Graph minors. III. Planar tree--width J. Comb. Theory $(B)$ 36 1984 49--64 ZMath 0548.05025 |
| 913 |
N. Robertson, P.D. Seymour Graph width and well--quasi ordering: a survey {\sl Progress in Graph Theory},{\sc J. Bondy, U. Murty}, eds.,Academic Press, New York 1984 399--406 ZMath 0566.05052 |
| 914 |
N. Robertson, P.D. Seymour Graph minors -- a survey {\sl Surveys in Combinatorics},{\sc I. Anderson}, ed.,Cambridge University Press 1985 153--171 ZMath 0568.05025 |
| 915 |
N. Robertson, P.D. Seymour Graph minors. II. Algorithmic aspects of tree width J. Algorithms 7 1986 309--322 ZMath 0611.05017 |
| 916 |
N. Robertson, P.D. Seymour Graph minors. V. Excluding a planar graph J. Comb. Theory $(B)$ 41 1986 92--114 ZMath 0598.05055 |
| 917 |
N. Robertson, P.D. Seymour Graph minors. VI. Disjoint paths across a disc J. Comb. Theory $(B)$ 41 1986 115--138 ZMath 0598.05042 |
| 918 |
N. Robertson, P.D. Seymour Graph minors. VII. Disjoint paths on a surface J. Comb. Theory $(B)$ 45 1988 212--254 ZMath 0658.05044 |
| 919 |
N. Robertson, P.D. Seymour Graph minors. IV. Tree--width and well--quasi--ordering J. Comb. Theory $(B)$ 48 1990 227--254 ZMath 0719.05032 |
| 920 |
N. Robertson, P.D. Seymour Graph minors. IX. Disjoint crossed paths J. Comb. Theory $(B)$ 49 1990 40--77 ZMath 0741.05044 |
| 921 |
N. Robertson, P.D. Seymour Graph minors. VIII. A Kuratowski theorem for general surfaces J. Comb. Theory $(B)$ 48 1990 255--288 ZMath 0719.05033 |
| 922 |
N. Robertson, P.D. Seymour Graph minors. X. Obstructions to tree--decomposition J. Comb. Theory $(B)$ 52 1991 153--190 ZMath 0764.05069 |
| 923 |
N. Robertson, P.D. Seymour Graph minors. XI: Circuits on a surface. J. Comb. Theory, Ser. B 60, No.1, 72-106 (1994). [ISSN 0095-8956] ZMath 0799.05016 |
| 924 |
N. Robertson, P.D. Seymour Graph minors XIII. The disjoint paths problem J. Comb. Theory $(B)$ 63 1995 65--110 ZMath 0823.05038 |
| 925 |
N. Robertson, P.D. Seymour Graph minors. XIV. Extending an embedding J. Comb. Theory $(B)$ 65 1995 23--50 ZMath 0840.05017 |
| 926 |
N. Robertson, P.D. Seymour Graph minors. XV. Giant steps J. Comb. Theory $(B)$ 68 1996 112--148 ZMath 0860.05023 |
| 927 |
N. Robertson, P.D. Seymour Graph minors. XIV. Taming a vertex manuscript 1987 ZMath 1027.05088 |
| 928 |
N. Robertson, P.D. Seymour Graph minors. XVI. Excluding a non--planar graph manuscript 1991 %?????? 0 ZMath 1023.05040 |
| 929 |
D.J. Rose Triangulated graphs and the elimination process J. Math. Analys. Appl. 32 1970 597--609 ZMath 0216.02602 |
| 930 |
D.J. Rose On simple characterizations of $k$--trees Discrete Math. 7 1974 317--322 ZMath 0285.05128 |
| 931 |
D.J. Rose, R.E. Tarjan, G.S. Lueker Algorithmic aspects of vertex elimination on graph SIAM J. Computing 5 1976 266--283 ZMath 0353.65019 |
| 932 |
A. Rosenberg Interval hypergraphs {\sl Contemporary Math.}89 1989 27--44 ZMath 0682.68059 |
| 933 |
I.C. Ross, F. Harary The square of a tree {\sl Bell System Tech. J.}39 1960 641--647 |
| 934 |
D. Rotem, J. Urrutia Circular permutation graphs % {\sl Res. Rep. Univ. Waterloo} 0 ZMath 0508.05060 |
| 935 |
F. Roussel, I. Rusu An ${\cal O}(m^2+mn)$ algorithm to recognize Meyniel graphs ODSA'97 workshop, Rostock, September 1997 0 |
| 936 |
N.D. Roussopoulos A ${\cal O}(\max\{m,n\}) algorithm for determining the graph H from its line graph $G$ Inf. Proc. Letters 2 1973 108--112 ZMath 0274.05116 |
| 937 |
I. Rusu A new class of perfect Ho\`ang graphs Discrete Math. 145 1995 279--285 ZMath 0833.05033 |
| 938 |
I. Rusu Quasi--parity and perfect graphs Inf. Proc. Letters 54 1995 35--39 ZMath 0875.68686 |
| 939 |
I. Rusu Building counter examples Discrete Math. 171 1997 213--227 ZMath 0874.05024 |
| 940 |
H.J. Ryser Combinatorial configurations SIAM J. Appl. Math. 17 1969 593--602 ZMath 0186.01901 |
| 941 |
G. Sabidussi The composition of graphs Duke Math. J. 26 1959 693--696 ZMath 0095.37802 |
| 942 |
G. Sabidussi Graph multiplication Math. Zeitschr. 72 1960 446--457 ZMath 0093.37603 |
| 943 |
G. Sabidussi Graph derivatives Math. Zeitschr. 76 1961 385--401 ZMath 0109.16404 |
| 944 |
H. Sachs On the Berge conjecture concerning perfect graphs {\sl Combin. Structure and their Applic.},Gordon and Breach, New York 1970 377--384 ZMath 0247.05116 |
| 945 |
H. Sachs Coin graphs, polyhedra and conformal mapping Discrete Math. 134 1994 133--138 ZMath 0808.05043 |
| 946 |
A. Sassano Chair--free Berge graphs are perfect % Tech. Report 10.95 {\sl Universit\`a di Roma} , 1995 \GrCom 13 ZMath 0891.05054 |
| 947 |
N. Sbihi Algorithme de recherche d'un stable de cardinalit\'e maximum dans un graphe sans \'etoile Discrete Math. 29 1980 53--76 ZMath 0444.05049 |
| 948 |
A. A. Sch\"affer Recognizing brittle graphs: remarks on a paper of Ho\`ang and Khouzam Discrete Appl. Math. 31 1991 29--35 ZMath 0737.05071 |
| 949 |
A.A. Sch\"affer A faster algorithm to recognize undirected path graphs Discrete Appl. Math. 43 1993 261--295 ZMath 0770.68096 |
| 950 |
P. Scheffler The graphs of tree--width $k$ are exactly the partial $k$--trees manuscript 1986 |
| 951 |
P. Scheffler Linear--time algorithms for \NP--complete problems restricted to partial $k$--trees Tech. Report R-MATH-03/87 IMATH Berlin 1987 ZMath 0629.68043 |
| 952 |
P. Scheffler Die Baumweite von Graphen als ein Ma\ss{} f\"ur die Kompliziertheit algorithmischer Probleme Dissertation Thesis, {\sl Akad. d. Wiss. Berlin, Report R-MATH-04/89} 1989 ZMath 0684.68061 |
| 953 |
P. Scheffler, D. Seese Graphs of bounded tree--width and linear--time algorithms manuscript 1986 %????? 0 |
| 954 |
E.R. Scheinerman Intersection classes and multiple intersection parameters of a graph Ph. D. Thesis, Princeton University 1984 |
| 955 |
E.R. Scheinerman Characterizing intersection classes of graphs Discrete Math. 55 1985 185--193 ZMath 0597.05056 |
| 956 |
E.R. Scheinerman On the structure of hereditary classes of graphs J. Graph Theory 10 1986 545--551 ZMath 0609.05057 |
| 957 |
E.R. Scheinerman A note on planar graphs and circle orders SIAM J. Discr. Math. 4 1991 447--450 ZMath 0735.05033 |
| 958 |
E.R. Scheinerman A note on graphs and sphere orders J. Graph Theory 93/1 0 283--289 ZMath 0781.05016 |
| 959 |
E.R. Scheinerman, A. Trenk On generalized perfect graphs: bounded degree and bounded edge perfection Discrete Appl. Math. 44 1993 233--245 ZMath 0790.05028 |
| 960 |
E.R. Scheinerman, J.C. Weirman On circle containment orders Order 4 1988 315--318 ZMath 0667.06002 |
| 961 |
E.R. Scheinerman, D.B. West The interval number of a planar graph: Three intervals suffice J. Comb. Theory $(B)$ 35 1983 224--239 ZMath 0528.05053 |
| 962 |
W. Schnyder Planar graphs and poset dimension Order 5 1989 323--343 ZMath 0675.06001 |
| 963 |
A. Seb\H{o} Forcing colorations, intervals and the perfect graph conjecture In: {\sc R. Kannan, E. Balas, G. Cornu\'ejols}, eds., Integer Programmingand Combinatorial Optimization II, Carnegie Mellon University Press,Pittsburgh, 1992 0 |
| 964 |
A. Seb\H{o} The connectivity of minimal imperfect graphs J. Graph Theory 23 1996 77--85 ZMath 0859.05058 |
| 965 |
A. Seb\H{o} On critical edges in minimal imperfect graphs. J. Comb. Theory $(B)$ 67 1996 62--85 ZMath 0855.05062 |
| 966 |
D. Seese Tree--partite graphs and the complexity of algorithms Conf. on Foundat. of Comput. Theory FCT'85,Lecture Notes in Comp. Sci. 199 1985 412--421 ZMath 0574.68036 |
| 967 |
D. Seese Tree--partite graphs and the complexity of algorithms Tech. Report {\sl Akad. d. Wiss. R-MATH-8/86 Berlin} 1986 ZMath 0574.68036 |
| 968 |
D. Seinsche On a property of the class of $n$--colorable graphs J. Comb. Theory $(B)$ 16 1974 191--193 ZMath 0269.05103 |
| 969 |
P.D. Seymour Decomposition of regular matroids J. Comb. Theory $(B)$ 28 1980 305--359 ZMath 0443.05027 |
| 970 |
F.B. Shepherd Near--perfect matrices Math. Programming 64 1994 295--323 ZMath 0804.05036 |
| 971 |
T. Shermer Recent results in art galleries {\sl Proceedings of the IEEE} 80 1992 |
| 972 |
L.N. Shevrin, N.D. Filippov Partially ordered sets and their comparability graphs Siber. Math. J. 11 1970 497--509 ZMath 0214.23303 |
| 973 |
Y. Shibata On the tree representation of chordal graphs J. Graph Theory 12 1988 421--428 ZMath 0654.05022 |
| 974 |
Y. Shibata, A. Ishijima On the minimum tree representation of chordal graphs {\sl The Transact. of the IEICE, Vol. E 71, No. 3} 1988 203--204 |
| 975 |
D.R. Shier Some aspects of perfect elimination orderings in chordal graphs Discrete Appl. Math. 7 1984 325--331 ZMath 0537.05069 |
| 976 |
S. Shinoda, Y. Kajitani, K. Onaga, W. Mayeda Various characterization of series--parallel graphs Proceedings 1979 ISCHS 1979 100--103 |
| 977 |
R.W. Shirey Implementation and analysis of efficient graph planarity testing algorithms Ph. D. Thesis, {\sl Univ. of Wisconsin} 1969 |
| 978 |
G. Sierksma, H. Hoogeveen Seven criteria for integer sequences being graphic J. Graph Theory 15 1991 223--231 ZMath 0752.05052 |
| 979 |
F.W. Sinden Topology of thin film RC--circuits {\sl Bell System Tech. J.} 1966 1639--1662 ZMath 0189.24003 |
| 980 |
D.J. Skrien A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs. J. Graph Theory 6, 309-316 (1982). [ISSN 0364-9024] ZMath 0495.05027 |
| 981 |
D.J. Skrien, J. Gimbel Homogeneously representable interval graphs Discrete Math. 55 1985 213--216 ZMath 0579.05054 |
| 982 |
P.J. Slater A characterization of soft hypergraphs Canad. Math. Bull. 21 1978 335--337 ZMath 0391.05042 |
| 983 |
V.P. Soltan $d$--convexity in graphs Soviet Math. Dokl. 28 1983 419--421 ZMath 0553.05060 |
| 984 |
V.P. Soltan Introduction To The Axiomatic Theory of Convexity (in Russian) {\sl Stiin\c ta, Chi\c sin\u au} 1984 |
| 985 |
V.P. Soltan, V.D. Chepoi Conditions for invariance of set diameters under $d$--convexification in a graph Cybernetics $($the English translation of Kibernetika$)$ 19 1983 750--756 ZMath 0564.05037 |
| 986 |
V.P. Soltan, V.D. Chepoi $d$--convex sets in chordal graphs {\sl Math. Research} (Chi\c sin\u au) 78 1984 105--124 |
| 987 |
L. \v{S}olt\'es Forbidden induced subgraphs for line graphs Discrete Math. 132 1994 391--394 ZMath 0805.05072 |
| 988 |
S. Sorg Die $P_4$-Struktur von Kantengraphen bipartiter Graphen {\it Diploma thesis}, Mathematisches Institut der Universit\"at zu K\"oln . 1997 |
| 989 |
J.P. Spinrad Two--Dimensional Partial Orders Ph. D. Thesis, {\sl Dept. of EECS, Princeton University, N.J.} 1982 |
| 990 |
J.P. Spinrad On comparability and permutation graphs SIAM J. Computing 14 1985 658--670 ZMath 0568.68051 |
| 991 |
J.P. Spinrad Recognition of circle graphs J. Algorithms 16 1994 264--282 ZMath 0797.68130 |
| 992 |
J.P. Spinrad Doubly lexical ordering of dense 0-1 matrices % {\sl manuscript, Vanderbilt University Nashville, TN} Inf. Proc. Letters 45 (1993) 1988 229--235 ZMath 0771.68068 |
| 993 |
J.P. Spinrad Circular--arc graphs with clique cover number two J. Comb. Theory $(B)$ 44 1988 300--306 ZMath 0596.05042 |
| 994 |
J.P. Spinrad Finding large holes Inf. Proc. Letters 39 1991 227--229 ZMath 0735.68069 |
| 995 |
J.P. Spinrad Representations of graphs book manuscript 1997 |
| 996 |
J.P. Spinrad, A. Brandst\"adt, L.K. Stewart Bipartite permutation graphs Discrete Appl. Math. 18 1987 279--292 ZMath 0628.05055 |
| 997 |
J.P. Spinrad, R. Sritharan Algorithms for weakly triangulated graphs Discrete Appl. Math. 59 1995 181--191 ZMath 0827.68084 |
| 998 |
N. Srinivasan, J. Opatrny, V.S. Alagar Bigeodetic graphs Graphs and Combinatorics 4 1988 379--392 ZMath 0657.05064 |
| 999 |
R. Sritharan A linear time algorithm to recognize circular permutation graphs Networks 27 1996 171--174 ZMath 0853.05073 |