Small Alliances in Graphs

DOI10.1007/978-3-540-74456-6_21zbMATH Open1147.68604OpenAlexW2112328127MaRDI QIDQ3525571FDOQ3525571

Authors: Rodolfo Carvajal, Martin Matamala, Ivan Rapaport, Nicolas Schabanel 

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_21

Recommendations

• scientific article; zbMATH DE number 2076807
• scientific article; zbMATH DE number 2104820
• Global alliances in planar graphs
• Aspects of upper defensive alliances
• scientific article; zbMATH DE number 6475954

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Cited In (7)

• The complexity of the bootstraping percolation and other problems
• On dissemination thresholds in regular and irregular graph classes
• Parameterized complexity of locally minimal defensive alliances
• On the complement graph and defensive \(k\)-alliances
• An inclusion hierarchy of irreversible dynamos
• Aspects of upper defensive alliances
• Globally minimal defensive alliances

This page was built for publication: Small Alliances in Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525571)