On powers of graphs of bounded NLC-width (clique-width) (Q2383546): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62046065, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4501549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Clique-Width and Treewidth / 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: Q4448752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Edge dominating set and colorings on graphs with fixed clique-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: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank
 
Normal rank

Latest revision as of 15:50, 26 June 2024

scientific article
Language Label Description Also known as
English
On powers of graphs of bounded NLC-width (clique-width)
scientific article

    Statements

    On powers of graphs of bounded NLC-width (clique-width) (English)
    0 references
    0 references
    0 references
    19 September 2007
    0 references
    0 references
    clique-width
    0 references
    NLC-width
    0 references
    coloring
    0 references
    power graph
    0 references
    polynomial
    0 references
    0 references
    0 references