Obstructions for linear rank-width at most 1 (Q2442201): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59899339, #quickstatements; #temporary_batch_1712286835472
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1106.2533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions / 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: Graph Minors I: A Short Proof of the Path-width Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448752 / 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: Better Polynomial Algorithms on Graphs of Bounded Rank-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obstruction set isolation for the gate matrix layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge dominating set and colorings on graphs with fixed clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Width and Well-Quasi-Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank

Latest revision as of 13:54, 7 July 2024

scientific article
Language Label Description Also known as
English
Obstructions for linear rank-width at most 1
scientific article

    Statements

    Obstructions for linear rank-width at most 1 (English)
    0 references
    0 references
    0 references
    0 references
    2 April 2014
    0 references
    0 references
    linear rank-width of graphs
    0 references
    forbidden induced subgraphs
    0 references
    obstruction set
    0 references
    vector-minor
    0 references
    pivot-minor
    0 references
    0 references
    0 references
    0 references