Dataset - CKAN

Well-Quasi-Order of Relabel Functions

International audience
- HTML
Clique-width of graphs defined by one-vertex extensions

International audience
- HTML
Coloring Powers of Graphs of Bounded Clique-Width

We show that the p-coloring problem is polynomial for classes of graphs of bounded clique-width.
- HTML
Clique-width and edge contraction

International audience
- HTML

You can also access this registry using the API (see API Docs).