Pages that link to "Item:Q1270782"

The following pages link to Solving the weighted efficient edge domination problem on bipartite permutation graphs (Q1270782):

Displaying 33 items.

• Efficient domination through eigenvalues (Q317399) (← links)
• Kernelization of edge perfect code and its variants (Q317422) (← links)
• Structure of squares and efficient domination in graph classes (Q338382) (← 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)
• Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time (Q777392) (← links)
• Acyclic domination on bipartite permutation graphs (Q845701) (← links)
• Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
• Efficient edge domination in regular graphs (Q1005253) (← links)
• Labeling bipartite permutation graphs with a condition at distance two (Q1026125) (← links)
• Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
• Perfect edge domination: hard and solvable cases (Q1639290) (← links)
• Linear-time algorithms for counting independent sets in bipartite permutation graphs (Q1675914) (← 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)
• 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)
• On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041) (← links)
• Exact algorithms for dominating induced matching based on graph partition (Q2352792) (← links)
• A note on efficient domination in a superclass of \(P_5\)-free graphs (Q2446593) (← links)
• Dominating induced matchings in graphs without a skew star (Q2447537) (← links)
• A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs (Q2839221) (← links)
• Dominating Induced Matchings (Q3655141) (← links)
• The Maximum Number of Dominating Induced Matchings (Q4982287) (← links)
• Dominating induced matching in some subclasses of bipartite graphs (Q5918091) (← links)
• On efficient domination for some classes of \(H\)-free chordal graphs (Q5918841) (← links)
• Critical properties of bipartite permutation graphs (Q6142657) (← links)
• Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time (Q6201338) (← links)
• Graphs whose vertices of degree at least 2 lie in a triangle (Q6667338) (← links)