论文信息 - Minor-order obstructions for the graphs of vertex cover 6

Minor-order obstructions for the graphs of vertex cover 6

We provide for the first time, a complete list of forbidden minors (obstructions) for the family of graphs with vertex cover 6. This study shows how to limit both the search space of graphs and improve the efficiency of an obstruction checking algorithm when restricted to k–VERTEX COVER graph families. In particular, our 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. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 163–178, 2002

M. Dinneen | Liu Xiong

[1] P. Hall. On Representatives of Subsets , 1935 .

[2] Henry H. Glover,et al. 103 Graphs that are irreducible for the projective plane , 1979, J. Comb. Theory, Ser. B.

[3] Dan Archdeacon,et al. A Kuratowski theorem for the projective plane , 1981, J. Graph Theory.

[4] S. Arnborg,et al. Finding Minimal Forbidden Minors Using a Finite Congruence , 1991, ICALP.

[5] Michael J. Dinneen,et al. Too Many Minor Order Obstructions , 1997, J. Univers. Comput. Sci..

[6] Michael R. Fellows,et al. An Improved Fixed-Parameter Algorithm for Vertex Cover , 1998, Inf. Process. Lett..

[7] M. Dinneen,et al. The Minor-Order Obstructions for The Graphs of Vertex Cover Six , 2000 .

[8] Michael R. Fellows,et al. On computing graph minor obstruction sets , 2000, Theor. Comput. Sci..

[9] Michael R. Fellows,et al. Forbidden minors to graphs with small feedback sets , 2001, Discret. Math..