Pages that link to "Item:Q477653"

The following pages link to Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653):

Displaying 18 items.

• Structure of squares and efficient domination in graph classes (Q338382) (← links)
• Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892) (← links)
• Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
• A dichotomy for weighted efficient dominating sets with bounded degree vertices (Q1628682) (← links)
• Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
• Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs (Q1799604) (← links)
• Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
• Efficient domination for classes of \(P_6\)-free graphs (Q2030432) (← links)
• 2-divisibility of some odd hole free graphs (Q2155661) (← links)
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
• On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041) (← links)
• Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time (Q2827803) (← links)
• Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs (Q2953402) (← links)
• On Strong Tree-Breadth (Q2958304) (← links)
• Weighted Efficient Domination for $$P_6$$ -Free and for $$P_5$$ -Free Graphs (Q3181045) (← 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)
• The (non-)existence of perfect codes in Fibonacci cubes (Q5964828) (← links)