On the dominating set polytope

DOI10.1016/j.ejc.2007.03.010zbMath1168.05340OpenAlexW2059418200MaRDI QIDQ2426444

T. M. Contenza, Carl W. Lee, Mustapha Bouchakour, Ali Ridha Mahjoub

Publication date: 22 April 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.03.010

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (13)

A polyhedral view to a generalization of multiple domination ⋮ On the independent dominating set polytope ⋮ Generalized minor inequalities for the set covering polyhedron related to circulant matrices ⋮ Some advances on the set covering polyhedron of circulant matrices ⋮ On dominating set polyhedra of circular interval graphs ⋮ On the dominating set polytope ⋮ The minor inequalities in the description of the set covering polyhedron of circulant matrices ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On \(f\)-domination: polyhedral and algorithmic results ⋮ On the star forest polytope for trees and cycles ⋮ On the dominating set polytope of web graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination, independent domination, and duality in strongly chordal graphs
• Characterizations of strongly chordal graphs
• A linear algorithm for finding a minimum dominating set in a cactus
• Facets and lifting procedures for the set covering polytope
• The ellipsoid method and its consequences in combinatorial optimization
• One-node cutsets and the dominating set polytope
• A linear algorithm for the domination number of a series-parallel graph
• On the dominating set polytope
• On a routing problem
• Polytope Des Absorbants Dans Une Classe De Graphe a Seuil
• Domination in permutation graphs
• Towards a theory of domination in graphs

This page was built for publication: On the dominating set polytope