论文信息 - A Characterization of Graphs with Vertex Cover up to Five - 字舞流文

A Characterization of Graphs with Vertex Cover up to Five

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

Michael J. Dinneen | Kevin Cattell | M. Dinneen | K. Cattell

[1] P. Seymour,et al. Surveys in combinatorics 1985: Graph minors – a survey , 1985 .

[2] Donald J. ROSE,et al. On simple characterizations of k-trees , 1974, Discret. Math..

[3] R. Downey,et al. Parameterized Computational Feasibility , 1995 .

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

[5] Stephen T. Hedetniemi,et al. Linear algorithms on k-terminal graphs , 1987 .

[6] Hans L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[7] Michael J. Dinneen,et al. The VLSI Automated Compilation System (VACS) Technical Manual , 1995 .

[8] Jonathan S. Turner,et al. GRAPH SEPARATION AND SEARCH NUMBER. , 1987 .

[9] Rolf H. Möhring,et al. Graph Problems Related to Gate Matrix Layout and PLA Folding , 1990 .

[10] Michael R. Fellows,et al. An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations , 1989, 30th Annual Symposium on Foundations of Computer Science.

[11] Bruno Courcelle,et al. An algebraic theory of graph reduction , 1993, JACM.

[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13] Detlef Seese,et al. Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[14] Zsolt Tuza,et al. Narrowness, pathwidth, and their application in natural language processing , 1992, Discret. Appl. Math..