Linear rank-width and linear clique-width of trees (Q2346380): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57950033 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.04.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2139665196 / rank
 
Normal rank
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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pathwidth and treewidth of cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming trees by successive local complementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / 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: Fugitive-search games on graphs and related parameters / 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: Clique-Width is NP-Complete / 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: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations for co-graphs defined by restricted NLC-width or clique-width operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear layouts measuring neighbourhoods in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relationship between NLC-width and linear NLC-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NLC-width and clique-width for powers of graphs of bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complete Characterisation of the Linear Clique-Width of Path Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of linear clique-width at most 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / 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: Searching and pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4246749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the size of obstructions and intertwines / 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: The complexity of searching a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width with an inactive label / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth of Circular-Arc Graphs / 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

Latest revision as of 04:32, 10 July 2024

scientific article
Language Label Description Also known as
English
Linear rank-width and linear clique-width of trees
scientific article

    Statements

    Linear rank-width and linear clique-width of trees (English)
    0 references
    0 references
    1 June 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    linear rank width
    0 references
    linear clique width
    0 references
    vertex minors
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references