Bounding the Clique-Width of H-free Chordal Graphs (Q2946383): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the clique-width of \(H\)-free split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width for 4-vertex forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of (\(P_{5}\),\,gem)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure and stability number of \(P_{5}\)- and co-chair-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time recognition of clique-width \(\leq 3\) graphs / 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: 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: Colouring of graphs with Ramsey-type forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding Clique-Width via Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring vertices of triangle-free graphs without forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Clique-Width of H-Free Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Width is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / 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: Line graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments on graphs of bounded clique-width / 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: Split permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the homogeneous representation of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: MSOL partitioning problems on graphs of bounded treewidth and clique-width / rank
 
Normal rank

Latest revision as of 18:22, 10 July 2024

scientific article
Language Label Description Also known as
English
Bounding the Clique-Width of H-free Chordal Graphs
scientific article

    Statements

    Bounding the Clique-Width of H-free Chordal Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 September 2015
    0 references
    \(2P_2\)-free bipartite graph
    0 references
    induced subgraph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers