Note: The references are not ordered alphabetically!

300 D. Degiorgi
A new linear algorithm to detect a line graph and output its root graph
Tech. Report 148, ETH Z\"urich, Inst. f\"ur Theoretische Informatik 1990
301 X. Deng, P. Hell, J. Huang
Linear time representation algorithms for proper circular arc graphs and proper interval graphs
SIAM J. Computing 25 1996 390--403
ZMath 0858.05094
302 J.S. Deogun, D. Kratsch
Diametral path graphs
Intern. Workshop on Graph--Theoretic Concepts in Comp. Sci. WG'95, {\sc M. Nagl}, ed., Lecture Notes in Comp. Sci. 1017, 344--357
303 U. Derigs, O. Goecke, R. Schrader
Bisimplicial edges, Gaussian elimination and matchings in bipartite graphs
Intern. Workshop on Graph--Theoretic Concepts in Comp. Sci. {\sl Trauner Verlag, Berlin, W. Germany}, 1984 79--87
304 C. De Simone, A. Galluccio
New classes of Berge perfect graphs
Discrete Math. 131 1994 67--79
ZMath 0807.05058
305 C.~De Simone, J.~K\"orner
On the road to perfection: normal graphs
manuscript, 1996 0
306 C.~De Simone, C.~Mannino
Easy instances of the plant location problem
manuscript, 1996 0
307 C. De Simone, A. Sassano
Stability number of bull-- and chair--free graphs
Discrete Appl. Math. 41 1993 121--129
ZMath 0773.05070
308 W.~Deuber, X.~Zhu
Circular colorings of weighted graphs
J. Graph Theory 23 1996 365--376
ZMath 0870.05018
309 D. de Werra
On line perfect graphs
Math. Programming 15 1978 236--238
ZMath 0384.05058
310 D. de Werra
On some characterizations of totally unimodular matrices
Math. Programming 20 1981 14--21
ZMath 0449.15013
311 D. de Werra, A.Hertz
On perfectness of sums of graphs
Technical Report O.R.W.P. 87/13 and 97/06, Dept. de Math\'ematiques,Ecole Polytechnique F\'ed\'erale de Lausanne, 1987, 1997 0
ZMath 0935.05049
312 R. Diestel
Simplicial decomposition of graphs -- some uniqueness results
J. Comb. Theory (B) 42 1987 133--145
ZMath 0582.05045
313 R. Diestel
Graph Decompositions. A Study in Infinite Graph Theory
Oxford: Clarendon Press. xviii, 222 p. (1990). [ISBN 0-19-853210-5]
ZMath 0726.05001
314 P.F. Dietz
Intersection graph algorithms
Ph. D. Thesis, {\sl Comp. Sci. Dept., Cornell Univ. Ithaka, N.Y.} 1984
315 R.P. Dilworth
A decomposition theorem for partially ordered sets
{\sl Ann. Math. Ser. 251} 1950 161--166
ZMath 0038.02003
316 G. Ding
Recognizing the $P_4$--structure of a tree
Graphs and Combinatorics 10 1994 323--328
ZMath 0812.05014
317 G. Dirac
On rigid circuit graphs
Abhandl. Math. Seminar Univ. Hamburg 25 1961 71--76
ZMath 0098.14703
318 G. Dirac
A property of $4$-chromatic graphs and some remarks on critical graphs
J. London Math. Soc. 27 1952 71--76
ZMath 0046.41001
319 H.N. Djidjev
A separator theorem
{\sl CR Acad. Bulgar. sci.}34 1981 643--645
ZMath 0478.68063
320 D. Dobkin, H. Edelsbrunner
Searching for empty convex polygons
Algorithmica 5 561--571 1990
ZMath 0697.68034
321 J.--P. Doignon
On realizable biorders and the biorder dimension of a relation
J. Math. Psychology 28 1984 73--109
ZMath 0562.92018
322 F.F. Dragan
Centers of graphs and the Helly property
Dissertation Thesis, Moldova State University Chi\c sin\u au 1989
ZMath yes
323 F.F. Dragan
Conditions of coincidence of the local and global minima of the eccentricity function on graphs and the Helly property, (in Russian)
{\sl Res. in Appl. Math. and Inform.} Chi\c sin\u au, Moldova 1990 49--56
ZMath 0769.05081
324 F.F. Dragan
HT--graphs: centers, connected $r$--domination and Steiner trees
Comput. Sci. J. of Moldova 1 1993 64--83
325 F.F. Dragan
On greedy matching ordering and greedy matchable graphs. (Extended abstract).
M\"ohring, Rolf H. (ed.), Graph-theoretic concepts in computer science. 23rd international workshop, WG '97, Berlin, Germany, June 18--20, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1335, 184-198 (1997). [ISBN 3-540-63757-5; ISSN 0302-9743]
ZMath 0890.68093
326 F.F. Dragan
Strongly orderable graphs
Discrete Appl. Math. 99 (2000) 427-442
327 F.F. Dragan, A. Brandst\"adt
$r$--Dominating cliques in graphs with hypertree structure
\DM 162 1996 93--108
ZMath 0870.05038
328 F.F. Dragan, F. Nicolai
LexBFS--orderings of distance--hereditary graphs
Schriftenreihe des Fachbereichs Mathematik der Universit\"at Duisburg SM--DU--303, 1995 0
329 F.F. Dragan, F. Nicolai
LexBFS--orderings and powers of HHD--free graphs
Schriftenreihe des Fachbereichs Mathematik der Universit\"at Duisburg SM--DU--322, 1996 0
ZMath 0934.05110
330 F.F. Dragan, F. Nicolai, A. Brandst\"adt
Convexity and HHD--free graphs
% 5th International Colloqu. ''Graphes et Combinatoire'', 0
ZMath 0916.05060
331 F.F. Dragan, F. Nicolai, A. Brandst\"adt
Powers of HHD--free graphs
Schriftenreihe des Fachbereichs Mathematik der Universit\"at Duisburg SM--DU--315 . To appear in Intern. J. Computer Math. 1995
ZMath 1018.05092
332 F.F. Dragan, C.F. Prisacaru, V.D. Chepoi
Location problems in graphs and the Helly property (in Russian) (1987)
(appeared partially in Diskretnaja Matematika 4 67--73) 1992
333 F.F. Dragan, V.I. Voloshin
Incidence graphs of biacyclic hypergraphs
Discrete Appl. Math. 68 1996 259--266
ZMath 0863.05060
334 P. Duchet
Propri\'et\'e de Helly et probl\`emes de repr\'esentation
Probl\`emes combinatoires et th\'eorie des graphes, Orsay 1976, Colloq. int. CNRS No.260, 117-118 (1978).
ZMath 0413.05042
335 P. Duchet
Representations, noyaux en th\'eorie des graphes et hypergraphes
Doct. Diss. Univ. Paris 6 1979
336 P. Duchet
Classical perfect graphs
Annals of Discrete Math. 21 1984 67--96
337 P. Duchet
Parity graphs are kernel--$m$--solvable
J. Comb. Theory (B) 43 1987 121--126
ZMath 0675.05063
338 P. Duchet
Convex sets in graphs II: minimal path convexity
J. Comb. Theory (B) 44 1988 307--316
ZMath 0672.52001
339 P. Duchet
Hypergraphs
In: Handbook of Combinatorics ({\sc R.L. Graham} et al.,eds.)Elsevier, Amsterdam Vol. 1 1995 381--432
ZMath 0859.05063
340 P. Duchet, H. Meyniel
Ensemble convexes dans les graphes. I: Th\'eoremes de Helly et de Radon pour graphes et surfaces.
Eur. J. Comb. 4, 127-132 (1983). [ISSN 0195-6698]
ZMath 0523.05031
341 P. Duchet, S. Olariu
Graphes parfaitement ordonnables g\'en\'eralises
Discrete Math. 90 1991 99--101
ZMath 0743.05043
342 R.J. Duffin
Topology of series--parallel networks
J. Math. Analys. Appl. 10 1965 303--318
ZMath 0128.37002
343 D. Duffus, M. Ginn, V. R\"odl
On the computational complexity of ordered subgraph recognition
Random Structures Algorithms 7 1995 223--268
ZMath 0834.68052
344 D. Duffus, R.J. Gould, M.S. Jacobson
Forbidden subgraphs and the Hamiltonian theme.
The theory and applications of graphs, 4th int. Conf., Kalamazoo/Mich. 1980, 297-316 (1981).
ZMath 0466.05049
345 R. Duke
Types of cycles in hypergraphs
Annals of Discrete Math. 27 1985 399--418
ZMath 0581.05041
346 B. Dushnik, E.W. Miller
Partially ordered sets
Amer. J. Math. 63 1941 600--610
ZMath 0841.06001
347 C. Ebenegger, P.L. Hammer, D. de Werra
Pseudo--Boolean functions and stability of graphs
Annals of Discrete Math. 19 1984 83--98
ZMath 0567.05031
348 G. Ehrlich, S. Even, R.E. Tarjan
Intersection graphs of curves in the plane
J. Comb. Theory (B) 21 1976 8--20
ZMath 0348.05113
349 H. El-Gindy
Hierarchical decomposition of polygons with applications
Ph.D. Thesis, McGill University, Montreal 1985
350 C.C. Elgot, J.B. Wright
Series--parallel graphs and lattices
Duke Math. J. 26 325 1959
ZMath 0086.16303
351 E.S. Elmallah, C.J. Colbourn
Partial $k$--tree algorithms
Congressus Numerantium 64 1988 105--119
ZMath 0668.68076
352 E.S. Elmallah, L.K. Stewart
Independence and domination in polygon graphs
Discrete Appl. Math. 44 1993 65--77
ZMath 0785.68072
353 E.S. Elmallah, L.K. Stewart
Polygon graph recognition
J. Algorithms 26 1998 101--140
ZMath 0891.68068
354 D. Eppstein
Parallel recognition of series parallel graphs
Information and Computation 98 1992 41--55
ZMath 0754.68056
355 P. Erd\H{o}s, T. Gallai
Graphen mit Punkten vorgeschriebenen Grades.\par Graphs with points of prescribed degree
Math. Lapok 11 1960 264--272
ZMath 0103.39701
356 P. Erd\H{o}s, A. Goodman, L. P\'osa
The representation of a graph by set intersection
Canad. J. Math. 18 1966 106--112
357 F. Escalante
\"Uber iterierte Clique--Graphen
Abhandl. Math. Seminar Univ. Hamburg 39 1973 59--68
ZMath 0266.05116
358 E.M. Eschen, R. Hayward, J.P. Spinrad, R. Sritharan
Weakly triangulated comparability graphs
manuscript 1997
ZMath 0937.05070
359 E.M. Eschen, J.P. Spinrad
An ${\cal O}(n^2)$ algorithm for circular--arc graph recognition
Ramachandran, Vijaya (ed.), Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 128-137 (1993). [ISBN 0-89871-313-7]
ZMath 0801.68128
360 E.M. Eschen, R. Sritharan
A characterization of some graph classes with no long holes
J. Comb. Theory (B) 65 1995 156--162
ZMath 0842.05074
361 S. Even
Graph algorithms
Computer Science Press, Potomac, Maryland 1979
ZMath 0900.68258
362 S. Even, A. Itai
Queues, stacks and graphs
{\sl Theory of Machines and Computations} ({\sc Z. Kohavi, A. Paz}, eds.),Academic Press, New York 1971 71--86
ZMath 0764.05093
363 S. Even, A. Pnueli, A. Lempel
Permutation graphs and transitive graphs
J. ACM 19 1972 400--410
ZMath 0251.05113
364 H. Everett
Visibility Graph Recognition
Ph. D. Thesis, University of Toronto, 1990 0
365 H. Everett, D. Corneil
Recognizing visibility graphs of spiral polygons
J. Algorithms 11 1--26 1990
ZMath 0694.68030
366 H. Everett, D. Corneil
Negative results on characterizing visibility graphs
{\sl Computational Geometry} 5 51--63 1995
ZMath 0831.68111
367 H.~Everett, C.M.H.~de~Figueiredo, C.~Linhares-Sales, F.~Maffray, O.~Porto, B.A.~Reed
Path parity and perfection
Discrete Math. 165/166 1997 233--252
ZMath 0879.05053
368 H.~Everett, S.~Klein, B.~Reed
An algorithm for finding homogeneous pairs
Discrete Appl. Math. 72 1997 209--218
ZMath 0874.05052
369 H. Everett, A. Lubiw, J. O'Rourke
Recovery of convex hulls from external visibility graphs
manuscript, Smith College, 1991 0
370 R. Fagin
Degrees of acyclicity for hypergraphs and relational database schemes
J. ACM 30 1983 515--550
ZMath 0624.68088
371 R. Fagin
Acyclic database schemes of various degrees: a painless introduction
{\sl CAAP 83, 8th Colloqu. on Trees in Algebra and Programming},{\sc G. Ausiello, M. Protasi}, eds.,Lecture Notes in Comp. Sci. 159 1983 65--89
ZMath 0528.68073
372 M. Farber
Applications of linear programming duality to problems involving independence and domination
Tech. Report 81-31, Dept. of Comp. Sci., Simon Fraser Univ. Canada Ph. D. Thesis, Rutgers University 1982
373 M. Farber
Characterizations of strongly chordal graphs
Discrete Math. 43 1983 173--189
ZMath 0514.05048
374 M. Farber
Domination, independent domination, and duality in strongly chordal graphs.
Discrete Appl. Math. 7 1984 115--130
ZMath 0531.05045
375 M. Farber
Bridged graphs and geodesic convexity
Discrete Math. 66 1987 249--257
ZMath 0651.05043
376 M. Farber, R.E. Jamison
Convexity in graphs and hypergraphs
SIAM J. Alg. Discr. Meth. 7 1986 433--444
ZMath 0591.05056
377 M. Farber, R.E. Jamison
On local convexity in graphs
Discrete Math. 66 1987 231--247
ZMath 0619.05032
378 R. Faudree, E. Flandrin, Z. Ryj\'a\v{c}ek
Claw--free graphs -- a survey
Discrete Math. 164 87--147 1997
ZMath 0879.05043
379 T. Feder, P. Hell, J. Huang
List homomorphisms and circular arc graphs
manuscript 1996 0
ZMath 0985.05048
380 J. Feigenbaum
Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
Discrete Appl. Math. 15 1986 105--110
ZMath 0637.05018
381 J. Feigenbaum, J. Hershberger, A.A. Sch\"affer
A polynomial time algorithm for finding the prime factors of Cartesian product graphs
Discrete Appl. Math. 12 1985 123--138
ZMath 0579.68028
382 J. Feigenbaum, A.A. Sch\"affer
Recognizing composite graphs is equivalent to testing graph isomorphism
SIAM J. Computing 15 1986 619--627
ZMath 0602.68033
383 S. Felsner
Tolerance graphs and orders
J. Graph Theory 28 129--140 1998
ZMath 0921.05053
384 S. Felsner, P.C. Fishburn, W.T. Trotter
Finite three dimensional partial orders which are not sphere orders
manuscript 1997
ZMath 0941.06005
385 S. Felsner, V. Raghavan, J. Spinrad
Recognition algorithms for orders of small width and graphs of small Dilworth number
manuscript 1998
386 C.M. Fiduccia, E.R. Scheinerman, A. Trenk, J.S. Zito
Dot product representations of graphs
Discrete Math. 181 113--138 1998
ZMath 0974.05058
387 I.S. Filotti, G.I. Miller, J. Reif
On determining the genus of a graph in ${\cal O}(|V|)^{{\cal O}(g)}$ steps
11th Ann. ACM \STOC, New York 1979 27--37
388 P.C. Fishburn
Interval Orders and Interval Graphs
J. Wiley, New York 1985
389 P.C. Fishburn
Interval orders and circle orders
Order 5 1989 225--234
ZMath 0663.06003
390 P.C. Fishburn, W.T. Trotter
Angle orders
Order 1 1985 333--343
ZMath 0558.06003
391 C. Flament
Hypergraphes arbor\'es
Discrete Math. 21 1978 223--226
ZMath 0393.05039
392 C. Flotow
Potenzen von Graphen
Dissertation Thesis, {\sl Universit\"at Hamburg} 1995
ZMath 0831.05057
393 C. Flotow
On powers of $m$--trapezoid graphs
Discrete Appl. Math. 63 1995 187--192
ZMath 0839.05091
394 C. Flotow
On powers of circular arc graphs and proper circular arc graphs
Discrete Appl. Math. 69 1996 199--207
ZMath 0857.05030
395 S. F\"oldes, P.L. Hammer
Split graphs
8th South--Eastern Conf. on Combinatorics, Graph Theory and Computing ({\sc F. Hoffman} et al., eds.) Louisiana StateUniv. Baton Rouge, Louisiana ,Congressus Numerantium 19 (1977) 1977 311--315
ZMath 0407.05071
396 S. F\"oldes, P.L. Hammer
Split graphs having Dilworth number two
Canad. J. Math. 29 1977 666--672
ZMath 0335.05130
397 S. F\"oldes, P.L. Hammer
On a class of matroid producing graphs
{\sl Combinatorics} 76, 1 \CollMSJB({\sc A. Hajnal, V.T. S\'os}, eds.) 1978 331--352
ZMath 0395.05021
398 S. F\"oldes, P.L. Hammer
The Dilworth number of a graph
Annals of Discrete Math. 2 1978 211--219
ZMath 0389.05048
399 J. Fonlupt, J.P. Uhry
Transformations which preserve perfection and H--perfection of graphs
Annals of Discrete Math. 16 1982 83--85
ZMath 0502.05023