scientific article; zbMATH DE number 2076807
From MaRDI portal
Publication:4470237
zbMath1050.05096MaRDI QIDQ4470237
Teresa W. Haynes, Linda Marie Lawson, Stephen T. Hedetniemi, Sandra M. Hedetniemi, Gerd H. Fricke
Publication date: 22 June 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Parameterized complexity of locally minimal defensive alliances ⋮ Security in graphs ⋮ On structural parameterizations of the offensive alliance problem ⋮ New sharp lower bound for the quorum coloring number of trees ⋮ Global strong defensive alliances of Sierpiński-like graphs ⋮ Small alliances in a weighted graph ⋮ Partitioning a graph into global powerful \(k\)-alliances ⋮ Globally minimal defensive alliances ⋮ Parameterized intractability of defensive alliance problem ⋮ Extended MSO model checking via small vertex integrity ⋮ Bounds on a graph's security number ⋮ Alliance polynomial of regular graphs ⋮ Boundary defensive \(k\)-alliances in graphs ⋮ Alliances in graphs of bounded clique-width ⋮ Global defensive \(k\)-alliances in graphs ⋮ Offensive \(r\)-alliances in graphs ⋮ Alliances and Related Domination Parameters ⋮ Powerful alliances in graphs ⋮ On the complement graph and defensive \(k\)-alliances ⋮ Global defensive alliances in star graphs ⋮ Defensive \(k\)-alliances in graphs ⋮ Defensive alliances in graphs ⋮ On a graph's security number ⋮ Unnamed Item
This page was built for publication:
