Pages that link to "Item:Q1630774"

The following pages link to Domination in some subclasses of bipartite graphs (Q1630774):

Displaying 26 items.

• Dominating sets for split and bipartite graphs (Q794174) (← links)
• Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
• Domination in convex and chordal bipartite graphs (Q918703) (← links)
• Finding a dominating set on bipartite graphs (Q963425) (← links)
• Greedy domination on biclique-free graphs (Q1730031) (← links)
• Convex and isometric domination of (weak) dominating pair graphs (Q1749540) (← links)
• Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
• Differentiating-total domination: approximation and hardness results (Q2034786) (← 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)
• (Q3408843) (← links)
• Domination in Bipartite Graphs and in Their Complements (Q4429234) (← links)
• (Q4931972) (← links)
• Almost well-dominated bipartite graphs with minimum degree at least two (Q5002317) (← links)
• Dominating Bipartite Subgraphs in Graphs (Q5316262) (← links)
• Dominating induced matching in some subclasses of bipartite graphs (Q5918091) (← links)
• On the complexity of minimum maximal uniquely restricted matching (Q5918362) (← links)
• On convexity in split graphs: complexity of Steiner tree and domination (Q6123388) (← links)
• Algorithmic and complexity aspects of problems related to total restrained domination for graphs (Q6181337) (← links)
• Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
• Impact of diameter and convex ordering for Hamiltonicity and domination (Q6547831) (← 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)
• Algorithmic results for weak Roman domination problem in graphs (Q6633543) (← links)
• A closer look at Hamiltonicity and domination through the lens of diameter and convexity (Q6634506) (← links)