✦ LIBER ✦

Subset feedback vertex sets in chordal graphs

✍ Scribed by Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Saei, Reza

Book ID: 123431200
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 234 KB
Volume: 26
Category: Article
ISSN: 1570-8667
DOI: 10.1016/j.jda.2013.09.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumerating Minimal Subset Feedback Vert

Enumerating Minimal Subset Feedback Vertex Sets

✍ Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos… 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 627 KB

Circular convex bipartite graphs: Feedba

Circular convex bipartite graphs: Feedback vertex sets

✍ Liu, Tian; Lu, Min; Lu, Zhao; Xu, Ke 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Feedback vertex set on cocomparability g

Feedback vertex set on cocomparability graphs

✍ Satyan R. Coorg; C. Pandu Rangan 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 716 KB

Dominating Sets in Chordal Graphs

✍ Booth, Kellogg S.; Johnson, J. Howard 📂 Article 📅 1982 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 977 KB

Minimum feedback vertex sets in cocompar

Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs

✍ Y. Daniel Liang; Maw-Shang Chang 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 165 KB

On feedback vertex sets and nonseparatin

On feedback vertex sets and nonseparating independent sets in cubic graphs

✍ Ewald Speckenmeyer 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 341 KB

Let G be an undirected connected graph with n nodes. A subset F of nodes of G is a feedback vertex set (fvs) if G -F is a forest and a subset J of nodes of G is a nonseparating independent set (nsis) if no two nodes of J are adjacent and G -J is connected. f(G), z ( G ) denote the cardinalities of a