scientific article; zbMATH DE number 5056647
From MaRDI portal
Publication:5488895
Recommendations
- scientific article; zbMATH DE number 2077650
- Bounds on the maximum number of minimum dominating sets
- Coverings, matchings and the number of maximal independent sets of graphs
- Some bounds on the size of maximum G-free sets in graphs
- New and improved bounds for the minimum set cover problem
- Maximizing the number of independent sets of fixed size in Kn‐covered graphs
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs
- scientific article; zbMATH DE number 4148121
- A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set
- Alliances in graphs of bounded clique-width
Cited in
(20)- Alliances and Related Domination Parameters
- Global defensive \(k\)-alliances in graphs
- scientific article; zbMATH DE number 2077650 (Why is no real title available?)
- Alliance free and alliance cover sets
- Partitioning a graph into global powerful \(k\)-alliances
- Boundary defensive \(k\)-alliances in graphs
- Defensive \(k\)-alliances in graphs
- Upper \(k\)-alliances in graphs
- Partitioning a graph into alliance free sets
- Partitioning a graph into defensive \(k\)-alliances
- Global strong defensive alliances of Sierpiński-like graphs
- Alliance free sets in Cartesian product graphs
- On the complement graph and defensive \(k\)-alliances
- Global defensive alliances in the lexicographic product of paths and cycles
- Alliances in graphs: parameters, properties and applications -- a survey
- Client-server and cost effective sets in graphs
- Offensive \(r\)-alliances in graphs
- Saturated boundary \(k\)-alliances in graphs
- Defensive alliances with prescribed and proscribed vertices
- Approximability of open \(k\)-monopoly problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488895)
