Domination

Navigation page for Blueprint/D5/S3/Combinatorics/Graph/Domination/ at upstream snapshot 880384c42100f2d04436d97c4ac862e91b4bba85.

Contents

• Strong domination under clique gluing
• The order-33 integer domination-root minimality claim
• An obstruction to global coalition universality
• A cubic error-detecting identifying code below density three quarters
• The Koch-Narayan bipartite edge bound is false
• Integer {2}-domination of three-row grids
• The Luiz–Vieira generalized Blanuša closing conjecture is false
• Rooted decomposition and the connected minus-four family
• Path endpoints and the original restricted family
• Actual maximal independent subsets of finite paths
• Real-root configurations of book domination polynomials
• Five paired coalition parts in the height-five binary tree
• Classification by an apex and an opposite label
• The complete formal generating series
• Trapezohedral minimal domination
• From actual graph subsets to actual path subsets
• Reversible classification of all labelled subsets