Pages that link to "Item:Q5405924"
From MaRDI portal
The following pages link to Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs (Q5405924):
Displaying 11 items.
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Domination in some subclasses of bipartite graphs (Q1630774) (← links)
- Tractable connected domination for restricted bipartite graphs (Q2354310) (← links)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
- Independent Domination on Tree Convex Bipartite Graphs (Q2897988) (← links)
- Union Closed Tree Convex Sets (Q3452566) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- Approximation hardness of domination problems on generalized convex graphs (Q6664063) (← links)