$\mathbb F$ -Rank-Width of (Edge-Colored) Graphs
From MaRDI portal
Publication:3014938
DOI10.1007/978-3-642-21493-6_10zbMath1339.05181OpenAlexW90797MaRDI QIDQ3014938
Michaël Rao, Mamadou Moustapha Kanté
Publication date: 8 July 2011
Published in: Algebraic Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21493-6_10
local complementation2-structureclique widthexcluded configurationsigma-symmetrypivot minorrank widthvertex minor
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)
Related Items (2)
Spined categories: generalizing tree-width beyond graphs ⋮ Automata for the verification of monadic second-order graph properties
Cites Work
- Unnamed Item
- Unnamed Item
- On the model-checking of monadic second-order formulas with edge set quantifications
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Recent developments on graphs of bounded clique-width
- On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth
- Graph operations characterizing rank-width
- Graph minors. V. Excluding a planar graph
- On the excluded minors for the matroids of branch-width \(k\)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Upper bounds to the clique width of graphs
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Approximating clique-width and branch-width
- Recognizability, hypergraph operations, and logical types
- Rank-width and vertex-minors
- Fusion in relational structures and the verification of monadic second-order properties
- Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects
- Digraph Decompositions and Eulerian Systems
- Decomposition of Directed Graphs
- Directed Rank-Width and Displit Decomposition
- Finding Branch-Decompositions and Rank-Decompositions
This page was built for publication: $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs
