✦ LIBER ✦

Connected vertex covers in dense graphs

✍ Scribed by Jean Cardinal; Eythan Levy

Book ID: 108281630
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 388 KB
Volume: 411
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.03.021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex Covers and Secure Domination in G

Vertex Covers and Secure Domination in Graphs

✍ Burger, Alewyn; Henning, Michael; van Vuuren, Jan 📂 Article 📅 2008 🏛 Taylor and Francis Group 🌐 English ⚖ 171 KB

Vertex suppression in 3-connected graphs

✍ Matthias Kriesell 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB

## Abstract To __suppress__ a vertex $v$ in a finite graph __G__ means to delete it and add an edge from __a__ to __b__ if __a__, __b__ are distinct nonadjacent vertices which formed the neighborhood of $v$. Let $G--x$ be the graph obtained from $G-x$ by suppressing vertices of degree at most 2 as

Dense Arbitrarily Vertex Decomposable Gr

Dense Arbitrarily Vertex Decomposable Graphs

✍ Mirko Horňák, Antoni Marczyk, Ingo Schiermeyer, Mariusz Woźniak 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 273 KB

Approximating vertex cover in dense hype

Approximating vertex cover in dense hypergraphs

✍ Jean Cardinal; Marek Karpinski; Richard Schmied; Claus Viehmann 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 227 KB

Dense critical and vertex-critical graph

Dense critical and vertex-critical graphs

✍ Tommy R. Jensen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 272 KB

Semi-hyper-connected vertex transitive g

Semi-hyper-connected vertex transitive graphs

✍ Zhao Zhang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 614 KB