On dominating set polyhedra of circular interval graphs
From MaRDI portal
Publication:2659194
DOI10.1016/j.disc.2020.112283zbMath1460.05143arXiv1712.07057OpenAlexW3119036550MaRDI QIDQ2659194
Paola B. Tolomei, Graciela L. Nasini, Luis M. Torres, Silvia M. Bianchi
Publication date: 25 March 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.07057
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of packing and covering (05B40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized minor inequalities for the set covering polyhedron related to circulant matrices
- Minor related row family inequalities for the set covering polyhedron of circulant matrices
- Domination, independent domination, and duality in strongly chordal graphs
- Dominating sets for split and bipartite graphs
- Claw-free graphs. III: Circular interval graphs
- Variations of \(Y\)-dominating functions on graphs
- The stable set polytope of quasi-line graphs
- On packing and covering polyhedra of consecutive ones circulant clutters
- On the set covering polyhedron of circulant matrices
- On the facial structure of the set covering polytope
- Generalized domination and efficient domination in graphs
- Dominating sets in perfect graphs
- Ideal 0, 1 matrices
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- Incidence matrices and interval graphs
- On the dominating set polytope
- The minor inequalities in the description of the set covering polyhedron of circulant matrices
- Almost all webs are not rank-perfect
- Some advances on the set covering polyhedron of circulant matrices
- Domination on Cocomparability Graphs
- Cyclic Scheduling via Integer Programs with Circular Ones
- Edge Dominating Sets in Graphs
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
