The following pages link to Daniël Paulusma (Q170462):
Displayed 50 items.
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- Finding induced paths of given parity in claw-free graphs (Q2428656) (← links)
- The \(k\)-in-a-path problem for claw-free graphs (Q2428671) (← links)
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs (Q2436666) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- Packing bipartite graphs with covers of complete bipartite graphs (Q2442206) (← links)
- Characterizing graphs of small carving-width (Q2446832) (← links)
- Solutions for the stable roommates problem with payments (Q2453162) (← links)
- Relative length of longest paths and longest cycles in triangle-free graphs (Q2470001) (← links)
- The computational complexity of the parallel knock-out problem (Q2481963) (← links)
- Lift-contractions (Q2509756) (← links)
- Induced disjoint paths in circular-arc graphs in linear time (Q2629233) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs (Q2798222) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes (Q2819509) (← links)
- Finding Cactus Roots in Polynomial Time (Q2819519) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- The Stable Fixtures Problem with Payments (Q2827801) (← links)
- A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (Q2833252) (← links)
- Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions (Q2835660) (← links)
- Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree (Q2842779) (← links)
- (Q2857338) (← links)
- (Q2857379) (← links)
- Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs (Q2864296) (← links)
- Sparse Square Roots (Q2864300) (← links)
- Colouring of Graphs with Ramsey-Type Forbidden Subgraphs (Q2864302) (← links)
- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints (Q2867069) (← links)
- Graph Editing to a Fixed Target (Q2870027) (← links)
- Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs (Q2872078) (← links)
- Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
- 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← links)
- Finding Vertex-Surjective Graph Homomorphisms (Q2907498) (← links)
- Satisfiability of Acyclic and Almost Acyclic CNF Formulas. (Q2908839) (← links)
- Coloring Graphs Characterized by a Forbidden Subgraph (Q2912743) (← links)
- Obtaining Planarity by Contracting Few Edges (Q2912744) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q2912870) (← links)
- Classifying the Clique-Width of H-Free Bipartite Graphs (Q2920484) (← links)
- Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set (Q2922596) (← links)
- A Reconfigurations Analogue of Brooks’ Theorem (Q2922616) (← links)
- Knocking Out P k -free Graphs (Q2922626) (← links)
- Induced Disjoint Paths in Circular-Arc Graphs in Linear Time (Q2945192) (← links)
- Finding Shortest Paths Between Graph Colourings (Q2946021) (← links)
- Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
- The Price of Connectivity for Cycle Transversals (Q2946410) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)