In: Cellular and Molecular Neurobiology, 2014, vol. 34, no. 7, p. 1011-1021
|
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.
|
In: Neurological Sciences, 2013, vol. 34, no. 3, p. 379-382
|
In: Algorithmica, 2011, vol. 61, no. 4, p. 839-856
|
In: Virchows Archiv, 2011, vol. 458, no. 4, p. 487-496
|
In: Histochemistry and Cell Biology, 2008, vol. 130, no. 1, p. 141-155
|
In: Magnetic Resonance Materials in Physics, Biology and Medicine, 2013, vol. 26, no. 3, p. 291-301
|
In: Algorithmica, 2013, vol. 65, no. 3, p. 584-604
|
In: European Journal of Nuclear Medicine and Molecular Imaging, 2010, vol. 37, no. 8, p. 1559-1565
|
In: European Radiology, 2010, vol. 20, no. 3, p. 595-603
|