Properties of vertex cover obstructions

We study properties of the sets of minimal forbidden minors for the families of graphs having a vertex cover of size at most k. We denote this set by O(k-VERTEX COVER) and call it the set of obstructions. Our main result is to give a tight vertex bound of O(k-VERTEX COVER), and then confirm a conjecture made by Liu Xiong that there is a unique connected obstruction with maximum number of

• Type: Journal
• Year: 2007
• Where: DM
• Authors: Michael J. Dinneen, Rongwei Lai
• Keywords: DM 2007, Minimal Forbidden Minors, Tight Vertex, Vertex Cover