The following pages link to Sulamita Klein (Q293306):
Displaying 50 items.
- The homogeneous set sandwich problem (Q293307) (← links)
- (Q324751) (redirect page) (← links)
- Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs (Q324752) (← links)
- Corrigendum to ``Cycle transversals in perfect graphs and cographs'' (Q387014) (← links)
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (Q456142) (← links)
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
- The chain graph sandwich problem (Q646705) (← links)
- An algorithm for finding homogeneous pairs (Q674438) (← links)
- How is a chordal graph like a supersolvable binary matroid? (Q704292) (← links)
- Packing \(r\)-cliques in weighted chordal graphs (Q817141) (← links)
- List matrix partitions of chordal graphs (Q817772) (← links)
- Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs (Q897592) (← links)
- \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- Maximum vertex-weighted matching in strongly chordal graphs (Q1392564) (← links)
- Graph covers using \(t\)-colourable vertex sets. (Q1427470) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- On the forbidden induced subgraph probe and sandwich problems (Q1686049) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- Partitioning chordal graphs into independent sets and cliques (Q1827861) (← links)
- Stable skew partition problem (Q1887035) (← links)
- Cycle transversals in perfect graphs and cographs (Q1935798) (← links)
- The arboreal jump number of an order (Q1943701) (← links)
- Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques (Q2081655) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- On the oriented coloring of the disjoint union of graphs (Q2115853) (← links)
- Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs (Q2184673) (← links)
- Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
- Extended skew partition problem (Q2433705) (← links)
- (Q2741477) (← links)
- (Q2816076) (← links)
- Complexity of graph partition problems (Q2819579) (← links)
- On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs (Q2827819) (← links)
- Cycle transversals in bounded degree graphs (Q2840538) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- Bull-Reducible Berge Graphs are Perfect (Q3438957) (← links)
- The P4-sparse Graph Sandwich Problem (Q3439332) (← links)
- A representation for the modular-pairs of a P4-reducible graph by modular decomposition (Q3439346) (← links)
- Characterizing –partitionable Cographs (Q3439349) (← links)
- 2K2 vertex-set partition into nonempty parts (Q3503567) (← links)
- (Q4393307) (← links)
- List Partitions (Q4443101) (← links)
- (Q4489192) (← links)
- (Q4508373) (← links)
- (Q4521527) (← links)
- (Q4558957) (← links)
- Optimal grid representations (Q4651928) (← links)
- Finding<i>H</i>-partitions efficiently (Q4680731) (← links)
