Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q129383519, #quickstatements; #temporary_batch_1724703925167
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Obstructions for linear rank-width at most 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear rank-width and linear clique-width of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Monadic Second-Order Transduction Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isotropic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing prime graphs and recognizing circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphic presentations of isotropic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming trees by successive local complementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Decomposition Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Minors I: A Short Proof of the Path-width Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation and search number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thread Graphs, Linear Rank-Width and Their Algorithmic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The “Art of Trellis Decoding” Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded vertex-minors for graphs of linear rank-width at most \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid Pathwidth and Code Trellis Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outerplanar obstructions for matroid pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Width and Well-Quasi-Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding a bipartite circle graph from line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices / 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: Completely separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. IV: Tree-width and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal acyclic forbidden minors for the family of graphs with bounded path-width / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129383519 / rank
 
Normal rank

Latest revision as of 21:28, 26 August 2024

scientific article
Language Label Description Also known as
English
Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
scientific article

    Statements

    Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (English)
    0 references
    0 references
    7 September 2018
    0 references
    rank-width
    0 references
    linear rank-width
    0 references
    distance-hereditary graphs
    0 references
    vertex-minors
    0 references
    matroid branch-width
    0 references
    matroid path-width
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references