Pages that link to "Item:Q963425"
From MaRDI portal
The following pages link to Finding a dominating set on bipartite graphs (Q963425):
Displaying 12 items.
- Dominating sets for split and bipartite graphs (Q794174) (← links)
- The bottleneck independent domination on the classes of bipartite graphs and block graphs. (Q1429835) (← links)
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496) (← links)
- Dominator sequences in bipartite graphs (Q2404078) (← links)
- Exact algorithms for weak Roman domination (Q2413969) (← links)
- On the complexity of dominating set problems related to the minimum all-ones problem (Q2456358) (← links)
- A note on domination in bipartite graphs (Q4435559) (← links)
- STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS (Q5073975) (← links)
- Strong geodetic problem on complete multipartite graphs (Q5217086) (← links)
- Dominating Bipartite Subgraphs in Graphs (Q5316262) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
- Safe sets and in-dominating sets in digraphs (Q6153473) (← links)