Claude Berge

6.2k total citations · 4 hit papers
53 papers, 3.5k citations indexed

About

Claude Berge is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Pathology and Forensic Medicine. According to data from OpenAlex, Claude Berge has authored 53 papers receiving a total of 3.5k indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computational Theory and Mathematics, 9 papers in Discrete Mathematics and Combinatorics and 6 papers in Pathology and Forensic Medicine. Recurrent topics in Claude Berge's work include Advanced Graph Theory Research (13 papers), Limits and Structures in Graph Theory (9 papers) and Graph Labeling and Dimension Problems (7 papers). Claude Berge is often cited by papers focused on Advanced Graph Theory Research (13 papers), Limits and Structures in Graph Theory (9 papers) and Graph Labeling and Dimension Problems (7 papers). Claude Berge collaborates with scholars based in France, Switzerland and United States. Claude Berge's co-authors include Elizna Burger, Frank Harary, Hans‐Peter Stoll, Anthony Gershlick, Chaim Lotan, Ashok Seth, Philip Urban, Giulio Guagliumi, J. Eduardo Sousa and Joachim Schöfer and has published in prestigious journals such as Proceedings of the National Academy of Sciences, Circulation and SHILAP Revista de lepidopterología.

In The Last Decade

Claude Berge

50 papers receiving 3.0k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

The Theory of Graphs and Its Applications

1965 579 citations Claude Berge et al. profile →
Graphes et hypergraphes

1970 468 citations Claude Berge profile →
The Theory of Graphs and its Applications.

1963 373 citations Claude Berge et al. profile →
Théorie des graphes et ses applications

1958 230 citations Claude Berge profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Claude Berge France	20	1.7k	588	497	462	447	53	3.5k
Richard J. Lipton United States	38	3.1k 1.8×	184 0.3×	2.0k 4.0×	216 0.5×	689 1.5×	142	7.3k
Michel Deza France	22	1.1k 0.6×	613 1.0×	272 0.5×	559 1.2×	648 1.4×	153	3.4k
Peter L. Hammer United States	35	1.9k 1.1×	123 0.2×	593 1.2×	138 0.3×	317 0.7×	122	4.0k
Kazuo Murota Japan	34	1.7k 1.0×	179 0.3×	613 1.2×	117 0.3×	386 0.9×	215	4.1k
Jack Edmonds Canada	20	3.4k 2.0×	468 0.8×	2.0k 4.0×	632 1.4×	1.1k 2.5×	42	6.9k
Oliver Gross Switzerland	13	617 0.4×	137 0.2×	239 0.5×	110 0.2×	124 0.3×	46	1.5k
Nathan Linial Israel	38	3.5k 2.1×	802 1.4×	2.3k 4.6×	913 2.0×	721 1.6×	159	6.8k
Sanjeev Arora United States	15	1.1k 0.7×	100 0.2×	369 0.7×	48 0.1×	207 0.5×	23	2.8k
Gordon Royle Australia	21	975 0.6×	812 1.4×	2.0k 4.1×	926 2.0×	797 1.8×	88	4.8k
Michael J. Todd United States	34	3.2k 1.9×	78 0.1×	602 1.2×	35 0.1×	874 2.0×	134	7.6k

Countries citing papers authored by Claude Berge

Since Specialization

Citations

This map shows the geographic impact of Claude Berge's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Claude Berge with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Claude Berge more than expected).

Fields of papers citing papers by Claude Berge

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Claude Berge. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Claude Berge. The network helps show where Claude Berge may publish in the future.

Co-authorship network of co-authors of Claude Berge

This figure shows the co-authorship network connecting the top 25 collaborators of Claude Berge. A scholar is included among the top collaborators of Claude Berge based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Claude Berge. Claude Berge is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Davies, Andrew, Francesco Merli, Biljana Mihaljević, et al.. (2017). Efficacy and safety of subcutaneous rituximab versus intravenous rituximab for first-line treatment of follicular lymphoma (SABRINA): a randomised, open-label, phase 3 trial. The Lancet Haematology. 4(6). e272–e282. 83 indexed citations

2.

Davies, Andrew, Claude Berge, Anjum Dadabhoy, et al.. (2017). Subcutaneous Rituximab for the Treatment of B-Cell Hematologic Malignancies: A Review of the Scientific Rationale and Clinical Development. Advances in Therapy. 34(10). 2210–2231. 41 indexed citations

3.

Berge, Claude. (1996). Combinatorial games on a graph. Discrete Mathematics. 151(1-3). 59–65.

4.

Berge, Claude. (1996). Some properties of non-bicolorable hypergraphs and the four-color problem. Discrete Applied Mathematics. 65(1-3). 73–79. 1 indexed citations

5.

Berge, Claude. (1994). About vertex-critical non-bicolorable hypergraphs.. Australas. J Comb.. 9. 211–220. 1 indexed citations

6.

Berge, Claude. (1993). The q-perfect graphs. Le Matematiche. 47(2). 205–211. 1 indexed citations

7.

Berge, Claude, et al.. (1991). A short proof for a generalization of Vizing's theorem. Journal of Graph Theory. 15(3). 333–336. 15 indexed citations

8.

Berge, Claude. (1990). On two conjectures to generalize Vizing's Theorem. SHILAP Revista de lepidopterología. 6 indexed citations

9.

Berge, Claude. (1987). Hypergraphes : combinatoire des ensembles finis. Gauthier-Villars eBooks. 12 indexed citations

10.

Berge, Claude. (1986). New classes of perfect graphs. Discrete Applied Mathematics. 15(2-3). 145–154. 4 indexed citations

11.

Berge, Claude. (1983). Combinatorial mathematics : proceedings of the International Colloquium on Graph Theory and Combinatorics, Marseille-Luminy, June 1981. Elsevier eBooks. 1 indexed citations

12.

Berge, Claude & Michel Las Vergnas. (1978). On the existence of subgraphs with degree constraints. Indagationes Mathematicae (Proceedings). 81(2). 165–176. 3 indexed citations

13.

Berge, Claude & Michel Las Vergnas. (1978). On the existence of subgraphs with degree constraints. Indagationes Mathematicae (Proceedings). 81(1). 165–176. 11 indexed citations

14.

Berge, Claude & D. R. Fulkerson. (1975). Studies in graph theory. 23 indexed citations

15.

Berge, Claude & D.K. Ray-Chaudhuri. (1974). Hypergraph seminar : Ohio State University, 1972. Springer eBooks. 7 indexed citations

16.

Berge, Claude. (1973). Introduction à la théorie des hypergraphes. Presses de l’Université de Montréal eBooks. 3 indexed citations

17.

Berge, Claude, et al.. (1967). Lectures on graph theory. 50 indexed citations

18.

Berge, Claude. (1966). Espaces topologiques : fonctions multivoques. Dunod eBooks. 213 indexed citations

19.

Berge, Claude. (1960). Les problèmes de coloration en théorie des graphes. SPIRE - Sciences Po Institutional REpository. 4 indexed citations

20.

Berge, Claude. (1957). Théorie générale des jeux à $n$ personnes. CERN Document Server (European Organization for Nuclear Research). 33 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact