Pages that link to "Item:Q1348388"
From MaRDI portal
The following pages link to Weighted efficient domination problem on some perfect graphs (Q1348388):
Displayed 16 items.
- Efficient domination through eigenvalues (Q317399) (← links)
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Structure of squares and efficient domination in graph classes (Q338382) (← links)
- On weighted efficient total domination (Q414423) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Acyclic domination on bipartite permutation graphs (Q845701) (← links)
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
- Efficient minus and signed domination in graphs (Q1399996) (← links)
- A dichotomy for weighted efficient dominating sets with bounded degree vertices (Q1628682) (← links)
- Simple linear-time algorithms for counting independent sets in distance-hereditary graphs (Q1706124) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041) (← links)
- Exact algorithms for dominating induced matching based on graph partition (Q2352792) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- Perfect domination and small cycles (Q5367522) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5918841) (← links)