12 results on '"Sulamita Klein"'
Search Results
2. Maximum cuts in edge-colored graphs.
3. Characterizations, probe and sandwich problems on (k, ℓ)-cographs.
4. On the forbidden induced subgraph probe and sandwich problems.
5. Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs.
6. Fixed-parameter algorithms for the cocoloring problem.
7. Characterization and recognition of P4-sparse graphs partitionable into k independent sets and l cliques.
8. Partitioning chordal graphs into independent sets and cliques.
9. Stable skew partition problem.
10. The graph sandwich problem for 1-join composition is NP-complete.
11. Maximum Vertex-weighted Matching in Strongly Chordal Graphs.
12. An Algorithm for Finding Homogeneous Pairs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.