Pages that link to "Item:Q1799604"
From MaRDI portal
The following pages link to Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs (Q1799604):
Displaying 4 items.
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs (Q1313745) (← links)
- A dichotomy for weighted efficient dominating sets with bounded degree vertices (Q1628682) (← links)
- On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041) (← links)