Nicholas Korpelainen


NameNicholas Korpelainen
Job titleSenior Lecturer in Mathematics
Research instituteCollege of Science and Engineering

Research outputs

A boundary class for the k-path partition problem.

Korpelainen, Nicholas 2018. A boundary class for the k-path partition problem. Electronic Notes in Discrete Mathematics. https://doi.org/10.1016/j.endm.2018.05.009

Infinitely many minimal classes of graphs of unbounded clique-width.

Collins, Andrew, Foniok, Jan, Korpelainen, Nicholas, Lozin, Vadim and Zamaraev, Viktor 2017. Infinitely many minimal classes of graphs of unbounded clique-width. Discrete Applied Mathematics. https://doi.org/10.1016/j.dam.2017.02.012

A new graph construction of unbounded clique-width.

Korpelainen, Nicholas 2016. A new graph construction of unbounded clique-width. Electronic Notes in Discrete Mathematics. https://doi.org/10.1016/j.endm.2016.11.005

Linear clique-width for hereditary classes of cographs

Brignall, Robert, Korpelainen, Nicholas and Vatter, Vincent 2016. Linear clique-width for hereditary classes of cographs. Journal of Graph Theory. https://doi.org/10.1002/jgt.22037

Well-quasi-order for permutation graphs omitting a path and a clique

Korpelainen, Nicholas, Atminas, Aistis, Brignall, Robert, Vatter, Vincent and Lozin, Vadim 2015. Well-quasi-order for permutation graphs omitting a path and a clique. The Electronic Journal of Combinatorics.
  • 44
    total views of outputs
  • 4
    total downloads of outputs
  • 0
    views of outputs this month
  • 0
    downloads of outputs this month