A Characterization of Graphs with Vertex Cover up to Five

Kevin Cattell, Michael J. Dinneen. A Characterization of Graphs with Vertex Cover up to Five. In Vincent Bouchitté, Michel Morvan, editors, Orders, Algorithms, and Applications, International Workshop ORDAL 94, Lyon, France, July 4-8, 1994, Proceedings. Volume 831 of Lecture Notes in Computer Science, pages 86-99, Springer, 1994.

@inproceedings{CattellD94,
  title = {A Characterization of Graphs with Vertex Cover up to Five},
  author = {Kevin Cattell and Michael J. Dinneen},
  year = {1994},
  tags = { vertex cover, forbidden minors, graph minors, graph-rewriting,  obstructions, rewriting},
  researchr = {https://researchr.org/publication/CattellD94},
  cites = {0},
  citedby = {0},
  pages = {86-99},
  booktitle = {Orders, Algorithms, and Applications, International Workshop ORDAL  94, Lyon, France, July 4-8, 1994, Proceedings},
  editor = {Vincent Bouchitté and Michel Morvan},
  volume = {831},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-58274-6},
}