Rank-width and vertex-minors

Journal of Combinatorial Theory. Series B

Volumn 95, Issue 1, 2005, Pages 79-100

  Oum, Sang Il ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

Binary matroid; Branch width; Clique width; Local complementation; Pivoting; Rank width; Vertex minor

Indexed keywords

EID: 23244468510     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jctb.2005.03.003     Document Type: Article

References (26)

1. R. Arratia B. Bollabás G.B. Sorkin The interlace polynomial of a graph J. Combin. Theory Ser. B 92 2 2004 199-233
2. H.-J. Bandelt H.M. Mulder Distance-hereditary graphs J. Combin. Theory Ser. B 41 2 1986 182-208
3. A. Bouchet Isotropic systems European J. Combin. 8 3 1987 231-244
4. A. Bouchet Transforming trees by successive local complementations J. Graph Theory 12 2 1988 195-207
5. A. Bouchet Circle graph obstructions J. Combin. Theory Ser. B 60 1 1994 107-144
6. D.G. Corneil, M. Habib, J.-M. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition of clique-width ≤ 3 graphs (extended abstract), in: G. Gonnet, D. Panario, A. Viola (Eds.) LATIN 2000: Theoretical Informatics. Fourth Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Lecture Notes in Computer Science, vol. 1776, Springer, Berlin, 2000, pp. 126-134.
7. B. Courcelle S. Olariu Upper bounds to the clique width of graphs Discrete Appl. Math. 101 1-3 2000 77-114
8. B. Courcelle, S. Oum, Vertex-minors, monadic second-order logic, and a conjecture by Sesse, 2004, submitted for publication.
9. J.F. Geelen A.M.H. Gerards N. Robertson G. Whittle On the excluded minors for the matroids of branch-width k J. Combin. Theory Ser. B 88 2 2003 261-265
10. J.F. Geelen A.M.H. Gerards G. Whittle Branch-width and well-quasi-ordering in matroids and graphs J. Combin. Theory Ser. B 84 2 2002 270-290
11. J.F. Geelen, A.M.H. Gerards, G. Whittle, Excluding a planar graph from GF (q)-representable matroids, manuscript, 2003.
12. F. Genest, Word and set complementation of graphs, invertible graphs, 2005, submitted for publication.
13. M.C. Golumbic, U. Rotics, On the clique-width of some perfect graph classes, Internat. J. Found. Comput. Sci. 11 (3) (2000) 423-443.
14. S. Iwata L. Fleischer S. Fujishige A combinatorial strongly polynomial algorithm for minimizing submodular functions J. ACM (JACM) 48 4 2001 761-777
15. K. Murota, Matrices and matroids for systems analysis, Algorithms and Combinatorics, vol. 20, Springer, Berlin, 2000.
16. S. Oum, P. Seymour, Approximating clique-width and branch-width, 2004, submitted for publication.
17. S. Oum, Rank-width and well-quasi-ordering, manuscript, 2004.
18. S. Oum, Approximating rank-width and clique-width quickly, 2005, submitted for publication.
19. J.G. Oxley Matroid theory 1992 Oxford University Press, New York
20. N. Robertson P. Seymour Graph minors. V. Excluding a planar graph J. Combin. Theory Ser. B 41 1 1986 92-114
21. N. Robertson P. Seymour Graph minors. IV. Tree-width and well-quasi-ordering J. Combin. Theory Ser. B 48 2 1990 227-254
22. N. Robertson P. Seymour Graph minors. X. Obstructions to tree-decomposition J. Combin. Theory Ser. B 52 2 1991 153-190
23. N. Robertson P. Seymour R. Thomas Quickly excluding a planar graph J. Combin. Theory Ser. B 62 2 1994 323-348
24. K. Truemper A decomposition theory for matroids. I. General results J. Combin. Theory Ser. B 39 1 1985 43-76
25. K. Truemper Matroid Decomposition 1992 Academic Press Inc. Boston, MA
26. W.T. Tutte Menger's theorem for matroids J. Res. Nat. Bur. Standards Sect. B 69 1965 49-53