The rank-width of edge-coloured graphs (Q2392245): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00224-012-9399-y / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2950414403 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0709.1433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Boolean-Width of a Graph: Structure and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying Two Graph Decompositions with Modular Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph Decompositions and Eulerian Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizability, hypergraph operations, and logical types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic notions of universal algebra for language theory and graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. XV: On a conjecture by D. Seese / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the model-checking of monadic second-order formulas with edge set quantifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph operations characterizing rank-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fusion in relational structures and the verification of monadic second-order properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-minors, monadic second-order logic, and a conjecture by Seese / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4492680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Width is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting truth assignments of formulas of bounded tree-width or clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2908838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Digraph Width Measures in Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are There Any Good Digraph Width Measures? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width and well-quasi-ordering in matroids and graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the excluded minors for the matroids of branch-width \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width, parse trees, and monadic second-order logic for matroids. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tutte Polynomial for Matroids of Bounded Branch-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-quasi-ordering of matrices under Schur complement and applications to directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Rank-Width and Displit Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5690468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative clique-width of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Width and Well-Quasi-Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order model-checking on decomposable matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-012-9399-Y / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:17, 18 December 2024

scientific article
Language Label Description Also known as
English
The rank-width of edge-coloured graphs
scientific article

    Statements

    The rank-width of edge-coloured graphs (English)
    0 references
    0 references
    1 August 2013
    0 references
    rank-width
    0 references
    clique-width
    0 references
    local complementation
    0 references
    vertex-minor
    0 references
    excluded configuration
    0 references
    2-structure
    0 references
    sigma-symmetry
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers