5 datasets found

The Grundy index of a graph G = (V,E) is the greatest number of colours that the greedy edge-colouring algorithm can use on G. We prove that the problem of determining...

International audience

Given a bipartite graph G = (U υ V,E) such that |U| = |V | and every edge is labelled true or false or both, the perfect matching free subgraph problem is to determine...

Beware, this abstract comports irony and humor. In this dissertation, we defend the idea that, for any reasonnable model of computation, this is not the model that is...

Colloque avec actes et comité de lecture. internationale.