The following pages link to Pim van 't Hof (Q387007):
Displayed 18 items.
- Computing Role Assignments of Chordal Graphs (Q3183609) (← links)
- Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
- Partitioning Graphs into Connected Parts (Q3392949) (← links)
- On Contracting Graphs to Fixed Pattern Graphs (Q3401113) (← links)
- A New Characterization of P 6-Free Graphs (Q3511353) (← links)
- Vector connectivity in graphs (Q4642479) (← links)
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q4899040) (← links)
- Induced Immersions (Q4909547) (← links)
- Vector Connectivity in Graphs (Q4922139) (← links)
- How to Eliminate a Graph (Q5200518) (← links)
- On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties (Q5200519) (← links)
- Obtaining a Bipartite Graph by Contracting Few Edges (Q5408613) (← links)
- (Q5419953) (← links)
- Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs (Q5851092) (← links)
- Finding Induced Paths of Given Parity in Claw-Free Graphs (Q5851119) (← links)
- Maximal Induced Matchings in Triangle-Free Graphs (Q5891021) (← links)
- Contracting chordal graphs and bipartite graphs to paths and trees (Q5891098) (← links)
- Contracting chordal graphs and bipartite graphs to paths and trees (Q5920327) (← links)