On computing the minimum 3-path vertex cover and dissociation number of graphs

Abstract

The dissociation number of a graph G is the number of vertices in a maximum size induced subgraph of G with vertex degree at most 1. A k-path vertex cover of a graph G is a subset S of vertices of G such that every path of order k in G contains at least one vertex from S. The minimum 3-path vertex cover is a dual problem to the dissociation number. For this… (More)
DOI: 10.1016/j.tcs.2011.09.009

Topics

2 Figures and Tables

Slides referencing similar topics