Pages that link to "Item:Q2897988"
From MaRDI portal
The following pages link to Independent Domination on Tree Convex Bipartite Graphs (Q2897988):
Displayed 18 items.
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Dynamic matchings in left vertex weighted convex bipartite graphs (Q328682) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Independent dominating set problem revisited (Q476836) (← links)
- Counting independent sets in tree convex bipartite graphs (Q730492) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Counting independent sets and maximal independent sets in some subclasses of bipartite graphs (Q1627864) (← links)
- Domination in some subclasses of bipartite graphs (Q1630774) (← links)
- Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
- Linear algorithms for red and blue domination in convex bipartite graphs (Q2115838) (← links)
- Tractable connected domination for restricted bipartite graphs (Q2354310) (← links)
- Counting dominating sets in some subclasses of bipartite graphs (Q2672635) (← links)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
- Induced Matching in Some Subclasses of Bipartite Graphs (Q2971661) (← links)
- Union Closed Tree Convex Sets (Q3452566) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- Dominating induced matching in some subclasses of bipartite graphs (Q5918091) (← links)