The following pages link to Paweł Rzążewski (Q322248):
Displayed 35 items.
- (Q5874546) (← links)
- (Q5875557) (← links)
- Harmonious and achromatic colorings of fragmentable hypergraphs (Q5890910) (← links)
- Optimality program in segment and string graphs (Q5915588) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5918589) (← links)
- Harmonious and achromatic colorings of fragmentable hypergraphs (Q5920082) (← links)
- Optimality program in segment and string graphs (Q5920196) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
- Computing list homomorphisms in geometric intersection graphs (Q6039432) (← links)
- Classifying subset feedback vertex set for \(H\)-free graphs (Q6039438) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- (Q6065467) (← links)
- (Q6075926) (← links)
- Finding large induced sparse subgraphs in <i> c <sub>>t</sub> </i> -free graphs in quasipolynomial time (Q6087005) (← links)
- (Q6113370) (← links)
- List covering of regular multigraphs with semi-edges (Q6119831) (← links)
- Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree (Q6144405) (← links)
- (Q6147372) (← links)
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality (Q6156090) (← links)
- Every graph is eventually Turán-good (Q6170799) (← links)
- Towards the Chen-Raspaud conjecture (Q6177406) (← links)
- Designing RNA Secondary Structures is Hard (Q6293302) (← links)
- Intersecting edge distinguishing colorings of hypergraphs (Q6300900) (← links)
- Packing Directed Cycles Quarter- and Half-Integrally (Q6321542) (← links)
- Complexity of $C_k$-coloring in hereditary classes of graphs (Q6340013) (← links)
- Clique-Width: Harnessing the Power of Atoms (Q6342208) (← links)
- Coloring squares of planar graphs with small maximum degree (Q6368374) (← links)
- Max Weight Independent Set in graphs with no long claws: An analog of the Gy\'arf\'as' path argument (Q6393251) (← links)
- List covering of regular multigraphs with semi-edges (Q6396064) (← links)
- Taming graphs with no large creatures and skinny ladders (Q6398086) (← links)
- Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws (Q6400240) (← links)
- Sparse induced subgraphs in P_6-free graphs (Q6443785) (← links)
- A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number (Q6455583) (← links)