A Characterization of Graphs with Vertex Cover up to Five

Abstract

For the family of graphs with xed-size vertex cover k, we present all of the forbidden minors (obstructions), for k up to ve. We derive some results, including a practical nite-state recognition algorithm, needed to compute these obstructions.

DOI: 10.1007/BFb0019428

Extracted Key Phrases

Cite this paper

@inproceedings{Cattell1994ACO, title={A Characterization of Graphs with Vertex Cover up to Five}, author={Kevin Cattell and Michael J. Dinneen}, booktitle={ORDAL}, year={1994} }