Properties of vertex cover obstructions

Discrete Mathematics

Volumn 307, Issue 21, 2007, Pages 2484-2500

  Dinneen, Michael J ^a   Lai, Rongwei ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Forbidden graphs; Obstructions; Vertex cover

Indexed keywords

FINITE DIFFERENCE METHOD; MATHEMATICAL MODELS; SET THEORY;

FORBIDDEN GRAPHS; VERTEX COVER;

GRAPH THEORY;

EID: 34648836880     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.01.003     Document Type: Article

References (14)

1. F.N. Abu-Khzam, M.A. Langston, W.H. Suters, Fast, effective vertex cover kernelization: a tale of two algorithms, in: Proceedings of the ACS/IEEE International Conference on Computer Systems, January 2005.
2. K. Cattell, M.J. Dinneen, A characterization of graphs with vertex cover up to five, in: V. Bouchitte, M. Morvan (Eds.), Orders, Algorithms and Applications, ORDAL'94, Lecture Notes on Computer Science, vol. 831, Springer, July 1994, pp. 86-99, 〈http://www.cs.auckland.ac.nz/~mjd/vacs/vc5.pdf〉.
3. Cattell K., Dinneen M.J., Downey R.G., Fellows M.R., and Langston M.A. On computing graph minor obstruction sets. Theoret. Comput. Sci. 233 (2000) 107-127
4. Cattell K., Dinneen M.J., and Fellows M.R. Forbidden minors to graphs with small feedback sets. Discrete Math. 230 (2001) 215-252
5. Chartrand G., and Lesniak L. Graphs and Digraphs. 2nd ed. (1986), Wadsworth Inc.
6. Cheetham J., Dehne F., Rau-Chaplin A., Stege U., and Taillon P.J. Solving large FPT problems on coarse grained parallel machines. J. Comput. System Sci. 67 4 (2003) 691-706
7. Chen J., Kanj I., and Jai W. Vertex cover: further observations and further improvements. J. Algorithms 41 (2001) 280-301
8. M.J. Dinneen, R. Lai, Fixed drawings of some of the vertex cover 6 obstructions, 2004, 〈http://www.cs.auckland.ac.nz/~mjd/vacs/fixedvc6figs.pdf〉.
9. M.J. Dinneen, L. Xiong, The minor-order obstructions for the graphs of vertex cover six, Report CDMTCS-118, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, New Zealand (A shorter version appears in J. Graph Theory 41 (2002) 163-178.), 〈http://www.cs.auckland.ac.nz/CDMTCS/researchreports/118vc6.pdf〉.
10. Downey R.G., and Fellows M.R. Parameterized Complexity (1998), Springer, Berlin
11. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness (1979), W.H. Freeman and Company, New Yok, San Francisco, CA
12. Hall P. On representation of subsets. J. London Math. Soc. 10 (1935) 26-30
13. N. Robertson, P.D. Seymour, Graph minors-a survey, in: Surveys in Combinatorics, vol. 103, Cambridge University Press, Cambridge, 1985, pp. 153-171.
14. L. Xiong, Vertex cover obstructions and a minor containment algorithm, Master's Thesis, University of Auckland, 2000.