default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Delhommé
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j17]Youssef Boudabbous
, Christian Delhommé:
F3-Reconstruction and Bi-Founded 2-Structures. Order 41(1): 135-182 (2024)- 2019
- [j16]Christian Delhommé:
Orthogonal Countable Linear Orders. Order 36(2): 159-197 (2019) - 2018
- [j15]Christian Delhommé, Imed Zaguia:
Countable linear orders with disjoint infinite intervals are mutually orthogonal. Discret. Math. 341(7): 1885-1899 (2018) - 2017
- [j14]Christian Delhommé, Maurice Pouzet:
The length of an intersection. Math. Log. Q. 63(3-4): 243-255 (2017) - [j13]Christian Delhommé, Masahiro Miyakawa, Maurice Pouzet, Ivo G. Rosenberg, Hisayuki Tatsumi:
Semirigid Systems of Three Equivalence Relations. J. Multiple Valued Log. Soft Comput. 28(4-5): 511-535 (2017) - 2014
- [j12]Youssef Boudabbous, Christian Delhommé:
(≤k)-reconstructible binary relations. Eur. J. Comb. 37: 43-67 (2014) - 2012
- [j11]Youssef Boudabbous, Christian Delhommé:
Prechains and self duality. Discret. Math. 312(10): 1743-1765 (2012) - 2009
- [j10]Christian Delhommé, Maurice Pouzet, Gábor Sági, Norbert Sauer:
Representation of ideals of relational structures. Discret. Math. 309(6): 1374-1384 (2009) - 2008
- [j9]Bruno Courcelle, Christian Delhommé:
The modular decomposition of countable graphs. Definition and construction in monadic second-order logic. Theor. Comput. Sci. 394(1-2): 1-38 (2008) - 2007
- [j8]Christian Delhommé, Claude Laflamme, Maurice Pouzet, Norbert Sauer:
Divisibility of countable metric spaces. Eur. J. Comb. 28(6): 1746-1769 (2007) - 2006
- [j7]Christian Delhommé:
Height of a Superposition. Order 23(2-3): 221-233 (2006) - [j6]Christian Delhommé, Marianne Morillon:
Spanning Graphs and the Axiom of Choice. Reports Math. Log. 40: 165-180 (2006) - 2002
- [j5]Christian Delhommé, Norbert Sauer:
Homomorphisms of Products of Graphs into Graphs Without Four Cycles. Comb. 22(1): 35-46 (2002) - 2000
- [j4]Christian Delhommé, Maurice Pouzet, Norbert Sauer:
Jump-number of Means on Graphs. Eur. J. Comb. 21(6): 767-775 (2000) - 1999
- [j3]Christian Delhommé, Marianne Morillon:
Dependent Choices and Weak Compactness. Notre Dame J. Formal Log. 40(4): 568-573 (1999) - 1998
- [j2]Christian Delhommé:
Infinite Projection Properties. Math. Log. Q. 44: 481-492 (1998) - 1996
- [j1]Christian Delhommé:
Propriétés de Projection des Graphes sans Triangle ni Carré. Eur. J. Comb. 17(1): 15-22 (1996)
Conference and Workshop Papers
- 2012
- [c3]Christian Delhommé, Masahiro Miyakawa, Maurice Pouzet, Ivo G. Rosenberg, Hisayuki Tatsumi:
Semirigid Systems of Equivalence Relations. ISMVL 2012: 293-298 - 2005
- [c2]Bruno Courcelle, Christian Delhommé:
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic. CSL 2005: 325-338 - 2003
- [c1]Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas:
Using Transitive-Closure Logic for Deciding Linear Properties of Monoids. MFCS 2003: 378-387
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 22:10 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:
