Pages that link to "Item:Q2383654"
From MaRDI portal
The following pages link to The algorithmic complexity of the minus clique-transversal problem (Q2383654):
Displaying 6 items.
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Bounds on the clique-transversal number of regular graphs (Q943436) (← links)
- Signed and minus clique-transversal functions on graphs (Q976135) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Signed clique-transversal functions in graphs (Q3056375) (← links)
- Dominating functions with integer values in graphs—a survey (Q5456310) (← links)
