Skip to main content
Article thumbnail
Location of Repository

Feedback vertex set on chordal bipartite graphs

By Ton Kloks, Ching-Hao Liu and Sheung-Hung Poon

Abstract

Let G=(A,B,E) be a bipartite graph with color classes A and B. The graph G is chordal bipartite if G has no induced cycle of length more than four. Let G=(V,E) be a graph. A feedback vertex set F is a set of vertices F subset V such that G-F is a forest. The feedback vertex set problem asks for a feedback vertex set of minimal cardinality. We show that the feedback vertex set problem can be solved in polynomial time on chordal bipartite graphs

Topics: Mathematics - Combinatorics
Year: 2012
OAI identifier: oai:arXiv.org:1104.3915
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1104.3915 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.