default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaude Berge 0001
Person information
- affiliation: Centre de Mathématique Sociale, Paris, France
Other persons with the same name
- Claude Berge 0002 — F. Hoffmann-La Roche Ltd., Basel, Switzerland
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2000 – 2009
- 2000
[j24]Claude Berge, Bruce A. Reed:
Optimal packings of edge-disjoint odd cycles. Discret. Math. 211: 197-202 (2000)
1990 – 1999
- 1997
- [j23]Claude Berge:
Motivations and history of some of my conjectures. Discret. Math. 165-166: 61-70 (1997) - [j22]Claude Berge, Jean-Luc Fouquet:
On the optimal transversals of the odd cycles. Discret. Math. 169(1-3): 169-175 (1997) - 1996
- [j21]Claude Berge:
Some Properties of Non-bicolorable Hypergraphs and the Four-color Problem. Discret. Appl. Math. 65(1-3): 73-79 (1996) - [j20]Claude Berge:
Combinatorial games on a graph. Discret. Math. 151(1-3): 59-65 (1996) - 1994
- [j19]Claude Berge:
About vertex-critical non-bicolorable hypergraphs. Australas. J Comb. 9: 211-220 (1994) - 1993
- [j18]Claude Berge:
Preface. Discret. Math. 111(1-3): 1 (1993) - 1991
- [j17]Claude Berge, Jean-Claude Fournier:
A short proof for a generalization of Vizing's theorem. J. Graph Theory 15(3): 333-336 (1991) - 1990
- [j16]Claude Berge, Pierre Duchet:
Recent problems and results about kernels in directed graphs. Discret. Math. 86(1-3): 27-31 (1990)
1980 – 1989
- 1989
- [b1]Claude Berge:
Hypergraphs - combinatorics of finite sets. North-Holland mathematical library 45, North-Holland 1989, ISBN 978-0-444-87489-4, pp. I-IX, 1-255 - [j15]Claude Berge:
A new color change to improve the coloring of a graph. Discret. Appl. Math. 24(1-3): 25-28 (1989) - [j14]Claude Berge:
Minimax relations for the partial q- colorings of a graph. Discret. Math. 74(1-2): 3-14 (1989) - [j13]Claude Berge:
Book review. ZOR Methods Model. Oper. Res. 33(3): 166 (1989) - 1987
- [j12]Claude Berge:
Book review. Z. Oper. Research 31(1) (1987) - 1986
- [j11]Claude Berge:
New classes of perfect graphs. Discret. Appl. Math. 15(2-3): 145-154 (1986) - 1985
- [j10]Claude Berge, Paul Erdös, Sin Hitotumatu, Loo Keng Hua, Richard Rado:
Notes of welcome. Graphs Comb. 1(1): 3-6 (1985) - 1984
- [j9]Claude Berge, Michel Las Vergnas:
Transversals of circuits and acyclic orientations in graphs and matroids. Discret. Math. 50: 107-108 (1984) - 1982
- [j8]Claude Berge:
Diperfect graphs. Comb. 2(3): 213-222 (1982) - [j7]Claude Berge:
k-optimal Partitions of a Directed Graph. Eur. J. Comb. 3(2): 97-101 (1982) - 1981
- [j6]Claude Berge, C. C. Chen, Vasek Chvátal, C. S. Seow:
Combinatorial properties of polyominoes. Comb. 1(3): 217-224 (1981) - 1980
- [c1]Claude Berge:
Some common properties for regulizable graphs, edge-critical graphs and B-graphs. Graph Theory and Algorithms 1980: 108-123
1970 – 1979
- 1978
- [j5]Claude Berge:
Regularisable graphs I. Discret. Math. 23(2): 85-89 (1978) - [j4]Claude Berge:
Regularisable graphs, II. Discret. Math. 23(2): 91-95 (1978) - 1977
- [j3]Claude Berge, A. Ramachandra Rao:
A combinatorial problem in logic. Discret. Math. 17(1): 23-26 (1977) - [j2]Claude Berge, F. Sterboul:
Equipartite colorings in graphs and hypergraphs. J. Comb. Theory B 22(2): 97-113 (1977) - 1972
- [j1]Claude Berge:
Balanced matrices. Math. Program. 2(1): 19-31 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-04-09 00:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
