文章基本信息

标题：On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
本地全文：下载
作者：Konrad K. Dabrowski ; Matthew Johnson ; Giacomo Paesani 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2018
卷号：117
页码：1-15
DOI：10.4230/LIPIcs.MFCS.2018.63
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：Let vc(G), fvs(G) and oct(G) denote, respectively, the size of a minimum vertex cover, minimum feedback vertex set and minimum odd cycle transversal in a graph G. One can ask, when looking for these sets in a graph, how much bigger might they be if we require that they are independent; that is, what is the price of independence? If G has a vertex cover, feedback vertex set or odd cycle transversal that is an independent set, then we let, respectively, ivc(G), ifvs(G) or ioct(G) denote the minimum size of such a set. We investigate for which graphs H the values of ivc(G), ifvs(G) and ioct(G) are bounded in terms of vc(G), fvs(G) and oct(G), respectively, when the graph G belongs to the class of H-free graphs. We find complete classifications for vertex cover and feedback vertex set and an almost complete classification for odd cycle transversal (subject to three non-equivalent open cases).
关键词：vertex cover; feedback vertex set; odd cycle transversal; price of independence