Pages that link to "Item:Q1917310"
From MaRDI portal
The following pages link to The weighted perfect domination problem and its variants (Q1917310):
Displaying 40 items.
- Efficient domination through eigenvalues (Q317399) (← links)
- Efficient and perfect domination on circular-arc graphs (Q324824) (← 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)
- Counting independent sets in tree convex bipartite graphs (Q730492) (← links)
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
- The weighted perfect domination problem (Q912630) (← links)
- The image of weighted combinatorial problems (Q1179736) (← links)
- Solving the weighted efficient edge domination problem on bipartite permutation graphs (Q1270782) (← links)
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs (Q1313745) (← links)
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622) (← 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)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- A dichotomy for weighted efficient dominating sets with bounded degree vertices (Q1628682) (← links)
- Perfect edge domination: hard and solvable cases (Q1639290) (← links)
- On efficiently total dominatable digraphs (Q1714019) (← links)
- 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)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- Efficient domination for classes of \(P_6\)-free graphs (Q2030432) (← links)
- Efficient \((j, k)\)-dominating functions (Q2107745) (← links)
- Classification of efficient dominating sets of circulant graphs of degree 5 (Q2157841) (← links)
- Perfect Italian domination in graphs: complexity and algorithms (Q2161253) (← links)
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Integer linear programming models for the weighted total domination problem (Q2279352) (← links)
- Algorithmic results on double Roman domination in graphs (Q2292130) (← links)
- Generalized perfect domination in graphs (Q2444147) (← links)
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q2948479) (← links)
- ON GRAPHS WITH PAIRWISE DISJOINT EFFICIENT DOMINATING SETS AND EFFICIENT DOMINATION IN TREES IN TERMS OF SUPPORT VERTICES (Q5076099) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q5361233) (← 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)
- Extended formulations for perfect domination problems and their algorithmic implications (Q6113358) (← links)
- k-Efficient domination: Algorithmic perspective (Q6115759) (← links)
- Weighted domination on cocomparability graphs (Q6487953) (← links)