Pages that link to "Item:Q5325951"
From MaRDI portal
The following pages link to Hereditary Efficiently Dominatable Graphs (Q5325951):
Displayed 15 items.
- Efficient domination through eigenvalues (Q317399) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← 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)
- 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)
- 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)
- 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)
- 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)