Note: The references are not ordered alphabetically!

700 J. Krausz
D\'emonstration nouvelle d'une th\'eor\`eme de Whitney sur les r\'eseaux
Math. Fiz. Lapok 50 1943 75--85
ZMath 0061.41401
701 C. Kuratowski
Sur le probleme des corbes gauches en topologie
Fund. Math. 15 1930 271--283
ZMath 56.1141.03
702 C.W.H. Lam, S. Swiercz, L. Thiel, E. Regener
A computer search for $(\alpha,\omega)$--graphs
Numerical mathematics and computing, Proc. 9th Manitoba Conf., 1979, 285- 289 (1980).
ZMath 0439.05021
703 R. Laskar, D. Shier
On powers and centers of chordal graphs
Discrete Appl. Math. 6 1983 139--147
ZMath 0521.05064
704 E.L. Lawler
Graphical algorithms and their complexity
{\sl Math. Centre Tracts 81} 1976 3--32
ZMath 0358.68059
705 E.L. Lawler
Combinatorial Optimization: Networks and Matroids
Holt, Rinehart and Winston 1976
ZMath 0413.90040
706 E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys
The Traveling Salesman Problem
J. Wiley, New York 1990
707 V.B. Le
Transitive Kantenforcierung und perfekte Graphen
Diploma Thesis, TU Berlin 1988
708 V.B. Le
Perfect $k$--line graphs and $k$--total graphs
J. Graph Theory 17 1993 65--73
ZMath 0778.05073
709 V.B. Le
Gallai Graphs and Their Iteration Behavior
Dissertation Thesis, TU Berlin 1994
ZMath 0864.05032
710 V.B. Le
Cycle--perfect graphs are perfect
J. Graph Theory 23 1996 351--353
ZMath 0864.05033
711 V.B. Le
Gallai graphs and anti--Gallai graphs
\DM 159 1996 179--189
ZMath 0864.05031
712 V.B. Le
A good characterization of cograph contractions
J. Graph Theory 30 No.4 309--318 (1999)
ZMath 0922.05045
713 V.B. Le, E. Prisner
Facet graphs of pure simplical complexes and related concepts
Abhandl. Math. Seminar Univ. Hamburg 19 1992
714 B. Leclerc, B. Monjardet
Orders C.A.C
Fundam. Math. 79, 11-22 (1973). [ISSN 0016-2736]
ZMath 0356.06009
715 J. Lehel
Helly hypergraphs and abstract interval structures
1983,Ars Combinatoria 16 A 1983 239--253
ZMath 0555.05053
716 J. Lehel
A characterization of totally balanced hypergraphs
Discrete Math. 57 1985 59--65
ZMath 0579.05041
717 J. Lehel
Neighbourhood--perfect line graphs
Graphs and Combinatorics 10 1994 353--361
ZMath 0811.05049
718 J. Lehel, Z. Tuza
Neighbourhood perfect graphs
Discrete Math. 61 1986 93--101
ZMath 0602.05053
719 P.G.H. Lehot
An optimal algorithm to detect a line graph and output its root graph
J. ACM 21 1974 569--575
ZMath 0295.05118
720 C.E. Leiserson
Area--efficient graph layouts (for VLSI)
Tech. Report CMU-CS-80-138 , {\sl Carnegie-Mellon Univ.} %????? 1978
721 C. Lekkerkerker, D. Boland
Representation of finite graphs by a set of intervals on the real line
Fund. Math. 51 1962 45--64
ZMath 0105.17501
722 A. Lempel, S. Even, I. Cederbaum
An algorithm for planarity testing of graphs
{\sl Theory of Graphs: Int. Symp. Rome}, ({\sc P. Rosenstiehl}, ed.),Gordon and Breach, New York 1966 215--232
ZMath 0197.50204
723 H. Lerchs
On cliques and kernels
Tech. Report {\sl Dept. of Comp. Sci., Univ. of Toronto} 1971
724 H. Lerchs
On the clique--kernel structure of graphs
Tech. Report {\sl Dept. of Comp. Sci., Univ. of Toronto} 1972
725 S.Y.R. Li
Graphic sequences with unique realization
J. Comb. Theory (B) 19 1975 42--68
ZMath 0312.05129
726 R. Lin, S. Olariu
An NC recognition algorithm for cographs
J. of Parallel and Distributed Computing 13 1991 76--90
727 Y.--L. Lin, S.S. Skiena
Algorithms for square roots of graphs
SIAM J. Discr. Math. 8 1995 99--118
ZMath 0821.05052
728 Y.--L. Lin, S.S. Skiena
Complexity aspects of visibility graphs
{\sl International Journal of Computational Geometry} 5 1995 289--312
ZMath 0834.68116
729 R.J. Lipton, R.E. Tarjan
A separator theorem for planar graphs
SIAM J. Appl. Math. 36 1979 177--189
ZMath 0432.05022
730 J. Liu, H. Zhou
Dominating subgraphs in graphs with some forbidden structures
Discrete Math. 135 1994 163--168
ZMath 0812.05052
731 M. Loebl, S. Poljak
A hierarchy of totally unimodular matrices
Discrete Math. 76 241--246 1989
ZMath 0726.05052
732 P.J. Looges, S. Olariu
Optimal greedy algorithms for indifference graphs
Computers Math. Applic. 25 15--25 1993
ZMath 0794.68115
733 L. Lov\'asz
Normal hypergraphs and the perfect graph conjecture
Discrete Math. 2 1972 253--267
ZMath 0239.05111
734 L. Lov\'asz
A characterization of perfect graphs
J. Comb. Theory (B) 13 1972 95--98
ZMath 0241.05107
735 L. Lov\'asz
Combinatorial Problems and Exercises
North--Holland, Amsterdam 1979
ZMath 0439.05001
736 L. Lov\'asz
On the Shannon capacity of a graph
IEEE Trans. Information Theory IT IT-25 1979 1--7
ZMath 0523.94016
737 L. Lov\'asz
Perfect graphs
{\sl Selected Topics in Graph Theory} 2, {\sc L.W. Beineke, R.J. Wilson}eds.,Academic Press, New York 1983 55--87
ZMath 0972.00015
738 L. Lov\'asz
An algorithmic theory of numbers, graphs, and convexity
{\sl CMBS Regional Conf. Series in Appl. Math.} SIAM, 1986 0
ZMath 0606.68039
739 L. Lov\'asz
Stable sets and polynomials
Discrete Math. 124 1994 137--153
ZMath 0792.05082
740 L. Lov\'asz, M.D. Plummer
Matching Theory
Annals of Discrete Mathematics, 29. North-Holland Mathematics Studies, 121. Amsterdam etc.: North-Holland. XXXIII, 544 p. (1986).
ZMath
741 L. Lov\'asz, A. Schrijver
Cones of matrices and set functions, and 0-1 optimization
SIAM J. Optimization 1 1990 166--190
ZMath 0754.90039
742 A. Lubiw
$\Gamma$--free matrices
Masters Thesis, {\sl Dept. of Combin. and Optim., Univ. Waterloo} 1982
743 A. Lubiw
Doubly lexical orderings of matrices
SIAM J. Computing 16 1987 854--879
ZMath 0622.05045
744 A. Lubiw
Short--chorded and perfect graphs
J. Comb. Theory (B) 51 1991 24--33
ZMath 0755.05072
745 A. Lubotzky
Discrete groups, expanding graphs, and invariant measures
Progress in Mathematics 125, Birkh\"auser Verlag, Basel 1995
ZMath 0755.05072
746 A. Lubotzky, R. Phillips, P. Sarnak
Ramanujan graphs
Combinatorica 8 , 1988 261--277
ZMath 1038.05038
747 R.D. Luce
Semiorders and a theory of utility discrimination
Economica 24 1956 178--191
ZMath 0267.90014
748 T.H. Ma
On the threshold dimension 2 graphs
Tech. Report 11529 Inst. of Information Science,Academia Sinica, Nankang, Taipei, Republic of China, 1993 0
749 T.H. Ma, J.P. Spinrad
An ${\cal O}(n^2)$ algorithm for undirected split decomposition
J. Algorithms 16, No.1, 145-160 (1994). [ISSN 0196-6774]
ZMath 0803.68092
750 T.H. Ma, J.P. Spinrad
Cycle--free partial orders and chordal comparability graphs
Order 8 1991 175--183
ZMath 0736.06005
751 T.H. Ma, J.P. Spinrad
On the 2--chain subgraph cover and related problems
J. Algorithms 17 1994 251--268
ZMath 0821.68097
752 P.A. MacMahon
The combination of resistances
{\sl The Electrician} 28 1892 601--602
ZMath 00681640
753 F. Maffray
On kernels in $i$--triangulated graphs
Discrete Math. 61 1986 247--251
ZMath 0617.05029
754 F. Maffray
Kernels in perfect line graphs
J. Comb. Theory (B) 55 1992 1--8
ZMath 0694.05054
755 F. Maffray
Antitwins in partitionable graphs
Discrete Math. 112 1993 275--278
ZMath 0783.05081
756 F. Maffray, O. Porto, M. Preissmann
A generalization of simplicial elimination orderings
J. Graph Theory 23 1996 203--208
ZMath 0871.05020
757 F. Maffray, M. Preissmann
Perfect graphs with no $P_5$ and no $K_5$
Graphs and Combinatorics 10 1994 179--184
ZMath 0806.05052
758 F. Maffray, M. Preissmann
Linear recognition of pseudo--split graphs
Discrete Appl. Math. 52 1994 307--312
ZMath 0805.05069
759 F. Maffray, M. Preissmann
Split--neighbourhood graphs and the strong perfect graph conjecture
J. Comb. Theory (B) 63 1995 294--309
ZMath 0820.05023
760 N.V.R. Mahadev, U.N. Peled
Strict 2--threshold graphs
Discrete Appl. Math. 21 1988 113--131
ZMath 0658.05063
761 N.V.R. Mahadev, U.N. Peled
Threshold Graphs and Related Topics
Annals of Discrete Math. 56 1995
ZMath 0852.05001
762 N.V.R. Mahadev, U.N. Peled, F. Sun
Equistable graphs
J. Graph Theory 18 1994 281--299
ZMath 0794.05112
763 F. Maire
Slightly triangulated graphs are perfect
Graphs and Combinatorics 10 1994 263--268
ZMath 0814.05035
764 F. Maire
Polyominoes and perfect graphs
Inf. Proc. Letters 50 1994 57--61
ZMath 0810.05020
765 M.V. Marathe, H. Breu, H.B. Hunt III, S.S. Ravi, D.J. Rosenkrantz
Simple heuristics for unit disk graphs
Networks 25 1995 59--68
ZMath 0821.90128
766 P. Marchioro, A. Morgana
Structure and recognition of domishold graphs
Discrete Math. 50 1984 239--251
ZMath 0611.05051
767 P. Marchioro, A. Morgana, R. Petreschi, B. Simeone
Degree sequences of matrogenic graphs
Discrete Math. 51 1984 46--61
ZMath 0545.05054
768 E. Marczewski
Sur deux propri\'et\'es des classes d'ensembles
Fund. Math. 33 1945 303--307
ZMath 0060.12508
769 G.A. Margulis
Explicit group-theoretical constructions of combinatorial schemes and their applications to the design of expanders and concentrators
Prob. Peredaci Inf. 24 , 1988 51--60
ZMath 0708.05030
770 S.E. Markosjan, G.S. Gasparian, A.S. Markosjan
On a conjecture of Berge
J. Comb. Theory (B) 56 1992 97--107
ZMath 0728.05029
771 S.E. Markosjan, G.S. Gasparian, B. Reed
$\beta$--perfect graphs
J. Comb. Theory (B) 67 1996 1--11
ZMath 0857.05038
772 S.E. Markosjan, I.A. Karapetjan
On critical imperfect graphs (in Russian)
{\sl Prikladn. Mat.} 3 1984 52--60
773 D.W. Matula
$k$--components, clusters, and slicings in graphs
SIAM J. Appl. Math. 22 1972 459--480
ZMath 0243.05111
774 R.M. McConnell, J. Spinrad
Linear--time modular decomposition and efficient transitive orientation of comparability graphs
% {\sl Dept. of Comp. Sci., University of Colorado at Boulder} ,5th Annual ACM--SIAM Sympos. on Discr. Algorithms (1994) 1993 536--545
ZMath 0867.05068
775 R.M. McConnell, J. Spinrad
Linear--time transitive orientation
8th Annual ACM--SIAM Sympos. on Discr. Algorithms 1997 19--25
776 T.A. McKee
How chordal graphs work
{\sl Bulletin of the ICA} 9 1993 27--39
ZMath 0803.05034
777 T.A. McKee, F.R. McMorris
Topics in Intersection Graph Theory
SIAM Monographs on Discrete Mathematics. and Applications, 2. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. viii, 205 p. (1999). [ISBN 0-89871-430-3]
ZMath 0945.05003
778 F.R. McMorris, D.R. Shier
Representing chordal graphs on $K_{1,n}$
Comment. Math. Univ. Carolin. 24 1983 489--494
ZMath 0536.05054
779 H. Meyniel
The graphs whose odd cycles have at least two chords
In: Topics on Perfect Graphs ({\sc C. Berge, V. Chv\'atal}, eds.),Annals of Discrete Math. 21 1984 115--119
ZMath 0567.05034
780 H. Meyniel
A new property of critical imperfect graphs and some consequences
European J. Combin. 8 1987 313--316
ZMath 0647.05053
781 H. Meyniel, S. Olariu
A new conjecture about minimal imperfect graphs
J. Comb. Theory (B) 47 1989 244--247
ZMath 0634.05048
782 M. Middendorf, F. Pfeiffer
On the complexity of recognizing perfectly orderable graphs
Discrete Math. 80 1990 327--333
ZMath 0706.68058
783 G.J. Minty
On maximal independent sets of vertices in claw--free graphs
J. Comb. Theory (B) 28 1980 284--304
The weighted version of the algorithm has a bug which is corrected in
[1173]
D. Nakamura, A. Tamura
A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph
J. Oper. Res. Soc. Japan 44 (2001) no.2 194-204
. ZMath 0434.05043
784 S.L. Mitchell
Linear algorithms to recognize outerplanar and maximal outerplanar graphs
Inf. Proc. Letters 9 1979 229--232
ZMath 0444.68055
785 R.H. M\"ohring
Algorithmic aspects of comparability graphs and interval graphs
in: {\sl Graphs and Order}, {\sc I. Rival}, ed.,Reidel, Dordrecht 1985 41--101
ZMath 0569.05046
786 R.H. M\"ohring
Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions
Annals of Operations Research 14 1985 195--225
787 R.H. M\"ohring
Computationally tractable classes of ordered sets
in: {\sl Algorithms and Order}, {\sc I. Rival}, ed.,Kluwer Acad. Publ., Dordrecht 1989 105--193
788 R.H. M\"ohring
Graph problems related to gate matrix layout and PLA folding
In: {\sl Computational Graph Theory},Computing Suppl. 7 ({\sc G. Tinhofer, E. Mayr, H. Noltemeier, M. Syslo}, eds.), 1990 17--51
ZMath 0699.68072
789 R.H. M\"ohring
Triangulating graphs without asteroidal triples
Discrete Appl. Math. 64 1996 281--287
ZMath 0856.68112
790 R.H. M\"ohring, F.J. Radermacher
Substitution decomposition for discrete structures and connections with combinatorial optimization
Annals of Discrete Math. 19 1984 257--356
ZMath 0567.90073
791 B. Mohar, S. Poljak
Eigenvalues in combinatorial optimization
IMA Volumes in Mathematics and its Applications, Vol. 50({\sc R. Brualdi, S. Friedland, V. Klee}, eds.), Springer, Berlin 0 (1993) 108
ZMath 0806.90104
792 B. Monien
The bandwidth minimization problem for caterpillars with hair length 3 is \NP--complete
SIAM J. Alg. Discr. Meth. 7 1986 505--512
ZMath 0624.68059
793 C.L. Monma, B. Reed, W.T. Trotter, Jr.
A generalization of threshold graphs with tolerances
Congressus Numerantium 55 1986 187--197
ZMath 0646.05062
794 C.L. Monma, B. Reed, W.T. Trotter, Jr.
Threshold tolerance graphs
J. Graph Theory 12 1988 343--362
ZMath 0652.05059
795 C.L. Monma, V.K. Wei
Intersection graphs of paths in a tree
J. Comb. Theory (B) 41 1986 141--181
ZMath 0682.05028
796 J.W. Moon
The number of labelled $k$--trees
J. Comb. Theory 6 1969 196--199
ZMath 0175.50203
797 M. Moscarini
Alpha--graphs, Steiner trees and connected domination
manuscript 1987 0
798 M. Moscarini
Doubly chordal graphs, Steiner trees and connected domination
Networks 23 1993 59--69
ZMath 0771.05076
799 R. Motwani, M. Sudan
Computing roots of graphs is hard
Discrete Appl. Math. 54 1994 81--88
ZMath 0812.68103