Christian Delhommé

According to our database, Christian Delhommé authored at least 20 papers between 1996 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

F₃-Reconstruction and Bi-Founded 2-Structures.

Youssef Boudabbous, Christian Delhommé

Order, April, 2024

2019

Orthogonal Countable Linear Orders.

Christian Delhommé

Order, 2019

2018

Countable linear orders with disjoint infinite intervals are mutually orthogonal.

Christian Delhommé, Imed Zaguia

Discret. Math., 2018

2017

Semirigid Systems of Three Equivalence Relations.

Christian Delhommé, Masahiro Miyakawa, Maurice Pouzet, Ivo G. Rosenberg, Hisayuki Tatsumi

J. Multiple Valued Log. Soft Comput., 2017

The length of an intersection.

Christian Delhommé, Maurice Pouzet

Math. Log. Q., 2017

2014

(≤k)-reconstructible binary relations.

Youssef Boudabbous, Christian Delhommé

Eur. J. Comb., 2014

2012

Prechains and self duality.

Youssef Boudabbous, Christian Delhommé

Discret. Math., 2012

Semirigid Systems of Equivalence Relations.

Christian Delhommé, Masahiro Miyakawa, Maurice Pouzet, Ivo G. Rosenberg, Hisayuki Tatsumi

Proceedings of the 42nd IEEE International Symposium on Multiple-Valued Logic, 2012

2009

Representation of ideals of relational structures.

Christian Delhommé, Maurice Pouzet, Gábor Sági, Norbert Sauer

Discret. Math., 2009

2008

The modular decomposition of countable graphs. Definition and construction in monadic second-order logic.

Bruno Courcelle, Christian Delhommé

Theor. Comput. Sci., 2008

2007

Divisibility of countable metric spaces.

Christian Delhommé, Claude Laflamme, Maurice Pouzet, Norbert Sauer

Eur. J. Comb., 2007

2006

Spanning Graphs and the Axiom of Choice.

Christian Delhommé, Marianne Morillon

Reports Math. Log., 2006

Height of a Superposition.

Christian Delhommé

Order, 2006

2005

The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic.

Bruno Courcelle, Christian Delhommé

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2003

Using Transitive-Closure Logic for Deciding Linear Properties of Monoids.

Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002

Homomorphisms of Products of Graphs into Graphs Without Four Cycles.

Christian Delhommé, Norbert Sauer

Comb., 2002

2000

Jump-number of Means on Graphs.

Christian Delhommé, Maurice Pouzet, Norbert Sauer

Eur. J. Comb., 2000

1999

Dependent Choices and Weak Compactness.

Christian Delhommé, Marianne Morillon

Notre Dame J. Formal Log., 1999

1998

Infinite Projection Properties.

Christian Delhommé

Math. Log. Q., 1998

1996

Propriétés de Projection des Graphes sans Triangle ni Carré.

Christian Delhommé

Eur. J. Comb., 1996