Pages that link to "Item:Q393042"
From MaRDI portal
The following pages link to Feedback vertex sets on restricted bipartite graphs (Q393042):
Displaying 16 items.
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← 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)
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles (Q2296552) (← 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)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- Hardness and structural results for half-squares of restricted tree convex bipartite graphs (Q5919674) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- Some new algorithmic results on co-secure domination in graphs (Q6190005) (← links)
