✦ LIBER ✦

The 2-dominating set polytope of cycles and related graph classes

✍ Scribed by Argiroffo, G.; Escalante, M.; Ugarte, M.E.

Book ID: 122156457
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 175 KB
Volume: 44
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2013.10.042

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the dominating set polytope of web gr

On the dominating set polytope of web graphs

✍ S. Bianchi; G. Nasini; P. Tolomei 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 192 KB

Boundary classes of graphs for the domin

Boundary classes of graphs for the dominating set problem

✍ Vladimir E Alekseev; Dmitry V Korobitsyn; Vadim V Lozin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 210 KB

The dominant of the 2-connected-Steiner-

The dominant of the 2-connected-Steiner-subgraph polytope for W4-free graphs

✍ Collette R Coullard; Abdur Rais; Ronald L Rardin; Donald K Wagner 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 789 KB

On the cycle polytope of a directed grap

On the cycle polytope of a directed graph and its relaxations

✍ Egon Balas; Rüdiger Stephan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

Computing a minimum outer-connected domi

Computing a minimum outer-connected dominating set for the class of chordal graphs

✍ Mark Keil, J.; Pradhan, D. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 409 KB

Stability critical graphs and ranks face

Stability critical graphs and ranks facets of the stable set polytope

✍ E.C. Sewell; L.E. Trotter Jr. 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 616 KB

Rank inequalities due to stability critical (u-critical) graphs are used to develop a finite nested sequence of linear relaxations of the stable set polytope, the strongest of which provides an integral max-min relation: In a simple graph, the maximum size of a stable set is equal to the minimum (we