Pages that link to "Item:Q1313745"
From MaRDI portal
The following pages link to Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs (Q1313745):
Displaying 16 items.
- Independent dominating set problem revisited (Q476836) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
- Solving the weighted efficient edge domination problem on bipartite permutation graphs (Q1270782) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- Weighted domination of cocomparability graphs (Q1382270) (← links)
- Efficient minus and signed domination in graphs (Q1399996) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- The weighted perfect domination problem and its variants (Q1917310) (← links)
- The \(k\)-power domination problem in weighted trees (Q2290632) (← links)
- A Taxonomy of Perfect Domination (Q5069690) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5918841) (← links)
- Weighted domination on cocomparability graphs (Q6487953) (← links)
