The following pages link to A REVIEW OF TREE CONVEX SETS TEST (Q4649838):
Displaying 20 items.
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Domination in some subclasses of bipartite graphs (Q1630774) (← links)
- On partial Grundy coloring of bipartite graphs and chordal graphs (Q2009016) (← links)
- Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
- Differentiating-total domination: approximation and hardness results (Q2034786) (← links)
- Exact square coloring of certain classes of graphs: complexity and algorithms (Q2172606) (← links)
- Global total \(k\)-domination: approximation and hardness results (Q2216425) (← links)
- Injective coloring of some subclasses of bipartite graphs and chordal graphs (Q2659063) (← links)
- Acyclic matching in some subclasses of graphs (Q2680984) (← links)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
- Union Closed Tree Convex Sets (Q3452566) (← links)
- Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results (Q5026258) (← links)
- Acyclic Matching in Some Subclasses of Graphs (Q5041209) (← links)
- Dominating induced matching in some subclasses of bipartite graphs (Q5918091) (← links)
- On the complexity of minimum maximal uniquely restricted matching (Q5918362) (← links)
- Complexity and algorithms for injective edge coloring of graphs (Q6132966) (← links)
- Algorithmic and complexity aspects of problems related to total restrained domination for graphs (Q6181337) (← links)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms (Q6558691) (← links)
- Hardness results of connected power domination for bipartite graphs and chordal graphs (Q6610089) (← links)
