Pages that link to "Item:Q4909544"

The following pages link to Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs (Q4909544):

Displaying 28 items.

• Kernelization of edge perfect code and its variants (Q317422) (← links)
• Efficient and perfect domination on circular-arc graphs (Q324824) (← links)
• Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
• Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
• Combinatorial and spectral properties of König-Egerváry graphs (Q516875) (← 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)
• Graph classes with and without powers of bounded clique-width (Q896650) (← links)
• Efficient edge domination in regular graphs (Q1005253) (← links)
• Perfect edge domination: hard and solvable cases (Q1639290) (← links)
• Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← 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)
• Efficient \((j, k)\)-dominating functions (Q2107745) (← links)
• Modelling and solving the perfect edge domination problem (Q2174880) (← 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)
• Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time (Q2827803) (← links)
• A Survey of the Game “Lights Out!” (Q2848975) (← links)
• On Strong Tree-Breadth (Q2958304) (← 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)
• On efficient domination for some classes of \(H\)-free chordal graphs (Q5920175) (← links)
• Perfect codes in \(m\)-Cayley hypergraphs (Q6611056) (← links)
• Diffusion: quiescence and perturbation (Q6644883) (← links)
• Graphs whose vertices of degree at least 2 lie in a triangle (Q6667338) (← links)