Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Stefan Arnborg, Derek G. Corneil, Andrzej Proskurowski, and Detlef Seese. An algebraic theory of graph reduction. In Proceedings of the Fourth Workshop on Graph Grammars and Their Applications to Computer Science, volume 532, pp. 70–83. Lecture Notes in Computer Science, Springer-Verlag, 1991. To appear in Journal of the ACM.
Stefan Arnborg, Jens Lagergren, and Detlef Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12 (1991), pp. 308–340.
Hans L. Bodlaender. A linear time algorithm for finding tree-decompostions of small treewidth. In Proc. 25th Annual ACM Symposium on Theory of Computing. ACM Press, 1993.
Kevin Cattell and Michael J. Dinneen. VLSI Automated Compilation System — obstruction set computations (technical notes). In preparation.
Rod Downey and Michael R. Fellows. Parameterized computational feasibility. In P. Clote and J. Remmel, editors, Feasible Mathematics II. Birkhauser. To appear.
J. Ellis, I. H. Sudborough, and J. Turner. Graph separation and search number. Report DCS-66-IR, Dept. of Computer Science, University of Victoria, August 1987. To appear in Information and Computation.
Michael R. Fellows and Michael A. Langston. An analogue of the Myhill-Nerode Theorem and its use in computing finite-basis characterizations. In Proc. Symposium on Foundations of Computer Science (FOCS), pp. 520–525, 1989.
Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
Ton Kloks. Treewidth. Ph.D. dissertation, Dept. of Computer Science, Utrecht University, Utrecht, the Netherlands, 1993.
András Kornai and Zsolt Tuza. Narrowness, pathwidth, and their application in natural language processing. Discrete Applied Mathematics, 36 (1992), pp. 87–92.
Jens Lagergren and Stefan Arnberg. Finding minimal forbidden minors using a finite congruence. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming, volume 510, pp. 533–543. Springer-Verlag, Lecture Notes in Computer Science, 1991.
Rolf H. Möhring. Graph problems releted to gate matrix layout and PLA folding. In G. Tinhofer, E. Mayr, H. Noltemeier, and M. Syslo, editors, Computational Graph Theory, pp. 17–51. Springer-Verlag, 1990.
Donald J. Rose. On simple characterizations of k-trees. Discrete Mathematics, 7 (1973), pp. 17–322.
Neil Robertson and Paul D. Seymour. Graph Minors. XVI. Wagner's conjecture. To appear Journal of Combinatorial Theory, Series B.
Neil Robertson and Paul D. Seymour. Graph Minors — A Survey, In Surveys in Combinatorics, volume 103, pp. 153–171, Cambridge University Press, 1985.
T. V. Wimer. Linear algorithms on k-terminal graphs. Ph.D. dissertation, Dept. of Computer Science, Clemson University, August 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cattell, K., Dinneen, M.J. (1994). A characterization of graphs with vertex cover up to five. In: Bouchitté, V., Morvan, M. (eds) Orders, Algorithms, and Applications. ORDAL 1994. Lecture Notes in Computer Science, vol 831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019428
Download citation
DOI: https://doi.org/10.1007/BFb0019428
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58274-8
Online ISBN: 978-3-540-48597-1
eBook Packages: Springer Book Archive