The following pages link to Nicholas Korpelainen (Q382895):
Displaying 16 items.
- Boundary properties of well-quasi-ordered sets of graphs (Q382896) (← links)
- A new graph construction of unbounded clique-width (Q509276) (← links)
- Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- An inescapable region for the chessboard pebbling problem on four quadrants (Q1739928) (← links)
- A boundary class for the \(k\)-path partition problem (Q1791978) (← links)
- Split permutation graphs (Q2014716) (← links)
- Two forbidden induced subgraphs and well-quasi-ordering (Q2275404) (← links)
- Well-quasi-order for permutation graphs omitting a path and a clique (Q2344822) (← links)
- Infinitely many minimal classes of graphs of unbounded clique-width (Q2413975) (← links)
- Dominating induced matchings in graphs without a skew star (Q2447537) (← links)
- A polynomial-time algorithm for the dominating induced matching problem in the class of convex graphs (Q2839221) (← links)
- Linear Clique‐Width for Hereditary Classes of Cographs (Q2978187) (← links)
- Bipartite induced subgraphs and well-quasi-ordering (Q3018076) (← links)
- Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult (Q3569086) (← links)
- Bipartite Graphs of Large Clique-Width (Q3651565) (← links)
