The following pages link to Pim van 't Hof (Q387007):
Displaying 50 items.
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- (Q400491) (redirect page) (← links)
- Graph classes and Ramsey numbers (Q400493) (← links)
- On graph contractions and induced minors (Q415282) (← links)
- Edge contractions in subclasses of chordal graphs (Q423902) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
- Finding disjoint paths in split graphs (Q493652) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- The price of connectivity for feedback vertex set (Q516802) (← links)
- (Q592313) (redirect page) (← links)
- Constructing fair round robin tournaments with a minimum number of breaks (Q614051) (← links)
- Computing role assignments of chordal graphs (Q708211) (← links)
- On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- A new characterization of \(P_{6}\)-free graphs (Q972332) (← links)
- Partitioning graphs into connected parts (Q1034603) (← links)
- Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
- Choosability on \(H\)-free graphs (Q1943624) (← links)
- Obtaining planarity by contracting few edges (Q1945931) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Computing the metric dimension for chain graphs (Q2346556) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- Finding induced paths of given parity in claw-free graphs (Q2428656) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- Characterizing graphs of small carving-width (Q2446832) (← links)
- Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree (Q2842779) (← links)
- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints (Q2867069) (← links)
- Induced Subtrees in Interval Graphs (Q2870030) (← links)
- Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration (Q2891369) (← links)
- Computing Minimum Geodetic Sets of Proper Interval Graphs (Q2894472) (← links)
- (Q2911626) (← links)
- Obtaining Planarity by Contracting Few Edges (Q2912744) (← links)
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs (Q2914318) (← links)
- Ramsey Numbers for Line Graphs and Perfect Graphs (Q2914325) (← links)
- Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set (Q2922596) (← links)
- Finding Disjoint Paths in Split Graphs (Q2938109) (← links)
- Hadwiger Number of Graphs with Small Chordality (Q2945190) (← links)
- (Q2978505) (← links)
- Computing Role Assignments of Proper Interval Graphs in Polynomial Time (Q3000505) (← links)
- Edge Contractions in Subclasses of Chordal Graphs (Q3010431) (← links)
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q3057614) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
- Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths (Q3104605) (← links)
- Characterizing Graphs of Small Carving-Width (Q3167377) (← links)
