79 results on '"Sulamita Klein"'
Search Results
2. On the oriented coloring of the disjoint union of graphs.
3. On the absolute and relative oriented clique problems' time complexity.
4. New Results on Edge-coloring and Total-coloring of Split Graphs.
5. On the Oriented Coloring of the Disjoint Union of Graphs.
6. Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques.
7. Partitions and well-coveredness: The graph sandwich problem.
8. Maximum cuts in edge-colored graphs.
9. Characterizations, probe and sandwich problems on (k, ℓ)-cographs.
10. On the forbidden induced subgraph probe and sandwich problems.
11. Chordal-(2, 1) graph sandwich problem with boundary conditions.
12. On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph.
13. On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs.
14. Maximum Cuts in Edge-colored Graphs.
15. Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion.
16. On the forbidden induced subgraph probe problem.
17. On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs.
18. FPT algorithms to recognize well covered graphs.
19. Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs.
20. On specifying boundary conditions for the graph sandwich problem.
21. An oriented 8-coloring for acyclic oriented graphs with maximum degree 3.
22. On (k, ℓ)-Graph Sandwich Problems.
23. On the Oriented Chromatic Number of Union of Graphs.
24. Two Fixed-Parameter Algorithms for the Cocoloring Problem.
25. FPT algorithms to recognize well covered graphs.
26. Maximum cuts in edge-colored graphs.
27. Advances on the List Stubborn Problem.
28. Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs.
29. List Partitions of Chordal Graphs.
30. Fixed-parameter algorithms for the cocoloring problem.
31. Chordal-(k, ℓ) and strongly chordal-(k, ℓ)graph sandwich problems.
32. On the (parameterized) complexity of recognizing well-covered (r, l)-graphs.
33. Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs.
34. Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs.
35. Clique cycle transversals in graphs with few P4's.
36. Recognizing Well Covered Graphs of Families with Special P 4-Components.
37. Cycle transversals in perfect graphs and cographs.
38. The Arboreal Jump Number of an Order.
39. Sandwich problems on orientations.
40. On clique-colouring of graphs with few P 4's.
41. Partitioning extended P4-laden graphs into cliques and stable sets.
42. Odd Cycle Transversals and Independent Sets in Fullerene Graphs.
43. Finding Skew Partitions Efficiently.
44. Characterization and recognition of P4-sparse graphs partitionable into k independent sets and l cliques.
45. Cycle transversals in bounded degree graphs.
46. The chain graph sandwich problem.
47. 2K2 vertex-set partition into nonempty parts.
48. Complexity of Graph Partition Problems.
49. The Graph Sandwich Problem for P4-sparse graphs.
50. Cycle transversals in bounded degree graphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.