Note: The references are not ordered alphabetically!

800 H. M\"uller
Recognizing interval digraphs and interval bigraphs in polynomial time
Twente workshop 1995,to appear in Discrete Appl. Math. 0
ZMath 0890.68103
801 H. M\"uller
On edge perfectness and classes of bipartite graphs
Discrete Math. 149 1996 159--187
ZMath 0844.68095
802 A. Mukhopadhyay
The square root of a graph
J. Comb. Theory 2 1967 290--295
ZMath 0153.26001
803 H.M. Mulder
The interval function of a graph
{\sl Math. Centre Tracts 132 (Math. Centrum, Amsterdam)} 1980
ZMath 0446.05039
804 H.M. Mulder
Interval--regular graphs
Discrete Math. 41 1982 253--269
ZMath 0542.05051
805 J.H. Muller
Local structure in graph classes
Ph. D. Thesis, Georgia Institute of Technology 1988
806 J.H. Muller, J. Spinrad
Incremental modular decomposition
J. ACM 36 1989 1--19
ZMath 0671.68030
807 W. Naji
Reconnaissance des graphes de cordes
Discrete Math. 54 %%%in McKMcM96/1 steht European J. Combin. 5 (1984) 223--238 1985 329--337
ZMath 0567.05033
808 P.S. Neeralagi, E. Sampathkumar
The neighbourhood number of a graph
Indian J. Pure Appl. Math. 16 1985 126--132
ZMath 0564.05052
809 F. Nicolai
Strukturelle und algorithmische Aspekte distanz--erblicher Graphen und verwandter Klassen
Dissertation Thesis, Gerhard-Mercator-Universit\"at Duisburg, 1994 0
810 F. Nicolai
A hypertree characterization of distance--hereditary graphs
Manuscript, {\sl Gerhard-Mercator-Universit\"at Duisburg}, 1996 0
811 M.V. Nirkhe
Efficient algorithms for circular--arc containment graphs
Masters Thesis, .Tech. Report SRC 87--211, University of Maryland, Systems research Center 1987
812 T. Nishizeki
Topological study on network interconnections
Ph. D. Thesis, 1974
813 T. Nishizeki, N. Chiba
Planar Graphs: Theory and Algorithms
Annals of Discrete Math. 32 1988
ZMath 0647.05001
814 T. Nishizeki, N. Saito
Necessary and sufficient condition for a graph to be three--terminal series--parallel
IEEE Trans. Circ. Syst. CAS--22--8 1975 648--653
815 T. Nishizeki, N. Saito
Necessary and sufficient condition for a graph to be three--terminal series--parallel--cascade
J. Comb. Theory (B) 24 1978 344--361
ZMath 0321.05106
816 R. Nowakowski, I. Rival
The smallest graph variety containing all paths
Discrete Math. 43 1983 223--234
ZMath 0511.05059
817 R. Nowakowski, P. Winkler
Vertex-to-vertex pursuit in a graph
Discrete Math. 43 1983 235--239
ZMath 0508.05058
818 O. Oellermann, J.P. Spinrad
A polynomial algorithm for testing whether a graph is 3--Steiner distance hereditary
Inf. Proc. Letters 55 149--154 1995
819 S. Olariu
Results on perfect graphs
Ph. D. Thesis, {\sl School of Computer Science, McGill Univ., Montreal} 1986
820 S. Olariu
Note: No antitwins in minimal imperfect graphs
J. Comb. Theory (B) 45 1988 255--257
ZMath 0653.05038
821 S. Olariu
All variations on perfectly orderable graphs
J. Comb. Theory (B) 45 1988 150--159
ZMath 0663.05029
822 S. Olariu
Paw--free graphs
Inf. Proc. Letters 28 1988 53--54
ZMath 0661.05058
823 S. Olariu
On the strong perfect graph conjecture
J. Graph Theory 12 1988 169--176
ZMath 0671.05036
824 S. Olariu
Coercion classes in unbreakable graphs
Ars Combinatoria 25 B 1988 153--180
ZMath 0661.05040
825 S. Olariu
Weak bipolarizable graphs
Discrete Math. 74 1989 159--171
ZMath 0666.05062
826 S. Olariu
Wings and perfect graphs
Discrete Math. 80 1990 281--296
ZMath 0661.05059
827 S. Olariu
A decomposition for strongly perfect graphs
J. Graph Theory 13 1989 301--311
ZMath 0661.05056
828 S. Olariu
A generalization of Chv\'atal's star--cutset lemma
Inf. Proc. Letters 33 (1989/90) 0 301--303
ZMath 0745.05059
829 S. Olariu
On the structure of unbreakable graphs
J. Graph Theory 15 1991 349--373
ZMath 0739.05065
830 S. Olariu
On the homogeneous representation of interval graphs
J. Graph Theory 15 1991 65--80
ZMath 0739.05083
831 S. Olariu
An optimal greedy heuristic to color interval graphs
Inf. Proc. Letters 37 65--80 1991
ZMath 0711.68083
832 S. Olariu
On sources in comparability graphs, with applications
Discrete Math. 110 1992 289--292
ZMath 0767.05090
833 S. Olariu
Quasi--brittle graphs, a new class of perfectly orderable graphs
Discrete Math. 113 1992 143--153
ZMath 0771.05093
834 S. Olariu, J. Randall
Welsh--Powell opposition graphs
Inf. Proc. Letters 31 1989 43--46
ZMath 0664.05022
835 E. Olaru
\"Uber die \"Uberdeckung von Graphen mit Cliquen
Wiss. Zeitschr. Techn. Hochschule Ilmenau 15 1969 115--121
ZMath 0197.50401
836 E. Olaru
Zur Charakterisierung perfekter Graphen
Elektron. Inf.verarb. u. Kybern. 9 1973 543--548
ZMath 0275.05109
837 E. Olaru
Zur Theorie der perfekten Graphen
J. Comb. Theory (B) 23 1977 94--105
ZMath 0424.05044
838 E. Olaru
On strongly perfect graphs and the structure of critically--imperfect graphs
{\sl Anal. St. Univ. Iasi} T. II, Informatica 1993 45--59
ZMath 0837.05099
839 E. Olaru
The structure of imperfect critically strongly--imperfect graphs
Discrete Math. 156 1996 299--302
ZMath 0857.05081
840 E. Olaru, H. Sachs
Contributions to a characterization of the structure of perfect graphs
In: Topics on Perfect Graphs ({\sc C. Berge, V. Chv\'atal}, eds.),Annals of Discrete Math. 21 1984 121--144
ZMath 0559.05054
841 O. Ore
Theory of Graphs
{\sl Amer. Math. Soc. Colloqu. Publ. 38, Providence RI} 1962
ZMath 0105.35401
842 J. O'Rourke
Art Gallery Theorems and Algorithms
Oxford University Press, New York 1987
ZMath 0653.52001
843 J. O'Rourke
Recovery of convexity from visibility graphs
Tech. Report 90.4.6, Smith College, 1990 0
844 J. O'Rourke
Computational geometry column 18
{\sl International Journal of Computational Geometry Applications} 3 107-113 0 1993
ZMath 0771.68106
845 J. O'Rourke
Visibility
467-480,({\sc J.E. Goodman, J. O'Rourke}, eds.), {\sl CRC Press LLC},Boca Raton, 1997 0
ZMath 0907.68195
846 M.W. Padberg
Perfect zero--one matrices
Math. Programming 6 1974 180--196
ZMath 0284.90061
847 M.W. Padberg
Almost integral polyhedra related to certain combinatorial optimization problems
Linear Algebra and Appl. 15 1976 69--88
ZMath 0362.90077
848 M.W. Padberg
A characterization of perfect matrices
Annals of Discrete Math. 21 1984 169--178
ZMath 0564.05039
849 M.W. Padberg
Total unimodularity and the Euler subgraph problem
Oper. Res. Letters 7 1988 173--179
ZMath 0652.90075
850 R. Paige, R.E. Tarjan
Three partition refinement algorithms
SIAM J. Computing 16 1987 973--989
ZMath 0654.68072
851 B.S. Panda
New linear time algorithms for generating perfect elimination orderings of chordal graphs
Inf. Proc. Letters 58 1996 111--115
ZMath 0875.68470
852 B.S. Panda, S.P. Mohanty
Recognition algorithm for intersection graphs of edge disjoint paths in a tree
Inf. Proc. Letters 49 1994 139--143
ZMath 0790.05084
853 C.H. Papadimitriou, M. Yannakakis
Scheduling interval ordered tasks
SIAM J. Computing 8 1979 405--409
ZMath 0421.68040
854 A. Parra Asensio
Eine Klasse von Graphen, in der jeder Toleranzgraph ein beschraenkter Toleranzgraph ist
Abhandl. Math. Seminar Univ. Hamburg 64 1994 125--129
ZMath 0818.05051
855 A. Parra Asensio
Triangulating multitolerance graphs
Discrete Appl. Math. 84 (1998) 183-197
ZMath 0908.05067
856 A. Parra Asensio
Structural and Algorithmic Aspects of Chordal Graph Embeddings
\Diss\, TU Berlin FB Mathematik 1996
857 A. Parra Asensio, P. Scheffler
How to use the minimal separators of a graph for its chordal triangulation
Tech. Report 407/1994 TU Berlin FB Mathematik ,Proceedings 22nd Internat. Colloqu. on Automata, Languages and Programming ICALP'95, Lecture Notes in Comp. Sci. 944 (1995) ({\sc Z. F\"ul\"op, F. G\'ecseg}, eds.) 1994 123--134
858 A. Parra Asensio, P. Scheffler
Treewidth equals bandwidth for AT--free claw--free graphs
{\sl TR 436/1995 TU Berlin FB Mathematik} 1995
859 A. Parra, P. Scheffler
Characterizations and algorithmic applications of chordal graph embeddings
Discrete Appl. Math. 79 171--188 1997
ZMath 0887.05044
860 K.R. Parthasarathy, G. Ravindra
The strong perfect-graph conjecture is true for $K_{1,3}$-free graphs.
J. Comb. Theory, Ser. B 21, 212-223 (1976). [ISSN 0095-8956]
ZMath 0297.05109
861 K.R. Parthasarathy, G. Ravindra
The validity of the strong perfect graph conjecture for $(K_4 - e)$--free graphs
J. Comb. Theory (B) 26 1979 98--100
ZMath 0416.05062
862 C. Payan
A class of threshold and domishold graphs: equistable and equidominating graphs
Discrete Math. 29 1980 47--52
ZMath 0542.05050
863 C. Payan
Perfectness and Dilworth number
Discrete Math. 44 1983 229--230
ZMath 0518.05053
864 I. Pe'er, R. Shamir
Interval graphs with side (and size) constraints
{\sc P. Spirakis}, ed.,European Sympos. on Algorithms ,Lecture Notes in Comp. Sci. 979, 1995 142--154
865 I. Pe'er, R. Shamir
Realizing interval graphs with side and distance constraints
manuscript 1995, Tel Aviv University 0
866 U.N. Peled
Matroidal graphs
Discrete Math. 20 1977 263--286
ZMath 0373.05057
867 U.N. Peled, B. Simeone
Box--threshold graphs
J. Graph Theory 8 1984 331--345
ZMath 0537.05054
868 S. Perz, S. Polewicz
Norms and perfect graphs
Methods Mod. Operat. Research 34 1990 13--27
ZMath 0745.05060
869 E. Pesch
Retracts of graphs
Athenaeum Verlag, Frankfurt/M. 1988
ZMath 0684.05038
870 E. Pesch, W. Poguntke
A characterization of absolute retracts of $n$--chromatic graphs
Discrete Math. 57 1985 99--104
ZMath 0594.05033
871 D. Peterson
Gridline graphs: A review in two dimensions and an extension to higher dimensions.
Discrete Appl. Math. 126, No.2-3, 223-239 (2003). [ISSN 0166-218X]
http://rutcor.rutgers.edu/pub/rrr/reports95/03.ps
ZMath 1009.05118
872 R. Petreschi, A. Sterbini
Recognizing strict 2--threshold graphs in ${\cal O}(m)$ time
Inf. Proc. Letters 54 1995 193--198
873 R.E. Pippert, L.W. Beineke
Characterizations of 2--dimensional trees
{\sl The Many Facets of Graph Theory}, {\sc G. Chartrand, F. Kapoor}, eds.,Springer, Berlin 1969, 0 250--257
ZMath 0186.27801
874 A. Pnueli, A. Lempel, S. Even
Transitive orientation of graphs and identification of permutation graphs
Canad. J. Math. 23 1971 160--175
ZMath 0204.24604
875 T. Poston
Fuzzy geometry
Ph. D. Thesis, {\sl University of Warwick} 1971
876 M. Preissmann
A class of strongly perfect graphs
Discrete Math. 54 1985 117--120
ZMath 0568.05043
877 M. Preissmann
Locally perfect graphs
J. Comb. Theory (B) 50 1990 22--40
ZMath 0649.05057
878 M. Preissmann, D. de Werra
A note on strongly perfectness of graphs
Math. Programming 31 1985 321--326
ZMath 0587.05028
879 M. Preissmann, D. de Werra, N.V.R. Mahadev
A note on superbrittle graphs
Discrete Math. 61 1986 259--267
ZMath 0602.05035
880 E. Prisner
Tree representation of chordal graphs and the weighted clique graph
unpublished manuscript 1986 0
881 E. Prisner
Convergence of iterated clique graphs
Discrete Math. 103 1992 199--207
ZMath 0766.05096
882 E. Prisner
A common generalization of line graphs and clique graphs
J. Graph Theory 18 1994 301--313
ZMath 0797.05067
883 E. Prisner
Clique covering and clique partition in generalizations of line graphs
Discrete Appl. Math. 56 1995 93--98
ZMath 0810.05062
884 E. Prisner
Line graphs and generalizations -- A survey
% Tech. Report 651 Clemson University , 1996
ZMath 0906.05061
885 H.J. Pr\"omel, A. Steger
Almost all Berge graphs are perfect
Comb. Prob. Comp. 1 1992 53--79
ZMath 0793.05063
886 M. Quest, G. Wegner
Characterizations of the graphs with boxicity $\le$ 2
Discrete Math. 81 1990 187--192
ZMath 0725.05070
887 A. Quilliot
Homomorphismes, points fixes dans les graphes, les ensembles ordonn\'es et les espaces m\'etriques
Ph. D. Thesis, These de Doctorat d'Etat, Universit\'e de Paris VI} 1983
888 A. Quilliot
Circular representation problem on hypergraphs
Discrete Math. 51 1984 251--264
ZMath 0548.05047
889 A. Quilliot
On the problem of how to represent a graph taking into account an additional structure
J. Comb. Theory (B) 44 1988 1--21
ZMath 0643.05053
890 I. Rabinovitch
The dimension of semiorders
J. Comb. Theory (A) 25 1978 50--61
ZMath 0378.06001
891 I. Rabinovitch
An upper bound on the ``dimension of interval orders''
J. Comb. Theory (A) 25 1978 68--71
ZMath 0378.06002
892 A. Rajaram, H. Balakrishnan, C. Pandu Rangan
Modular decomposition techniques for distance--hereditary graphs
manuscript 1994 0
893 S.B. Rao, G. Ravindra
A characterization of perfect total graphs
J. Math. Phys. Sci. 11 1977 25--26
ZMath 0373.05058
894 T. Raschle, K. Simon
Recognition of graphs with threshold dimension two
Proceedings Ann. ACM Sympos. on Theory of Comp. 1995 68--71
ZMath 0920.05063
895 T. Raschle, K. Simon
On the $P_4$--components of graphs
Tech. Report ETH Z\"urich 1997
ZMath 0942.05057
896 G. Ravindra
Strongly perfect line graphs and total graphs.
Finite and infinite sets, 6th Hung. Combin. Colloq., Eger/Hung. 1981, Vol. II, Colloq. Math. Soc. J\'anos Bolyai 37, 621-633 (1984).
ZMath 0579.05055
897 G. Ravindra
Meyniel graphs are strongly perfect
J. Comb. Theory (B) 33 1982 187--190
ZMath 0498.05055
898 K.T. Rawlinson, R.C. Entringer
Class of graphs with restricted neighbourhoods
J. Graph Theory 3 1979 257--262
ZMath 0417.05034
899 A. Raychaudhuri
On powers of interval and unit interval graphs
Congressus Numerantium 59 1987 235--242
ZMath 0642.05051