16 citations · 57 across the 16 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.CC2020
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…
cs.LO2020
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…
cs.LO2020★ 4 cited
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…