One-node cutsets and the dominating set polytope
From MaRDI portal
Publication:1356733
DOI10.1016/S0012-365X(96)00164-1zbMath0872.90104WikidataQ127673873 ScholiaQ127673873MaRDI QIDQ1356733
Mustapha Bouchakour, Ali Ridha Mahjoub
Publication date: 10 June 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)
Related Items
On the independent dominating set polytope, On the dominating set polytope, On total \(f\)-domination: polyhedral and algorithmic results, Unnamed Item, On \(f\)-domination: polyhedral and algorithmic results, On the star forest polytope for trees and cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The max-cut problem on graphs not contractible to \(K_ 5\)
- On domination and independent domination numbers of a graph
- Domination, independent domination, and duality in strongly chordal graphs
- Dominating sets for split and bipartite graphs
- Characterizations of strongly chordal graphs
- Dominating sets and domatic number of circular arc graphs
- A linear algorithm for finding a minimum dominating set in a cactus
- Dominating sets in perfect graphs
- On a composition of independence systems by circuit identification
- Characterization of stable matchings as extreme points of a polytope
- Compositions in the bipartite subgraph polytope
- Polyhedral consequences of the amalgam operation
- A linear algorithm for the domination number of a series-parallel graph
- Domination on Cocomparability Graphs
- Polytope Des Absorbants Dans Une Classe De Graphe a Seuil
- Domination in permutation graphs
- Towards a theory of domination in graphs
- Of Stable Marriages and Graphs, and Strategy and Polytopes
- Balanced matrices
