Note: The references are not ordered alphabetically!

400 J. Fonlupt, A. Zemirline
A polynomial recognition algorithm of $(K_4-e)$--free perfect graphs
Institut IMAG Rapport Technique RT--16, Fvier 1987 0
401 L.R. Ford, D.R. Fulkerson
Flows in Networks
Princeton University Press, Princeton, N.J. 1962
ZMath 0139.13701
402 J.L. Fouquet, V. Giakoumakis
On semi--$P_4$--sparse graphs
Discrete Math. 165/166 1997 277--300
ZMath 0873.05071
403 J.L. Fouquet, V. Giakoumakis, F. Maire, H. Thuillier
On graphs without $P_5$ and $\overline{P_5}$
Discrete Math. 146 1995 33--44
ZMath 0837.05095
404 J.~L.~Fouquet, F.~Maire, I.~Rusu, H.~Thuillier
On transversals in minimal imperfect grahs
Discrete Math. 165/166 1997 301--312
ZMath 0873.05043
405 J.C. Fournier
Une caract\'erization des graphes des cordes
{\sl C.R. Acad. Sci. Paris, 286A} %%%%in McKMcM steht 286A 1978 811--813
ZMath 0378.05045
406 J.C. Fournier, M. Las Vergnas
Une classe d'hypergraphes bichromatiques
Discrete Math. 2 1972 407--410
ZMath 0247.05127
407 D.R. Fulkerson
Blocking and anti--blocking pairs of polyhedra
Math. Programming 1 1971 168--194
ZMath 0254.90054
408 D.R. Fulkerson
Anti--blocking polyhedra
J. Comb. Theory (B) 12 1972 50--71
ZMath 0227.05015
409 D.R. Fulkerson
On the perfect graph theorem
in: {\sc T.C. Hu, S.M. Robinson} (eds.),{\sl Mathematical Programming},Academic Press, New York 1973 69--76
ZMath 0267.05119
410 D.R. Fulkerson, O.A. Gross
Incidence matrices and interval graphs
Pacific J. Math. 15 1965 835--855
ZMath 0132.21001
411 D.R. Fulkerson, A.J. Hoffman, R. Oppenheim
On balanced matrices
Math. Programming 1 1974 120--132
ZMath 0357.90038
412 C.P. Gabor, W.L. Hsu, K.J. Supowit
Recognizing circle graphs in polynomial time
J. ACM 36 1989 435--474
ZMath 0825.68417
413 H. Galeana-S\'anchez
Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
Discrete Math. 122 1993 167--177
ZMath 0791.05046
414 J. Galil, R. Kannan, E. Szemer\'edi
On nontrivial separators for $k$--page graphs and simulations by nondeterministic one-tape Turing machines
J. Comput. Syst. Sciences 38 1989 134--149
ZMath 0676.68019
415 P. Galinier, M. Habib, C. Paul
Chordal graphs and their clique graphs
Proceedings 21st Intern. Workshop on Graph--Theoretic Concepts in Comp. Sci. 1995 Lecture Notes in Comp. Sci. 1017 1995 358--371
416 T. Gallai
Graphen mit triangulierbaren ungeraden Vielecken
{\sl Magyar Tud. Akad. Mat. Kutado Int. K\"ozl. 7} 1962 3--36
ZMath 0132.21101
417 T. Gallai
Transitiv orientierbare Graphen
Acta Math. Acad. Sci. Hung. 18 1967 25--66
ZMath 0153.26002
418 R. Garbe
Algorithmic Aspects of Interval Orders
Ph. D. Thesis, University of Twente 1994
419 M.R. Garey, R.L. Graham, D.S. Johnson, D.E. Knuth
Complexity results for bandwidth minimization
SIAM J. Appl. Math. 34 1978 477--495
ZMath 0385.05048
420 M.R. Garey, D.S. Johnson
Computers and Intractability -- A Guide to the Theory of \NP--completeness
Freeman and Company, San Francisco 1979
ZMath 0411.68039
421 M.R. Garey, D.S. Johnson, L. Stockmeyer
Some simplified \NP--complete graph problems
Theor. Comp. Sci. 1 1976 237--267
ZMath 0338.05120
422 A. Garg, R. Tamassia
Upward planarity testing
Order 12 1995 109--133
ZMath 0836.68081
423 G.S. Gasparian
Minimal imperfect graphs: a simple approach
Combinatorica 16 1996 209--212
ZMath 0858.05044
424 F. Gavril
Algorithms for a maximum clique and a maximum independent set of a circle graph
Networks 3 1973 261--273
ZMath 0259.05125
425 F. Gavril
The intersection graphs of subtrees in trees are exactly the chordal graphs
J. Comb. Theory (B) 16 1974 47--56
ZMath 0266.05101
426 F. Gavril
Algorithms on circular--arc graphs
Networks 4 1974 357--369
ZMath 0309.05126
427 F. Gavril
A recognition algorithm for the intersection graphs of directed paths in directed trees
Discrete Math. 13 1975 237--249
ZMath 0312.05108
428 F. Gavril
Algorithms on clique separable graphs
Discrete Math. 19 1977 159--165
ZMath 0378.05042
429 F. Gavril
A recognition algorithm for the intersection graphs of paths in trees
Discrete Math. 23 1978 211--227
ZMath 0398.05060
430 F. Gavril
Intersection graphs of proper subtrees of unicyclic graphs
J. Graph Theory 18 1994 615--627
ZMath 0809.05035
431 F. Gavril
Intersection graphs of Helly families of subtrees
Discrete Appl. Math. 66 1996 45--56
ZMath 0856.05084
432 F. Gavril, V. Toledano Laredo, D. de Werra
Chordless paths, odd holes and kernels in graphs without m--obstructions
J. Algorithms 17 207--221 1994
ZMath 0807.05035
433 F. Gavril, J. Urrutia
Intersection graphs of concatenable subtrees of graphs
Discrete Appl. Math. 52 1994 195--209
ZMath 0805.05068
434 A.M.H. Gerards
A short proof of Tutte's characterization of totally unimodular matrices
Linear Algebra and Appl. 114/115 1989 207--212
ZMath 0676.05028
435 S. Ghosh
On recognizing and characterizing visibility graphs of simple polygons
Lecture Notes in Comp. Sci. 318 96--104 1988
ZMath 0871.68175
436 A. Ghouila--Houri
Caract\'erization des graphes non orient\'es dont on peut orienter les arr\^etes de mani\`ere \`a obtenir le graphe d'une relation d'ordre
{\sl C.R. Acad. Sci. Paris}, 254 1962 1370--1371
ZMath 0105.35503
437 V. Giakoumakis
On extended $P_4$--sparse graphs
4th Twente workshop on graphs and combinatorial optimization, 1995
438 V. Giakoumakis
$P_4$--laden graphs: a new class of brittle graphs
Inf. Proc. Letters 60 1996 29--36
ZMath 0875.68475
439 V. Giakoumakis
D\'ecomposition modulaire et probl\`emes d'optimisation
Document de synt\`ese d'activit\'e scientifique pr\'esent\'e en vued'obtenir une habilitation \`a diriger des recherches en Informatique,Universit\'e d'Amiens 1996
440 V. Giakoumakis, F. Roussel, H. Thuillier
On $P_4$--tidy graphs
Discrete Math. and Theor. Comp. Sci. 1 1997 17--41
ZMath 0930.05073
441 V. Giakoumakis, J.-M. Vanherpe
On extended $P_4$--reducible and extended $P_4$--sparse graphs
Theor. Comp. Sci. 180 1997 269--286
ZMath 0893.05017
442 J.R. Gilbert, J.P. Hutchinson, R.E. Tarjan
A separator theorem for graphs of bounded genus
J. Algorithms 5 1984 391--407
ZMath 0556.05022
443 J.R. Gilbert, D.J. Rose, A. Edenbrandt
A separator theorem for chordal graphs
SIAM J. Alg. Discr. Meth. 5 1984 306--313
ZMath 0551.05049
444 R. Giles, L.E. Trotter Jr.
On stable set polyhedra for $K_{1,3}$--free graphs
J. Comb. Theory, Ser. B 31, 313-326 (1981). [ISSN 0095-8956]
ZMath 0494.05032
445 P.C. Gilmore, A.J. Hoffman
A characterization of comparability graphs and of interval graphs
Canad. J. Math. 16 1964 539--548
ZMath 0121.26003
446 J. Gimbel
End vertices in interval graphs
Discrete Appl. Math. 21 1988 257--259
ZMath 0671.05035
447 M. Goemans, D. Williamson
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programing
J. ACM 42 1115--1145 1995
ZMath 0885.68088
448 L. Goh, D. Rotem
Recognition of perfect elimination bipartite graphs
Inf. Proc. Letters 15 1982 179--182
ZMath 0505.68030
449 P.W. Goldberg, M.C. Golumbic, H. Kaplan, R. Shamir
Four strikes against physical mapping of DNA
J. Computational Biology 2 1995 139--152
450 A.J. Goldstein
An efficient and constructive algorithm for testing whether a graph can be embedded in the plane
{\sl Graphs and Combinatorics Conf., Office of Naval ResearchLogistics Proj., Dept. of Math. Princeton Univ., Princeton, N.J.} 1963
451 M.C. Golumbic
The complexity of comparability graph recognition and coloring
Computing 18 1977 199--208
ZMath 0365.05025
452 M.C. Golumbic
Trivially perfect graphs
Discrete Math. 24 1978 105--107
ZMath 0384.05057
453 M.C. Golumbic
Algorithmic Graph Theory and Perfect Graphs
Academic Press, New York 1980
ZMath 0541.05054
454 M.C. Golumbic
Containment graphs and intersection graphs
Tech. Report IBM Israel, TR 88.135 %??????? 1984
455 M.C. Golumbic
Interval Graphs and Related Topics
Discrete Math. 55 1985 113--243
ZMath 0568.05046
456 M.C. Golumbic
Algorithmic aspects of intersection graphs and representation hypergraphs
Graphs and Combinatorics 4 1988 307--321
ZMath 0671.05034
457 M.C. Golumbic, C.F. Goss
Perfect elimination and chordal bipartite graphs
J. Graph Theory 2 1978 155--163
ZMath 0411.05060
458 M.C. Golumbic, R.E. Jamison
Edge and vertex intersections of paths in a tree
Discrete Math. 55 1985 151--159
ZMath 0568.05023
459 M.C. Golumbic, R.E. Jamison
The edge intersection graphs of paths in a tree
J. Comb. Theory (B) 38 1985 8--22
ZMath 0537.05063
460 M.C. Golumbic, H. Kaplan, R. Shamir
Graph sandwich problems
% TR 270/92, {\sl Tel Aviv University} , 1992
ZMath 0838.68054
461 M.C. Golumbic, C.L. Monma
A generalization of interval graphs with tolerances
% Proc. 13th South--Eastern Conf. on Combinatorics, Graph Theory and Computing ,Congressus Numerantium 35 (1982) 1982 321--331
ZMath 0537.05062
462 M.C. Golumbic , C.L. Monma, W.T. Trotter
Tolerance graphs
Discrete Appl. Math. 9 1984 157--170
ZMath 0547.05054
463 M.C. Golumbic, D. Rotem, J. Urrutia
Comparability graphs and intersection graphs
Discrete Math. 43 1983 37--46
ZMath 0502.05050
464 M.C. Golumbic, E.R. Scheinerman
Containment graphs, posets and related classes of graphs
In: Combinatorial Mathematics ({\sc G.S. Bloom} et al., eds.),Ann. N.Y. Acad. Sci. 555 1985 192--204
ZMath 0738.05067
465 M.C. Golumbic, R. Shamir
Complexity and algorithms for reasoning about time: A graph theoretic approach
J. ACM 40 1993 1108--1133
ZMath 0795.68095
466 J.E Goodman, R. Pollack, B. Sturmfels
Coordinate representation of order types requires exponential storage
21st Ann. ACM Sympos. on Theory of Comp. 405--410 1989
467 N. Goodman, O. Shmueli
Syntactic characterization of tree database schemes
J. ACM 30 1983 767--786
ZMath 0625.68077
468 I.M. Gorgos
Characterization of quasitriangulated graphs
Tech. Report University of Kishinev 1982
469 M.H. Graham
On the universal relation
Tech. Report University of Toronto 1979
470 Hac__ne A_t Haddad\`ene, Sylvain Gravier, Fr__d__ric Maffray
An algorithm for coloring some perfect graphs.
Discrete Math. 183, No.1-3, 1-16 (1998). [ISSN 0012-365X]
ZMath 0895.05023
471 C. Greene
Some partitions associated with a partially ordered set.
J. Comb. Theory, Ser. A 20, 69-79 (1976). [ISSN 0097-3165]
ZMath 0323.06002
472 J.R. Griggs, D.B. West
Extremal values of the interval number of a graph
SIAM J. Alg. Discr. Meth. 1 1979 1--7
ZMath 0499.05033
473 P. Grillet
Maximal chains and antichains
Fund. Math. 65 1969 157--167
ZMath 0191.00601
474 C.M. Grinstead
The Strong Perfect Graph Conjecture for a Class of Graphs
Ph. D. Thesis, UCLA, 1978
475 C.M. Grinstead
The perfect graph conjecture for toroidal graphs
In: Topics on Perfect Graphs, {\sc C. Berge, V. Chv\'atal}, eds.,Annals of Discrete Math. 21 1984 97--102
ZMath 0557.05036
476 M. Gr\"otschel, L. Lov\'asz, A. Schrijver
The ellipsoid method and its consequences in combinatorial optimization
Combinatorica 1 169--197, 1981 Corrigendum
ZMath 0539.90078
477 M. Gr\"otschel, L. Lov\'asz, A. Schrijver
Geometric Algorithms and Combinatorial Optimization
Springer, Berlin, 1988
ZMath 0634.05001
478 Y. Gurevich, L. Stockmeyer, U. Vishkin
Solving \NP--hard problems on graphs that are almost trees and an application to facility location problems
J. ACM 31 1984 459--473
ZMath 0629.68042
479 V.A. Gurvich
On repetition--free boolean functions (in Russian)
Usp. Mat. Nauk 32, No.1(193), 183-184 (1977). [ISSN 0042-1316]
ZMath 0349.94046
480 V.A. Gurvich
On the normal forms of positional games
Soviet Math. Dokl. 25 1982 572--574
ZMath 0517.90094
481 V.A. Gurvich
A generalized {\sc Lov\'asz} inequality for perfect graphs
{\sl Russ. Math. Surv.}48 1993 184--185
ZMath 0798.05038
482 V.A. Gurvich
Biseparated graphs are perfect
\RASDM48 1994 134--141
ZMath 0813.05057
483 V.A. Gurvich, S. Hougardy
Partitionable graphs
manuscript, July 1996
484 J. Gustedt
On the pathwidth of chordal graphs
Discrete Appl. Math. 45 1993 233--248
ZMath 0798.68134
485 M. Gutierrez, L. Oubi\~na
Metric characterizations of proper interval graphs and tree--clique graphs
J. Graph Theory 21 1996 199--205
ZMath 0843.05085
486 W. Gutjahr, E. Welzl, G. Woeginger
Polynomial graph colorings
Discrete Appl. Math. 35 , 1992 29--45
ZMath 0761.05040
487 A. Gy\'arf\'as
Problems from the world surrounding perfect graphs
Zastosow. Mat. 19 1987 413--441
ZMath 0718.05041
488 A. Gy\'arf\'as, D. Kratsch, J. Lehel, F. Maffray
Minimal non--neighbourhood--perfect graphs
J. Graph Theory 21 55--66 1996
ZMath 0841.05028
489 A. Gy\'arf\'as, J. Lehel
A Helly type problem in trees
in ``Combinatorial Theory and Applications'' ({\sc P. Erd\H{o}s} et al.,eds.),Colloquia Math. Soc. J\'anos Bolyai 4 1970 571--584
490 A. Gy\'arf\'as, J. Lehel
Effective on--line coloring of $P_5$--free graphs
Combinatorica 11 1991 181--184
ZMath 0751.05039
491 M. Habib
Substitution de structures combinatoires, th\'eorie et algorithmes
Ph. D. Thesis, {\sl Universit\'e Pierre et Marie Curie (Paris VI)} 1981
492 M. Habib, R. Jegou
$N$--free posets as generalizations of series--parallel posets
Discrete Appl. Math. 12 1985 279--291
ZMath 0635.06002
493 M. Habib, D. Kelly, R.H. M\"ohring
Interval dimension is a comparability invariant
Discrete Math. 88 1991 221--229
ZMath 0728.06003
494 M. Habib, M.C. Maurer
On the $X$--join decomposition for undirected graphs
Discrete Appl. Math. 3 1979 198--207
ZMath 0439.05041
495 M. Habib, R.H. M\"ohring
A fast algorithm for recognizing trapezoid graphs and partial orders of interval dimension two
preprint 1988
496 M. Habib, R.H. M\"ohring
Recognition of partial orders with interval dimension two via transitive orientation with side constraints
Tech. Report No. 244/90 TU Berlin 1990
497 M. Habib, R.H. M\"ohring
Treewidth of cocomparability graphs and a new order--theoretic parameter
Order 11 1994 47--60
ZMath 0811.06001
498 M. Habib, M. Morvan, J.--X. Rampon
On the calculation of transitive reduction--closure of orders
Discrete Math. 111 1993 289--303
ZMath 0782.68089
499 M. Habib, R. McConnell, C. Paul, L. Viennot
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing.
Theor. Comput. Sci. 234, No.1-2, 59-84 (2000). [ISSN 0304-3975]
ZMath