Forbidden minors to graphs with small feedback sets

Discrete Mathematics

Volumn 230, Issue 1-3, 2001, Pages 215-252

  Dinneen, Michael J ^a   Cattell, Kevin ^b   Fellows, Michael R ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041865391     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00083-2     Document Type: Article

References (35)

1. S. Amborg, J. Lagergren, D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms 12 (1991) 308-340.
2. S. Arnborg, A. Proskurowski, D.G. Comeil, Minimal forbidden minor characterization of a class of graphs, Colloq. Math. Soc. János Bolyai 52 (1987) 49-62.
3. D. Archdeacon, S. Negami, unpublished manuscript.
4. H.L. Bodlaender, On linear time minor tests and depth first search, J. Algorithms 14 (1993) 1-23.
5. H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput. 25 (1996) 1305-1317.
6. R.B. Borie, Recursively constructed graph families: membership and linear algorithms, Ph.D. Thesis, Georgia Institute of Technology, School of Information and Computer Science, 1988.
7. 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, Berlin, 1994, pp. 86-99.
8. K. Cattell, M.J. Dinneen, R.G. Downey, M.R. Fellows, M.A. Langston, Computing graph minor obstructions sets, Theoret. Comput. Sci. 233 (2000) 107-127.
9. K. Cattell, M.J. Dinneen, M.R. Fellows, Obstructions to within a few vertices or edges of acyclic, in: Proceedings of the Fourth Workshop on Algorithms and Data Structures, WADS '95, Lecture Notes on Computer Science, Vol. 955, Springer, Berlin, 1995, pp. 415-427.
10. M.J. Dinneen, K. Cattell, M.R. Fellows, Forbidden minors to graphs with small feedback sets, Report CDMTCS-019, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, New Zealand, October 1996, see http://www.cs.auckland.ac.nz/CDMTCS/ researchreports/019mjd.pdf.
11. S.R. Coorg, C.P. Rangan, Feedback vertex set on cocomparability graphs, Networks 26 (1995) 101-111.
12. B. Courcelle, The monadic second-order logic of graphs III: treewidth, forbidden minors and complexity issues, Inform. Théor. 26 (1993) 257-286.
13. M.J. Dinneen, Bounded combinatorial width and forbidden substructures, Ph.D. Dissertation, Department of Computer Science, University of Victoria, P.O. Box 3055, Victoria, BC, Canada V8W3P6, December 1995.
14. H. Didjev, J. Reif, An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs, in: IEEE Symposium on Foundations of Computer Science Proceedings, Vol. 31, 1991, pp. 337-347.
15. R. Downey, M.R. Fellows, Parameterized computational feasibility, in: P. Clote, J. Remmel (Eds.), Feasible Mathematics II, Proceedings of the Second Cornell Workshop on Feasible Mathematics, Birkhauser, Basel, 1995, pp. 219-244.
16. M.R. Fellows, M.A. Langston, An analogue of the Myhill-Nerode Theorem and its use in computing finite-basis characterizations, in: Proceedings of the IEEE Symposium on Foundations of Computer Science, Vol. 30, 1989, pp. 520-525.
17. M. Funke, G. Reinelt, A polyhedral approach to the feedback vertex set problem, in: Integer Programming and Combinatorial Optimization, Vancouver, BC, Lecture Notes in Computer Science, Vol. 1084, Springer, Berlin, 1996, pp. 445-459.
18. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of script N sign ℘-Completeness, Freeman, New York, 1979.
19. H.H. Glover, J.P. Huneke, There are finitely many Kuratowski graphs for the protective plane, in: Graph Theory and Related Topics, Academic Press, New York, 1979, pp. 201-206.
20. 2 has no finite planar cover. KAM Series - Discrete Mathematics - Combinatorics - Operations Research - Optimization, No. 96-312, 1996 (also a Charles University technical report).
21. J. Philip Huneke, Personal communication.
22. A. Itai, M. Rodeh, Finding a minimum circuit in a graph, in: Nineth Proceedings of the ACM Symposium on the Theory of Computing, 1977, pp. 1-10.
23. N.G. Kinnersley, Obstruction set isolation for layout permutation problems, Ph.D. Thesis, Department of Computer Science, Washington State University, Pullman, WA 99164, 1989.
24. N.G. Kinnersley, M.A. Langston, Obstruction set isolation for the Gate Matrix Layout problem, Discrete Appl. Math. 54 (1994) 169-213.
25. K. Kuratowski, Sur le problè des courbes gauches en topologie, Fund. Math. 15 (1930) 271-283.
26. J. Lagergren, S. Arnborg, Finding minimal forbidden minors using a finite congruence, in: Proceedings of the 19th International Colloquium on Automata, Languages and Programming, Lecture Notes on Computer Science, Vol. 510, Springer, Berlin, 1991, pp. 533-543.
27. M.A. Langston, S. Ramachandramurthi, Dense layouts for series-parallel circuits, Technical Report, Department of Computer Science, University of Tennessee, Knoxville, TN 37996-1301, 1992.
28. E.L. Lloyd, M.L. Soffa, C.-C. Wang, On locating minimum feedback vertex sets, J. Comput. System Sci. 37 (3) (1988) 292-311.
29. H. Nakano, Y. Nakanishi, Structure of solution space in discrete optimization problem and its application to minimum feedback edge set problem, Technical Report, Osaka University, Vol. 25, No. 1254-1275, 1975, pp. 287-299.
30. S. Negami, The spherical genus and virtually planer graphs, Discrete Math. 70 (1988) 159-168.
31. S. Negami, Graphs which have no finite planar covering, Bull. Inst. Math., Academia Sinica 16 (4) (1988) 377-384.
32. E.T. Neufeld, Practical toroidality testing, Master's Thesis, Department of Computer Science, University of Victoria, P.O. Box 3055, Victoria, BC, Canada V8W 3P6, 1993.
33. N. Robertson, P.D. Seymour, Graph minors - a survey, in: Surveys in Combinatorics, Vol. 103, Cambridge University Press, Cambridge, 1985, pp. 153-171.
34. P.D. Seymour, A bound on the excluded minors for a surface, Bell Communications Research, Morristown, New Jersey, February 1993.
35. J.V. Leeuwen, Handbook of Theoretical Computer Science: A: Algorithms and Complexity Theory, MIT Press/North Holland Publishing Company, Amsterdam, 1990.