Pages that link to "Item:Q2953402"
From MaRDI portal
The following pages link to Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs (Q2953402):
Displaying 10 items.
- 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)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041) (← links)
- A note on efficient domination in a superclass of \(P_5\)-free graphs (Q2446593) (← links)
- Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs (Q2953402) (← links)
- Weighted Efficient Domination for $$P_6$$ -Free and for $$P_5$$ -Free Graphs (Q3181045) (← links)
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- New Polynomial Case for Efficient Domination in P 6-free Graphs (Q5174951) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5920175) (← links)