scientific article; zbMATH DE number 5056647
From MaRDI portal
Publication:5488895
zbMATH Open1103.05068MaRDI QIDQ5488895FDOQ5488895
Authors: Khurram Shafique, Ronald D. Dutton 
Publication date: 25 September 2006
Title of this publication is not available (Why is that?)
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
- A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set
- Alliances in graphs of bounded clique-width
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (20)
- Saturated boundary \(k\)-alliances in graphs
- Partitioning a graph into defensive \(k\)-alliances
- Alliance free sets in Cartesian product graphs
- On the complement graph and defensive \(k\)-alliances
- Global strong defensive alliances of Sierpiński-like graphs
- Defensive alliances with prescribed and proscribed vertices
- Global defensive \(k\)-alliances in graphs
- Defensive \(k\)-alliances in graphs
- Boundary defensive \(k\)-alliances in graphs
- Upper \(k\)-alliances in graphs
- Partitioning a graph into alliance free sets
- Approximability of open \(k\)-monopoly problems
- Title not available (Why is that?)
- Alliances and Related Domination Parameters
- 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
- Alliance free and alliance cover sets
- Partitioning a graph into global powerful \(k\)-alliances
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)
