A polyhedral view to a generalization of multiple domination

DOI10.1016/J.DAM.2022.01.011zbMATH Open1486.05232OpenAlexW4211251802MaRDI QIDQ832985FDOQ832985

José Neto

Publication date: 28 March 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.01.011

Recommendations

• A polyhedral view to generalized multiple domination and limited packing
• scientific article; zbMATH DE number 6438426
• On total \(f\)-domination: polyhedral and algorithmic results
• On \(f\)-domination: polyhedral and algorithmic results
• On general frameworks and threshold functions for multiple domination
• On upper bounds for multiple domination numbers of graphs
• Combinatorial bounds on paired and multiple domination in triangulations
• On the dominating set polytope
• An algorithm for prescribed multiple domination in arbitrary graphs
• On the domination polynomial of some graph operations

zbMATH Keywords

dominating setpolytopemultiple dominationlimited packing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Lectures on Polytopes
• The ellipsoid method and its consequences in combinatorial optimization
• On the facial structure of set packing polyhedra
• Limited packings in graphs
• Disjunctive programming: Properties of the convex hull of feasible points
• Characterizations of totally balanced matrices
• Title not available (Why is that?)
• Domination, independent domination, and duality in strongly chordal graphs
• \(k\)-tuple domination in graphs
• On the dominating set polytope
• Combinatorial optimization. Packing and covering
• The multiple domination and limited packing problems in graphs
• Convex Polytopes
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• A new domination conception
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• Title not available (Why is that?)
• Improved upper bounds for the \(k\)-tuple domination number
• Proof of a conjecture on \(k\)-tuple domination in graphs
• Limited packing and multiple domination problems: polynomial time reductions
• Limited Packings in Graphs
• Title not available (Why is that?)
• On total \(f\)-domination: polyhedral and algorithmic results
• On \(f\)-domination: polyhedral and algorithmic results
• On general frameworks and threshold functions for multiple domination
• The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs
• The Dominating Set Polytope via Facility Location
• Polytope Des Absorbants Dans Une Classe De Graphe a Seuil
• Graph substitution and set packing polytopes
• From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes

Cited In (3)

• A polyhedral view to generalized multiple domination and limited packing
• Title not available (Why is that?)
• New geometric representations and domination problems on tolerance and multitolerance graphs.

This page was built for publication: A polyhedral view to a generalization of multiple domination

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