Peters, K;Bradbury, J;Bergmann, S;Capuccini, M;Cascante, M;De Atauri, P;Ebbels, T;Foguet, C;Glen, R;Gonzalez-Beltran, A;Guenther, U;Handakas, E;Hankemeier, T;Herman, S;Haug, K;Holub, P;Izzo, M;Jacob, D;Johnson, D;Jourdan, F;Kale, N;Karaman, I;Khalili, B;Emami Khoonsari, P;Kultima, K;Lampa, S;Larsson, A;Ludwig, C;Moreno, P;Neumann, S;Novella, JA;O'Donovan, C;Pearce, JTM;Peluso, A;Pireddu, L;Piras, ME;Reed, MAC;Rocca-Serra, P;Roger, P;Rosato, A;Rueedi, R;Ruttkies, C;Sadawi, N;Salek, R;Sansone, S-A;Selivanov, V;Spjuth, O;Schober, D;Thévenot, E;Tomasoni, M;Van Rijswijk, M;Van Vliet, M;Viant, M;Weber, R;Zanetti, G;Steinbeck, C Background: Metabolomics is the comprehensive study of a multitude of small molecules to gain insight into an organism's metabolism. The research field is dynamic and expanding with applications across biomedical, biotechnological and many other appl...

Peters, K;Bradbury, J;Bergmann, S;Capuccini, M;Cascante, M;De Atauri, P;Ebbels, T;Foguet, C;Glen, R;Gonzalez-Beltran, A;Guenther, U;Handakas, E;Hankemeier, T;Herman, S;Haug, K;Holub, P;Izzo, M;Jacob, D;Johnson, D;Jourdan, F;Kale, N;Karaman, I;Khalili, B;Emami Khoonsari, P;Kultima, K;Lampa, S;Larsson, A;Ludwig, C;Moreno, P;Neumann, S;Novella, JA;O'Donovan, C;Pearce, JTM;Peluso, A;Pireddu, L;Piras, ME;Reed, MAC;Rocca-Serra, P;Roger, P;Rosato, A;Rueedi, R;Ruttkies, C;Sadawi, N;Salek, R;Sansone, S-A;Selivanov, V;Spjuth, O;Schober, D;Thévenot, E;Tomasoni, M;Van Rijswijk, M;Van Vliet, M;Viant, M;Weber, R;Zanetti, G;Steinbeck, C Background: Metabolomics is the comprehensive study of a multitude of small molecules to gain insight into an organism's metabolism. The research field is dynamic and expanding with applications across biomedical, biotechnological and many other appl...

Peters, K;Bradbury, J;Bergmann, S;Capuccini, M;Cascante, M;De Atauri, P;Ebbels, T;Foguet, C;Glen, R;Gonzalez-Beltran, A;Guenther, U;Handakas, E;Hankemeier, T;Herman, S;Haug, K;Holub, P;Izzo, M;Jacob, D;Johnson, D;Jourdan, F;Kale, N;Karaman, I;Khalili, B;Emami Khoonsari, P;Kultima, K;Lampa, S;Larsson, A;Ludwig, C;Moreno, P;Neumann, S;Novella, JA;O'Donovan, C;Pearce, JTM;Peluso, A;Pireddu, L;Piras, ME;Reed, MAC;Rocca-Serra, P;Roger, P;Rosato, A;Rueedi, R;Ruttkies, C;Sadawi, N;Salek, R;Sansone, S-A;Selivanov, V;Spjuth, O;Schober, D;Thévenot, E;Tomasoni, M;Van Rijswijk, M;Van Vliet, M;Viant, M;Weber, R;Zanetti, G;Steinbeck, C Background: Metabolomics is the comprehensive study of a multitude of small molecules to gain insight into an organism's metabolism. The research field is dynamic and expanding with applications across biomedical, biotechnological and many other appl...

Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exists subclasses in which the packing chromatic number is finite (and small). These subclasses include subcubic trees, base-3 ...

Given a triangle-free planar graph G and a 9-cycle C in G, we characterize situations where a 3-coloring of C does not extend to a proper 3-coloring of G. This extends previous results when C is a cycle of length at most 8.

The question of whether subcubic graphs have finite packing chromatic number or not is still open although positive responses are known for some subclasses, including subcubic trees, base-3 Sierpiski graphs and hexagonal lattices. In this paper, we a...

The question of whether subcubic graphs have finite packing chromatic number or not is still open although positive responses are known for some subclasses, including subcubic trees, base-3 Sierpiski graphs and hexagonal lattices. In this paper, we a...

The packing chromatic number $\chi_{\rho}(G)$ of a graph $G$ is the smallest integer $p$ such that vertices of $G$ can be partitioned into disjoint classes $X_{1}, ..., X_{p}$ where vertices in $X_{i}$ have pairwise distance greater than $i$. For $k ...

For any positive integer $s$, a $[2,2s]$-factor in a graph $G$ is a connected even factor with maximum degree at most $2s$. We prove that if every induced $S(K_{1, 2s+1})$ in a graph $G$ has at least 3 edges in a block of degree at most two, then $G^...

The rainbow connection number of a graph G is the least number of colours in a (not necessarily proper) edge-colouring of G such that every two vertices are joined by a path which contains no colour twice. Improving a result of Caro et al., we prove ...