Pages that link to "Item:Q1313728"

The following pages link to Efficient edge domination problems in graphs (Q1313728):

Displaying 36 items.

• Efficient domination through eigenvalues (Q317399) (← links)
• Kernelization of edge perfect code and its variants (Q317422) (← links)
• On weighted efficient total domination (Q414423) (← links)
• Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
• Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
• Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time (Q524382) (← links)
• On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
• Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
• Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time (Q777392) (← links)
• Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
• Efficient edge domination in regular graphs (Q1005253) (← links)
• Solving the weighted efficient edge domination problem on bipartite permutation graphs (Q1270782) (← links)
• Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
• Perfect edge domination: hard and solvable cases (Q1639290) (← links)
• On the dominating induced matching problem: spectral results and sharp bounds (Q1686045) (← links)
• Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
• Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
• Fast algorithms for some dominating induced matching problems (Q2015144) (← links)
• Efficient domination for classes of \(P_6\)-free graphs (Q2030432) (← links)
• Some results on dominating induced matchings (Q2117540) (← links)
• Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time (Q2158196) (← links)
• Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs (Q2174557) (← links)
• Modelling and solving the perfect edge domination problem (Q2174880) (← links)
• Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time (Q2192098) (← links)
• Stable-\(\Pi\) partitions of graphs (Q2255049) (← links)
• An overview of \((\kappa, \tau)\)-regular sets and their applications (Q2328081) (← links)
• Exact algorithms for dominating induced matching based on graph partition (Q2352792) (← links)
• Maximum \(k\)-regular induced subgraphs (Q2426653) (← links)
• Dominating induced matchings in graphs without a skew star (Q2447537) (← links)
• Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
• Dominating Induced Matchings (Q3655141) (← links)
• THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS (Q4820130) (← links)
• The Maximum Number of Dominating Induced Matchings (Q4982287) (← links)
• Dominating induced matching in some subclasses of bipartite graphs (Q5918091) (← links)
• Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
• Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time (Q6201338) (← links)