Clique-width of path powers (Q266933): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.11.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2286033726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of clique-width through nested partitions / 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: Clique-Width is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear layouts measuring neighbourhoods in graphs / 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: Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal classes of graphs of unbounded clique-width / 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: On a disparity between relative cliquewidth and relative NLC-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank

Latest revision as of 17:53, 11 July 2024

scientific article
Language Label Description Also known as
English
Clique-width of path powers
scientific article

    Statements

    Clique-width of path powers (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 April 2016
    0 references
    clique-width
    0 references
    proper interval graphs
    0 references
    linear-time computation
    0 references
    forbidden induced subgraphs characterisation
    0 references

    Identifiers