16 citations · 57 across the 16 of their papers we have counts for
17 papers
Unfoldings and coverings of weighted graphs
Bruno Courcelle
Coverings of undirected graphs are used in distributed computing, and unfoldings of directed graphs in semantics of programs. We study these two notions from a graph theoretical po…
Induced betweenness in order-theoretic trees
Bruno Courcelle
The ternary relation of betweenness states that an element is between the elements and , in some sense depending on the considered structure. In a partially o…
Order-theoretic trees: monadic second-order descriptions and regularity
Bruno Courcelle
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements…
A unified algorithm for colouring graphs of bounded clique-width
Bruno Courcelle, Irène Durand, Michael Raskin
Clique-width is one of the graph complexity measures leading to polynomial special-case algorithms for generally NP-complete problems, e.g. graph colourability. The best two curren…
Betweenness of partial orders
Bruno Courcelle
We construct a monadic second-order sentence that characterizes the ternary relations that are the betweenness relations of finite or infinite partial orders. We prove that no firs…
Axiomatization of betweenness in order-theoretic trees
Bruno Courcelle
The ternary betweenness relation of a tree, B(x,y,z) expresses that y is on the unique path between x and z. This notion can be extended to order-theoretic trees defined as partial…