Perfeziona i miei risultati

Document type

Collection spécifique

Lingua

Université de Fribourg

Classifying k-edge colouring for H-free graphs

Galby, Esther ; T. Lima, Paloma ; Paulusma, Daniël ; Ries, Bernard

In: Information procesing letters, 2019, vol. 146, p. 39-43

A graph is H-free if it does not contain an induced subgraph isomorphic to H. For every integer k and every graph H, we determine the computational complexity of k-Edge Colouring for H-free graphs.

Consortium of Swiss Academic Libraries

Tumour-targeting properties of antibodies specific to MMP-1A, MMP-2 and MMP-3

Pfaffen, Stefanie ; Frey, Katharina ; Stutz, Irène ; Roesli, Christoph ; Neri, Dario

In: European Journal of Nuclear Medicine and Molecular Imaging, 2010, vol. 37, no. 8, p. 1559-1565