Rank-width and vertex-minors

2005/05/06 by Sang-il Oum, Sang‐il Oum · 162 citations
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Bipartite graph #Chordal graph #Cograph #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Mathematics #Vertex (graph theory)

paper · pdf · doi:10.1016/j.jctb.2005.03.003

published in Journal of Combinatorial Theory, Series B 95(1), 79-100 (Elsevier BV)

openalex publication_date 2005/05/06 · crossref created 2005/05/06 · crossref issued 2005/09/01 · crossref published 2005/09/01 · crossref published-print 2005/09/01 · crossref deposited 2020/04/07 · openalex created_date 2025/10/10 · crossref indexed 2026/07/19 · openalex updated_date 2026/08/02

Citations

• ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
• Upper bounds to the clique width of graphs
• Branch-Width and Well-Quasi-Ordering in Matroids and Graphs
• Distance-hereditary graphs
• Graph minors. X. Obstructions to tree-decomposition
• Graph minors. V. Excluding a planar graph
• Approximating clique-width and branch-width
• On the excluded minors for the matroids of branch-width k
• Quickly Excluding a Planar Graph
• Vertex-minors, monadic second-order logic, and a conjecture by Seese

Cited by

• Quantum network routing and local complementation
• Distance-hereditary graph [wikipedia]