The following pages link to Konrad Dabrowski (Q322306):
Displaying 50 items.
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- (Q442347) (redirect page) (← links)
- On factorial properties of chordal bipartite graphs (Q442348) (← links)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- Computing small pivot-minors (Q1627161) (← links)
- Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- New results on maximum induced matchings in bipartite graphs and beyond (Q1951557) (← links)
- Clique-width: harnessing the power of atoms (Q2110611) (← links)
- Stable-\(\Pi\) partitions of graphs (Q2255049) (← links)
- Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy (Q2285091) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- Combinatorics and algorithms for augmenting graphs (Q2631076) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← 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)
- Colouring of Graphs with Ramsey-Type Forbidden Subgraphs (Q2864302) (← links)
- Classifying the Clique-Width of H-Free Bipartite Graphs (Q2920484) (← links)
- Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- Editing to Eulerian graphs (Q2978505) (← links)
- Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
- Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
- Filling the complexity gaps for colouring planar and bounded degree graphs (Q3299212) (← links)
- (Q5005166) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- Finding a Small Number of Colourful Components (Q5088911) (← 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)
- Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide (Q5229535) (← links)
- Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs (Q5360875) (← links)
- Colouring Diamond-free Graphs. (Q5369518) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5890917) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5915794) (← 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)
