The following pages link to Daniël Paulusma (Q170462):
Displayed 50 items.
- List Coloring in the Absence of Two Subgraphs (Q4924657) (← links)
- (Q5005166) (← links)
- (Q5009627) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- What Graphs are 2-Dot Product Graphs? (Q5024919) (← links)
- Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs (Q5043646) (← links)
- Finding a Small Number of Colourful Components (Q5088911) (← links)
- Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
- Colouring H-free graphs of bounded diameter. (Q5092372) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Independent Feedback Vertex Set for P_5-free Graphs (Q5136232) (← links)
- Clique-width for hereditary graph classes (Q5149166) (← links)
- Solutions for the Stable Roommates Problem with Payments (Q5200495) (← links)
- How to Eliminate a Graph (Q5200518) (← links)
- Surjective H-Colouring over Reflexive Digraphs (Q5205804) (← links)
- Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide (Q5229535) (← links)
- Surjective H-colouring: New hardness results (Q5240583) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
- Narrowing the Complexity Gap for Colouring (C s ,P t )-Free Graphs (Q5251642) (← links)
- Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
- Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number (Q5324108) (← links)
- Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs (Q5360875) (← links)
- A Linear Kernel for Finding Square Roots of Almost Planar Graphs (Q5369506) (← links)
- Colouring Diamond-free Graphs. (Q5369518) (← links)
- (Q5419953) (← links)
- Upper Bounds and Algorithms for Parallel Knock-Out Numbers (Q5425981) (← links)
- Cycles through specified vertices in triangle-free graphs (Q5444067) (← links)
- Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars (Q5448772) (← links)
- Covering Graphs with Few Complete Bipartite Subgraphs (Q5458846) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492870) (← links)
- Matching Games: The Least Core and the Nucleolus (Q5704127) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710800) (← links)
- (Q5747399) (← links)
- Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs (Q5851092) (← links)
- Finding Induced Paths of Given Parity in Claw-Free Graphs (Q5851119) (← links)
- (Q5874489) (← links)
- Kempe equivalence of colourings of cubic graphs (Q5890904) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5890917) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897549) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902532) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5915592) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5915794) (← links)
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5915796) (← links)
- Contracting bipartite graphs to paths and cycles (Q5915810) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918405) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)