The following pages link to Konrad Dabrowski (Q322306):
Displaying 14 items.
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- Contracting bipartite graphs to paths and cycles (Q5920049) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
- On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (Q6181986) (← links)
- Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy (Q6310429) (← links)
- On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal (Q6327025) (← links)
- Clique-Width: Harnessing the Power of Atoms (Q6342208) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
- Almost consistent systems of linear equations (Q6538651) (← links)
- Tree pivot-minors and linear rank-width (Q6621185) (← links)
- Independent transversals versus transversals (Q6621186) (← links)
