A Characterization of Graphs with Vertex Cover Six

Authors:
Michael J. Dinneen;Liu Xiong
Affiliations:
-;-
Venue:
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Year:
2000

Citing 7
Cited 0

An improved fixed-parameter algorithm for vertex cover

Information Processing Letters
On computing graph minor obstruction sets

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Finding Minimal Forbidden Minors Using a Finite Congruence

ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
A Characterization of Graphs with Vertex Cover up to Five

ORDAL '94 Proceedings of the International Workshop on Orders, Algorithms, and Applications
Monadic Second Order Logic, Tree Automata and Forbidden Minors

CSL '90 Proceedings of the 4th Workshop on Computer Science Logic
An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

The complete list of forbidden minors (obstructions) for the family of graphs with vertex cover 6 have been found. This paper shows how one can limit the search space of graphs and how to simplify the process for deciding whether a graph is an obstruction for k-VERTEX COVER. The upper bounds 2k + 1 (2k + 2) on the maximum number of vertices for connected (disconnected) obstructions are shown to be sharp for all k 0.