The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448): 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.2008.08.031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069832663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Clique-Width of Tree-Power and Leaf-Power Graphs / 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: \(k\)-NLC graphs and polynomial algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489221 / 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: Graph minors. II. Algorithmic aspects of tree-width / 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: Q4778545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex disjoint paths on clique-width bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing roots of graphs is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: On powers of graphs of bounded NLC-width (clique-width) / 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: Q4037313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Square Roots of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Tree Root Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graph Powers for Leaf-Labeled Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and linear time recognition of 3-leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and linear-time recognition of 4-leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks about leaf roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strictly chordal graphs are leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ptolemaic Graphs and Interval Graphs Are Leaf Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (k,ℓ)-Leaf Powers / 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: On simple characterizations of k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472526 / rank
 
Normal rank

Latest revision as of 17:15, 1 July 2024

scientific article
Language Label Description Also known as
English
The NLC-width and clique-width for powers of graphs of bounded tree-width
scientific article

    Statements

    The NLC-width and clique-width for powers of graphs of bounded tree-width (English)
    0 references
    0 references
    0 references
    30 June 2009
    0 references
    tree powers
    0 references
    leaf powers
    0 references
    Steiner powers
    0 references
    tree-width
    0 references
    clique-width
    0 references
    NLC-width
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers