Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.11.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985956090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / 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: Q4448752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivially perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / 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 the relationship between NLC-width and linear NLC-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <font>NLC</font><sub>2</sub>-DECOMPOSITION IN POLYNOMIAL TIME / 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: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dacey 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: The Comparability Graph of a Tree / rank
 
Normal rank

Latest revision as of 11:40, 24 June 2024

scientific article
Language Label Description Also known as
English
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
scientific article

    Statements

    Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (English)
    0 references
    0 references
    29 March 2006
    0 references
    NLCT-width
    0 references
    trivially perfect
    0 references
    threshold graphs
    0 references
    co-graphs
    0 references
    clique-width
    0 references

    Identifiers