Pages that link to "Item:Q941347"
From MaRDI portal
The following pages link to Variations of \(Y\)-dominating functions on graphs (Q941347):
Displaying 16 items.
- On the complexity of signed and minus total domination in graphs (Q990954) (← links)
- On complexities of minus domination (Q1751171) (← links)
- Labelled packing functions in graphs (Q2011027) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849) (← links)
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
- On dominating set polyhedra of circular interval graphs (Q2659194) (← links)
- On Complexities of Minus Domination (Q2867118) (← links)
- On the complexity of variations of mixed domination on graphs<sup>†</sup> (Q2958268) (← links)
- On the complexity of the labeled domination problem in graphs (Q2968509) (← links)
- Signed clique-transversal functions in graphs (Q3056375) (← links)
- Algorithms and Complexity of Signed, Minus, and Majority Domination (Q3384120) (← links)
- Signed and Minus Dominating Functions in Graphs (Q3384612) (← links)
- From Italian domination in lexicographic product graphs to w-domination in graphs (Q5066972) (← links)
