default search action
Charles Delorme
Person information
- affiliation: University of Paris-Sud, Orsay, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j50]Charles Delorme:
Weighted graphs: Eigenvalues and chromatic number. Electron. J. Graph Theory Appl. 4(1): 8-17 (2016) - 2015
- [j49]Charles Delorme, Guillermo Pineda-Villavicencio:
Continuants and Some Decompositions Into Squares. Integers 15: A3 (2015) - [j48]Charles Delorme, Guillermo Pineda-Villavicencio:
Quadratic Form Representations via Generalized Continuants. J. Integer Seq. 18(6): 15.6.4 (2015) - 2013
- [j47]Charles Delorme:
Cayley digraphs and graphs. Eur. J. Comb. 34(8): 1307-1315 (2013) - [j46]Charles Delorme:
Sequence of maximal distance codes in graphs or other metric spaces. Electron. J. Graph Theory Appl. 1(2): 118-124 (2013) - [j45]Marc Cámara, Cristina Dalfó
, Charles Delorme, Miguel Angel Fiol
Edge-distance-regular graphs are distance-regular. J. Comb. Theory A 120(5): 1057-1067 (2013) - 2012
- [j44]Charles Delorme:
Eigenvalues of complete multipartite graphs. Discret. Math. 312(17): 2532-2535 (2012) - 2010
- [j43]Charles Delorme, Guillermo Pineda-Villavicencio:
On Graphs with Cyclic Defect or Excess. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j42]Charles Delorme, Leif K. Jørgensen, Mirka Miller, Guillermo Pineda-Villavicencio
On bipartite graphs of defect 2. Eur. J. Comb. 30(4): 798-808 (2009) - [j41]Charles Delorme, Evelyne Flandrin, Yuqing Lin
On Extremal Graphs with Bounded Girth. Electron. Notes Discret. Math. 34: 653-657 (2009) - [j40]Charles Delorme, Leif K. Jørgensen, Mirka Miller, Guillermo Pineda-Villavicencio
On bipartite graphs of diameter 3 and defect 2. J. Graph Theory 61(4): 271-288 (2009) - 2008
- [j39]Domingos Moreira Cardoso
Efficient edge domination in regular graphs. Discret. Appl. Math. 156(15): 3060-3065 (2008) - 2007
- [j38]Domingos Moreira Cardoso
Laplacian eigenvectors and eigenvalues and almost equitable partitions. Eur. J. Comb. 28(3): 665-673 (2007) - 2004
- [j37]Charles Delorme:
Laplacian eigenvalues and fixed size multisection. Discret. Math. 276(1-3): 149-159 (2004) - [j36]Charles Delorme, Samuel Gonzalez, Oscar Ordaz, María Teresa Varela:
Barycentric sequences and barycentric Ramsey numbers stars. Discret. Math. 277(1-3): 45-56 (2004) - [j35]Charles Delorme, Isabel Marquez, Oscar Ordaz, Asdrubal Ortuño:
Existence conditions for barycentric sequences. Discret. Math. 281(1-3): 163-172 (2004) - 2003
- [j34]Charles Delorme, Odile Favaron, Dieter Rautenbach:
Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees. Discret. Appl. Math. 130(3): 503-512 (2003) - 2002
- [j33]Charles Delorme:
Spectra and cuts. Australas. J Comb. 26: 183-192 (2002) - [j32]Charles Delorme, Odile Favaron, Dieter Rautenbach:
On the Randic Image index. Discret. Math. 257(1): 29-38 (2002) - [j31]Charles Delorme, Odile Favaron, Dieter Rautenbach:
On the reconstruction of the degree sequence. Discret. Math. 259(1-3): 293-300 (2002) - [j30]Charles Delorme, J. Gómez:
Some New Large Compound Graphs. Eur. J. Comb. 23(5): 539-547 (2002) - 2001
- [j29]Charles Delorme:
Presentations of groups generated by transpositions. Discret. Math. 236(1-3): 59-64 (2001) - [j28]Charles Delorme, Oscar Ordaz, Domingo Quiroz
Some remarks on Davenport constant. Discret. Math. 237(1-3): 119-128 (2001) - 2000
- [j27]Charles Delorme:
Laplacian Eigenvalues and multisections. Electron. Notes Discret. Math. 5: 93-96 (2000)
1990 – 1999
- 1999
- [j26]Fan R. K. Chung, Charles Delorme, Patrick Solé:
Multidiameters and Multiplicities. Eur. J. Comb. 20(7): 629-640 (1999) - 1998
- [j25]Charles Delorme, Jean-Pierre Tillich:
The Spectrum of de Bruijn and Kautz Graphs. Eur. J. Comb. 19(3): 307-319 (1998) - [j24]Charles Delorme, Oscar Ordaz, Domingo Quiroz:
Tools for studying paths and cycles in digraphs. Networks 31(2): 125-148 (1998) - [j23]Evripidis Bampis
Optimal Schedules for d-D Grid Graphs with Communication Delays. Parallel Comput. 24(11): 1653-1664 (1998) - 1997
- [j22]Charles Delorme, Jean-Pierre Tillich:
Eigenvalues, eigenspaces and distances to subsets. Discret. Math. 165-166: 171-194 (1997) - 1996
- [c2]Charles Delorme, Petrisor Panaite
Rubik Routing Permutations on Graphs. Euro-Par, Vol. I 1996: 283-286 - [c1]Evripidis Bampis, Charles Delorme, Jean-Claude König:
Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract). STACS 1996: 655-666 - 1995
- [j21]Abdelmadjid Bouabdallah, Charles Delorme, Selma Djelloul:
Edge Deletion Preserving the Diameter of the Hypercube. Discret. Appl. Math. 63(1): 91-95 (1995) - 1994
- [j20]Charles Delorme:
Distance Biregular Bipartite Graphs. Eur. J. Comb. 15(3): 223-238 (1994) - [j19]Charles Delorme, Yahya Ould Hamidoune:
On products of sets in groups. Graphs Comb. 10(2-4): 101-104 (1994) - 1993
- [j18]Charles Delorme, Svatopluk Poljak:
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs. Discret. Math. 111(1-3): 145-156 (1993) - [j17]J. Bond, Charles Delorme:
A note on partial Cayley graphs. Discret. Math. 114(1-3): 63-74 (1993) - [j16]Charles Delorme:
Eigenvalues of finite graphs. Discret. Math. 114(1-3): 137-146 (1993) - [j15]Charles Delorme, Svatopluk Poljak:
Combinatorial Properties and the Complexity of a Max-cut Approximation . Eur. J. Comb. 14(4): 313-333 (1993) - [j14]Charles Delorme, Svatopluk Poljak:
Laplacian eigenvalues and the maximum cut problem. Math. Program. 62: 557-574 (1993) - 1992
- [j13]Charles Delorme:
Examples of Products Giving Large Graphs with Given Degree and Diameter. Discret. Appl. Math. 37/38: 157-167 (1992) - [j12]Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater:
Table of Large (Delta, D)-Graphs. Discret. Appl. Math. 37/38: 575-577 (1992) - [j11]Charles Delorme, Odile Favaron, Maryvonne Mahéo:
Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups. Eur. J. Comb. 13(1): 59-61 (1992) - 1991
- [j10]Charles Delorme, Patrick Solé:
Diameter, Covering Index, Covering Radius and Eigenvalues. Eur. J. Comb. 12(2): 95-108 (1991)
1980 – 1989
- 1986
- [j9]Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater:
Strategies for Interconnection Networks: Some Methods from Graph Theory. J. Parallel Distributed Comput. 3(4): 433-449 (1986) - 1985
- [j8]Charles Delorme:
Grands Graphes de Degré et Diamètre Donnés. Eur. J. Comb. 6(4): 291-302 (1985) - [j7]Charles Delorme:
Large bipartite graphs with given degree and diameter. J. Graph Theory 9(3): 325-334 (1985) - 1984
- [j6]Charles Delorme, Gena Hahn:
Infinite generalized friendship graphs. Discret. Math. 49(3): 261-266 (1984) - [j5]Jean-Claude Bermond, Charles Delorme, G. Farhi:
Large graphs with given degree and diameter. II. J. Comb. Theory B 36(1): 32-48 (1984) - [j4]Charles Delorme, G. Farhi:
Large Graphs with Given Degree and Diameter - Part I. IEEE Trans. Computers 33(9): 857-860 (1984) - 1982
- [j3]Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater:
Tables of Large Graphs with Given Degree and Diameter. Inf. Process. Lett. 15(1): 10-13 (1982) - 1980
- [j2]Charles Delorme:
Two sets of graceful graphs. J. Graph Theory 4(2): 247-250 (1980) - [j1]Charles Delorme, Maryvonne Mahéo, Henri Thuillier, Khee Meng Koh, H. K. Teo:
Cycles with a chord are graceful. J. Graph Theory 4(4): 409-415 (1980)
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 2024-10-07 21:21 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 and maintained by:
the dblp computer science bibliography is funded and supported by: