Showing cs.LOShow all
2 papers · 1 filter
cs.LO2024
Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width
Aliaume Lopez
We are interested in characterizing which classes of finite graphs are well-quasi-ordered by the induced subgraph relation. To that end, we devise an algorithm to decide whether a…
cs.LO2023
Measuring well quasi-ordered finitary powersets
Sergio Abriola, Simon Halfon, Aliaume Lopez +3
The complexity of a well-quasi-order (wqo) can be measured through three ordinal invariants: the width as a measure of antichains, height as a measure of chains, and maximal order…