Research Output 1987 2018

Filter
Paper
2012

Tight complexity bounds for FPT subgraph problems parameterized by clique-width

Broersma, H. J., Golovach, P. A. & Patel, V. 2012 p. 207-218 12 p.

Research output: ScientificPaper

Clique-width
Upper and lower bounds
Subgraph
Graph in graph theory
2004
2 Citations

The Ramsey numbers of paths versus kipases

Salman, M. & Broersma, H. J. 31 May 2004 p. 218-222 4 p.

Research output: Scientific - peer-reviewPaper

Ramsey number
Path