Mathematical bibliography of Claude Berge

Berge C., Sur l'isovalence et la régularité des transformateurs. C. R. Acad. Sci. Paris 231 (1950), 1404-   1406.
Berge C., Sur un nouveau calcul symbolique et ses applications. J. Math. Pures Appl. (9) 29 (1950),    245-274.
Berge C., Sur l'inversion des transformateurs. C. R. Acad. Sci. Paris 232 (1951), 134-136.
Berge C., Sur une théorie ensembliste des jeux alternatifs. C. R. Acad. Sci. Paris 232 (1951), 294-296.
Berge C., Sur une théorie ensembliste des jeux alternatifs. J. Math. Pures Appl. (9) 32 (1953), 129-184.
Berge C., Le problème du gain dans la théorie généralisée de jeux sans information. Bull. Soc. Math.    France 81 (1953), 1-8.
Berge C., Sur les ensembles purs et les ultrafiltres. C. R. Acad. Sci. Paris 238 (1954), 2136-2137.
Berge C., Sur une convexité régulière non linéaire et ses applications à la théorie des jeux. Bull. Soc.    Math. France 82 (1954), 301-315.
Berge C., Sur un théorème de la convexité régulière non linéaire. C. R. Acad. Sci. Paris. 238 (1954),    2485-2486.
Berge C., Sur une propriété des matrices doublement stochastiques. C. R. Acad. Sci. Paris 241 (1955),    269-271.
Berge C., Sur une généralisation du théorème de Zermelo-von Neumann. C. R. Acad. Sci. Paris 241    (1955), 455-457.
Berge C., La fonction de Grundy d'un graphe infini. C. R. Acad. Sci. Paris 242 (1956), 1404-1407.
Berge C., Schützenberger M.P., Jeux de Nim et solutions. C. R. Acad. Sci. Paris 242 (1956), 1672-   1674.
Berge C., Sur la déficience d'un réseau infini. C. R. Acad. Sci. Paris 245 (1957), 1206-1208.
Berge C., Topological games with perfect information. Contributions to the theory of games, vol. 3, pp.    165-178. Annals of Mathematics Studies, no. 39. Princeton University Press, Princeton, N. J., 1957.
Berge C., Two theorems in graph theory. Proc. Nat. Acad. Sci. U.S.A. 43 (1957), 842-844.
Berge C., Théorie générale des jeux à n personnes. Mémor. Sci. Math., no. 138. Gauthier-Villars, Paris    1957, 114 pp. (Russian translation, Phi Publications, Moscow 1961).
Berge C., Sur le couplage maximum d'un graphe. C. R. Acad. Sci. Paris 247 (1958), 258-259.
Berge C., Théorie des graphes et ses applications. Collection Universitaire de Mathématiques, II    Dunod, Paris 1958, viii+277 pp. (English edition, Wiley 1961; Methuen & Co, New York 1962;    Russian, Moscow 1961; Spanish, Mexico 1962; Roumanian, Bucharest 1969; Chinese, Shanghai    1963; Second printing of the 1962 first English edition. Dover, New York 2001)
Berge C., Espaces topologiques. Fonctions multivoques. Collection Universitaire de Mathématiques,    Vol. III Dunod, Paris 1959, xi+272 pp. (English edition, Oliver and Boyd, London 1963; reprint of the    1963 translation, Dover Publications, New York 1997)
Berge C., Sur une propriété combinatoire des ensembles convexes. C. R. Acad. Sci. Paris 248 (1959),    2698-2699.
Berge C., Sur l'équivalence du problème du transport généralisé et du problème des réseaux. C. R.    Acad. Sci. Paris 251 (1960), 324-326.
Berge C., Les problèmes de coloration en théorie des graphes. Publ. Inst. Statist. Univ. Paris 9 (1960),    123-160.
Berge C., Les problèmes de flot et de tension. Cahiers Centre Études Rech. Opér. 3 (1961), 69-93.
Berge C., Ghouila-Houri A., Programmes, jeux et réseaux de transport. Dunod, Paris 1962, viii+255    pp. (English translation, Methuen and Wiley, New York 1965; Spanish, C.E.C., Mexico 1965;    German, Teubner, Leipzig 1967; Chinese, Pekin 1969).
Berge C., Théorie des graphes et ses applications. Deuxième édition Dunod. Paris 1963, viii+269 pp.
Berge C., Graph theory. Amer. Math. Monthly 71 (1964) 471-481.
Berge C., Une application de la théorie des graphes à un problème de codage. Automata Theory pp. 25-   34 Academic Press, New York 1966
Berge C., Some classes of perfect graphs. Graph Theory and Theoretical Physics pp. 155-165    Academic Press, London 1967
Berge C., Principes de combinatoire. Dunod, Paris (1968), vi+149 pp. (English edition, Academic    Press, New York-London 1971; Japanese, Tokyo 1970).
Berge C., Une généralisation du théorème de Erdös-Gallai. C. R. Acad. Sci. Paris Sér. A-B 268 (1969),    A1118-A1120; erratum, ibid. 269 (1969), A263.
Berge C., The rank of a family of sets and some applications to graph theory. Recent Progress in    Combinatorics (Proc. Third Waterloo Conf. on Combinatorics, 1968) pp. 49-57 Academic Press,    New York 1969
Berge C., Some classes of perfect graphs. Combinatorial Mathematics and its Applications (Proc. Conf.,    Univ. North Carolina, Chapel Hill, N.C., 1967) pp. 539-552 Univ. North Carolina Press, Chapel Hill,    N.C. 1969
Berge C., Une propriété des graphes k-stables-critiques. Combinatorial Structures and their Applications    (Proc. Calgary Internat. Conf., Calgary, Alta., 1969) pp. 7-11 Gordon and Breach, New York 1970
Berge C., Las Vergnas M., Sur un théorème du type König pour hypergraphes. Ann. New York Acad.    Sci. 175 1970 32-40.
Berge C., Sur certains hypergraphes généralisant les graphes bipartites. Combinatorial theory and its    applications, I (Proc. Colloq., Balatonfüred, 1969), pp. 119-133. North-Holland, Amsterdam, 1970
Berge C., Graphes et hypergraphes Monographies Universitaires de Mathématiques, No. 37. Dunod,    Paris, 1970. xviii+502 pp. (English edition, North-Holland 1973; Japanese, Seshu, Tokyo 1977).
Berge C., Hypergraphs generalizing bipartite graphs. Integer and nonlinear programming, pp. 507-509.    North-Holland, Amsterdam, 1970.
Berge C., Sur une extension de la théorie des matrices bi-stochastiques. Studi di probabilità, statistica e    ricerca operativa in onore di Giuseppe Pompilj, pp. 475-482. Edizioni Oderisi, Gubbio, 971.
Berge C., Rado R., Note on isomorphic hypergraphs and some extensions of Whitney's theorem to    families of sets. J. Combinatorial Theory Ser. B 13 (1972), 226-241.
Berge C., Une condition pour qu'un hypergraphe soit fortement isomorphe à un hypergraphe complet ou    multiparti. C. R. Acad. Sci. Paris Sér. A-B 274 (1972), A1783-A1786.
Berge C., Balanced matrices. Math. Programming 2 (1972), no. 1, 19-31.
Berge C., Alternating chain methods: a survey. Graph theory and computing, pp. 1-13. Academic Press,    New York, 1972.
Berge C., Introduction à la théorie des hypergraphes. Séminaire de Mathématiques Supérieures, No.    51 (Été 1971). Les Presses de l'Université de Montréal, Montreal, Que., 1973, 114 pp.
Berge C., Graphes et hypergraphes. Deuxième édition. Collection Dunod Université, Série Violette,    No. 604. Dunod, Paris-Brussels-Montreal, Que., 1973, xii+516 pp. (English translation, North-    Holland, Amsterdam-New York, 1976).
Berge, C., Balanced hypergraphs and some applications to graph theory. A survey of combinatorial    theory (Proc. Internat. Sympos., Colorado State Univ., Fort Collins, Colo., 1971), pp. 15-23. North-   Holland, Amsterdam, 1973.
Berge C., Note sur les bonnes colorations d'un hypergraphe. Colloque sur la Théorie des Graphes    (Brussels, 1973). Cahiers Centre Études Recherche Opér. 15 (1973), 219-223.
Berge C., Nouvelles extensions du noyau d'un graphe et ses applications en théorie des jeux. Publ.    Économétriques 6 (1973), 6-11.
Aimé Sache, La théorie des graphes, ouvrage collectif sous la direction de C. Berge par des participants    au séminaire de la M.S.H (Maison des Sciences de l'Homme). Collection "Que sais-je ?" no 1554,    P.U.F., Paris 1974, 128 pp.
Berge C., Isomorphism problems for hypergraphs. Combinatorics (Proc. NATO Advanced Study Inst.    Breukelen, 1974), Part 2: Graph theory; foundations, partitions and combinatorial geometry, pp. 3-12.    Math. Centre Tracts, No. 56, Math. Centrum, Amsterdam, 1974.
Berge C., Simonovits M., The coloring numbers of the direct product of two hypergraphs. Hypergraph    Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio, 1972; dedicated to Arnold    Ross), pp. 21-33. Lecture Notes in Math., Vol. 411, Springer, Berlin, 1974.
Berge C., Isomorphism problems for hypergraphs. Hypergraph Seminar (Proc. First Working Sem.,    Ohio State Univ., Columbus, Ohio, 1972; dedicated to Arnold Ross), pp. 1-12. Lecture Notes in    Math., Vol. 411, Springer, Berlin, 1974.
Berge C., Nombres de coloration de l'hypergraphe h-parti complet. Hypergraph Seminar (Proc. First    Working Sem., Ohio State Univ., Columbus, Ohio, 1972; dedicated to Arnold Ross), pp. 13-20.    Lecture Notes in Math., Vol. 411, Springer, Berlin, 1974.
Berge C., On the good k-colorings of a hypergraph. Infinite and finite sets (Colloq., Keszthely, 1973;    dedicated to P. Erdös on his 60th birthday), Vol. I, pp. 159-163. Colloq. Math. Soc. Janos Bolyai,    Vol. 10, North-Holland, Amsterdam, 1975.
Berge C., Nombres de coloration de l'hypergraphe h-parti complet. Ann. Mat. Pura Appl. (4) 103    (1975), 3-9.
Berge C., Duchet P., Une généralisation du théorème de Gilmore. Colloque sur la Théorie des Graphes    (Paris, 1974). Cahiers Centre Études Recherche Opér. 17 (1975), no. 2-4, 117-123.
Berge C., Perfect graphs. Studies in graph theory, Part I, pp. 1-22. Studies in Math., Vol. 11, Math.    Assoc. Amer., Washington, D. C., 1975.
Berge C., Duchet P., A generalization of Gilmore's theorem. Recent advances in graph theory (Proc.    Second Czechoslovak Sympos., Prague, 1974), pp. 49-55. Academia, Prague, 1975.
Berge C., Simonovits M., Colouring numbers of the direct product of two hypergraphs. Proc. Indian Nat.    Sci. Acad. Part A 41 (1975), no. 3, 264-274.
Berge C., A theorem related to the Chvátal conjecture. Proceedings of the Fifth British Combinatorial    Conference (Univ. Aberdeen, Aberdeen, 1975), pp. 35-40. Congressus Numerantium, No. XV,    Utilitas Math., Winnipeg, Man., 1976.
Berge C., Las Vergnas M., Un nouveau jeu positionnel, le "match-it", ou une construction dialectique des    couplages parfaits. Colloque sur la Théorie des Jeux (Bruxelles, 1975). Cahiers Centre Études    Recherche Opér. 18 (1976), no. 1-2, 83-89.
Berge C., Sur les jeux positionnels. Colloque sur la Théorie des Jeux (Brussels, 1975). Cahiers Centre    Études Recherche Opér. 18 (1976), no. 1-2, 91-107.
Berge C., The multicolourings of graphs and hypergraphs. J. Univ. Kuwait Sci. 3 (1976), 1-6.
Berge C., Isomorphism problems for hypergraphs. Colloquio Internazionale sulle Teorie Combinatorie    (Rome, 1973), Tomo II, pp. 335-342. Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome,    1976.
Berge C., Vers une théorie générale des jeux positionnels. Mathematical economics and game theory, pp.    13-24. Lecture Notes in Econ. and Math. Systems, Vol. 141, Springer, Berlin, 1977.
Berge C., Sterboul F., Equipartite colorings in graphs and hypergraphs. J. Combinatorial Theory Ser. B.    22 (1977), no. 2, 97-113.
Berge C., The Helly property. Southeast Asian Bull. Math. 1 (1977), no. 2, 16-19.
Berge C., Johnson Ellis L., Coloring the edges of a hypergraph and linear programming techniques.    Studies in integer programming (Proc. Workshop, Bonn, 1975), pp. 65-78. Ann. of Discrete Math.,    Vol. 1, North-Holland, Amsterdam, 1977.
Berge C., Ramachandra Rao A., A combinatorial problem in logic. Discrete Math. 17 (1977), no. 1, 23-   26.
Berge C., Las Vergnas M., On the existence of subgraphs with degree constraints. Nederl. Akad.    Wetensch. Indag. Math. 40 (1978), no. 2, 165-176.
Berge C., Regularisable graphs. Advances in graph theory (Cambridge Combinatorial Conf., Trinity    Coll., Cambridge, 1977). Ann. Discrete Math. 3 (1978), 11-19.
Berge C., The multicolorings of graphs and hypergraphs. Theory and applications of graphs (Proc.    Internat. Conf., Western Mich. Univ., Kalamazoo, Mich., 1976), pp. 23-36, Lecture Notes in Math.,    642, Springer, Berlin, 1978.
Berge C., Fractional graph theory. ISI Lecture Notes, 1. Macmillan Co. of India, Ltd., New Delhi,    1978. vi+78 pp.
Berge C., Multicoloring of a graph. Polyhedral combinatorics. Math. Programming Stud. No. 8 (1978),    226-234.
Berge C., Multicolorings. Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. I, pp.    121-133, Colloq. Math. Soc. János Bolyai, 18, North-Holland, Amsterdam-New York, 1978.
Berge C., Regularisable graphs. I, II. Discrete Math. 23 (1978), no. 2, 85-89, 91-95.
Berge C., Hoffman A.J., Multicolorations dans les hypergraphes unimodulaires et matrices dont les    coefficients sont des ensembles. (French) Problèmes combinatoires et théorie des graphes (Colloq.    Internat. CNRS, Univ. Orsay, Orsay, 1976), pp. 27-30, Colloq. Internat. CNRS, 260, CNRS, Paris,    1978.
Berge C., Résultats récents sur certaines classes d'hypergraphes qui généralisent les graphes bipartis.    Colloque Mathématiques Discrètes: Codes et Hypergraphes (Brussels, 1978). Cahiers Centre Études    Rech. Opér. 20 (1978), no. 3-4, 243-278.
Berge C., Regularizable graphs. Proceedings of the Symposium on Graph Theory (Indian Statist. Inst.,    Calcutta, 1976), pp. 90-102, ISI Lecture Notes, 4, Macmillan of India, New Delhi, 1979.
Berge C., Packing problems and hypergraph theory: a survey. Discrete optimization (Proc. Adv. Res.    Inst. Discrete Optimization and Systems Appl., Banff, Alta., 1977), I. Ann. Discrete Math. 4 (1979),    3-37.
Berge C., Balanced matrices and property G. Combinatorial optimization. Math. Programming Stud. No.    12 (1980), 163-175.
Berge C., Les graphes d'intervalles. A look at graph theory (Proc. Colloq., Cerisy, 1980) (French), pp.    1-9, Presses Polytech. Romandes, Lausanne, 1980.
Berge C., Some common properties for regularizable graphs, edge-critical graphs and B-graphs. Graph    theory and algorithms (Proc. Sympos., Res. Inst. Electr. Comm., Tohoku Univ., Sendai, 1980), pp.    108-123, Lecture Notes in Comput. Sci., 108, Springer, Berlin-New York, 1981.
Berge C., Chen C.C., Chvátal V., Seow C.S., Combinatorial properties of polyominoes. Combinatorica    1 (1981), no. 3, 217-224.
Berge C., Packing problems. Studies on graphs and discrete programming (Brussels, 1979), pp. 15-21,    Ann. Discrete Math., 11, North-Holland, Amsterdam-New York, 1981.
Berge C., Diperfect graphs. Combinatorics and graph theory (Calcutta, 1980), pp. 1-8, Lecture Notes in    Math., 885, Springer, Berlin-New York, 1981.
Berge C., k-optimal partitions of a directed graph. European J. Combin. 3 (1982), no. 2, 97-101.
Berge C., Les jeux combinatoires. Cahiers Centre Études Rech. Opér. 24 (1982), no. 2-4, 89-105.
Berge C., Diperfect graphs. Combinatorica 2 (1982), no. 3, 213-222.
Berge C., Some common properties for regularizable graphs, edge-critical graphs and B-graphs. Theory    and practice of combinatorics, 31-44, North-Holland Math. Stud., 60, North-Holland, Amsterdam,    1982.
Berge C., Stochastic graphs and strongly perfect graphs - a survey. Southeast Asian Bull. Math. 7    (1983), no. 1, 16-25.
Berge C., Graphes. Third edition. Dunod, Paris, 1983. ix+400 pp. (English, Second revised edition of    part 1 of the 1973 English version, North-Holland, Amsterdam, 1985)
Berge C., Sur le nombre minimum d'arcs à inverser pour rendre un graphe fortement connexe: application    à un problème de trafic. Cahiers Centre Études Rech. Opér. 25 (1983), no. 3-4, 183-186.
Berge C., Path partitions in directed graphs. Combinatorial mathematics (Marseille-Luminy, 1981), 59-   63, North-Holland Math. Stud., 75, North-Holland, Amsterdam, 1983.
Berge C., Las Vergnas M., Transversals of circuits and acyclic orientations in graphs and matroids.    Discrete Math. 50 (1984), no. 1, 107-108.
Berge C., On the minimum number of arcs to reverse to make a graph strongly connected. Graph theory,    Singapore 1983, 31-34, Lecture Notes in Math., 1073, Springer, Berlin, 1984.
Berge C., A property of k-optimal path-partitions. Progress in graph theory (Waterloo, Ont., 1982),    105-108, Academic Press, Toronto, ON, 1984.
Berge C., Minimax theorems for normal hypergraphs and balanced hypergraphs-a survey. Topics on    perfect graphs, 3-19, North-Holland Math. Stud., 88, North-Holland, Amsterdam, 1984.
Berge C., Diperfect graphs. Topics on perfect graphs, 45-56, North-Holland Math. Stud., 88, North-   Holland, Amsterdam, 1984.
Berge C., Duchet P., Strongly perfect graphs. Topics on perfect graphs, 57-61, North-Holland Math.    Stud., 88, North-Holland, Amsterdam, 1984.
Berge C., Stochastic graphs and strongly perfect graphs: a survey. Combinatorics and applications    (Calcutta, 1982), 60-65, Indian Statist. Inst., Calcutta, 1984.
Berge C., Path-partitions in directed graphs and posets. Graphs and order (Banff, Alta., 1984), 447-   464, NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., 147, Reidel, Dordrecht, 1985.
Berge C., New classes of perfect graphs. Applications of combinatorial methods in mathematical    programming (Gainesville, Fla., 1985). Discrete Appl. Math. 15 (1986), no. 2-3, 145-154.
Berge C., Hypergraphes. Combinatoire des ensembles finis. Dunod, Paris 1987, xii+240 pp. (English    translation, North-Holland, Amsterdam, 1989).
Berge C., Duchet P., Recent problems and results about kernels in directed graphs. Applications of    discrete mathematics (Clemson, SC, 1986), 200-204, SIAM, Philadelphia, PA, 1988.
Berge C., Duchet P., Perfect graphs and kernels. Bull. Inst. Math. Acad. Sinica 16 (1988), no. 4, 263-   274.
Berge C., Hypergraphs. Selected topics in graph theory, 3, 189-206, Academic Press, San Diego, CA,    1988.
Berge C., Minimax relations for the partial q-colorings of a graph. Graph colouring and variations.    Discrete Math. 74 (1989), no. 1-2, 3-14.
Berge C., A new color change to improve the coloring of a graph. First Montreal Conference on    Combinatorics and Computer Science, 1987. Discrete Appl. Math. 24 (1989), no. 1-3, 25-28.
Berge C., On the chromatic index of a linear hypergraph and the Chvátal conjecture. Combinatorial    Mathematics: Proceedings of the Third International Conference (New York, 1985), 40-44, Ann. New    York Acad. Sci., 555, New York Acad. Sci., New York, 1989.
Berge C., Hilton A.J.W., On two conjectures about edge-colouring hypergraphs. Proceedings of the    Twentieth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton,    FL, 1989). Congr. Numer. 70 (1990), 99-104.
Berge C., Optimisation and hypergraph theory. European J. Oper. Res. 46 (1990), no. 3, 297-303.
Berge C., Duchet P., Recent problems and results about kernels in directed graphs. Discrete Math. 86    (1990), no. 1-3, 27-31.
Berge C., On two conjectures to generalize Vizing's theorem. Graphs, designs and combinatorial    geometries (Catania, 1989). Matematiche (Catania) 45 (1990), no. 1, 15-23 (1991).
Berge C., Fournier J.-C., A short proof for a generalization of Vizing's theorem. J. Graph Theory 15    (1991), no. 3, 333-336.
Berge C., The q-perfect graphs. I. The case q=2. Sets, graphs and numbers (Budapest, 1991), 67-75,    Colloq. Math. Soc. János Bolyai, 60, North-Holland, Amsterdam, 1992.
Berge C., Les jeux sur un graphe. Cahiers Centre Études Rech. Opér. 34 (1992), no. 2-4, 95-101.
Berge C., The q-perfect graphs. II. Combinatorics 92 (Catania, 1992). Matematiche (Catania) 47    (1992), no. 2, 205-211 (1993).
Berge C., About vertex-critical nonbicolorable hypergraphs. Australas. J. Combin. 9 (1994), 211-219.
Berge C., The q-perfect graphs. Graph theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo,    MI, 1992), 47-62, Wiley-Intersci. Publ., Wiley, New York, 1995.
Berge C., Some properties of non-bicolorable hypergraphs and the four-color problem. First    International Colloquium on Graphs and Optimization (GOI), 1992 (Grimentz). Discrete Appl. Math.    65 (1996), no. 1-3, 73-79.
Berge C., The history of the perfect graphs. Southeast Asian Bull. Math. 20 (1996), no. 1, 5-10.
Berge C., Combinatorial games on a graph. Graph theory and combinatorics (Manila, 1991). Discrete    Math. 151 (1996), no. 1-3, 59-65.
Berge C., Motivations and history of some of my conjectures. Graphs and combinatorics (Marseille,    1995). Discrete Math. 165/166 (1997), 61-70.
Berge C., Fouquet J.-L., On the optimal transversals of the odd cycles. Discrete Math. 169 (1997), no.    1-3, 169-175.
Berge C., Reed B., Edge-disjoint odd cycles in graphs with small chromatic number. Symposium à la    Mémoire de François Jaeger (Grenoble, 1998). Ann. Inst. Fourier (Grenoble) 49 (1999), no. 3, 783-   786.
Berge C., Reed B., Optimal packings of edge-disjoint odd cycles. Discrete Math. 211 (2000), no. 1-3,    197-202.
Berge C., La théorie des graphes. Development of mathematics 1950-2000, 135-147, Birkhäuser,    Basel 2000.
Berge C., Ramírez Alfonsín J.L., Origins and genesis. Perfect graphs, 1-12, Wiley-Intersci. Ser.    Discrete Math. Optim., Wiley, Chichester, 2001.