Classifying the clique-width of \(H\)-free bipartite graphs (Q906431): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1581957840 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1402.7060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Clique-Width of H-free Chordal Graphs / 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: Q5463359 / 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 variations of \(P_{4}\)-sparse graphs / 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: 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: Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs / 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: On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5487903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES / 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: Approximating rank-width and clique-width quickly / 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 08:19, 11 July 2024

scientific article
Language Label Description Also known as
English
Classifying the clique-width of \(H\)-free bipartite graphs
scientific article

    Statements

    Classifying the clique-width of \(H\)-free bipartite graphs (English)
    0 references
    0 references
    0 references
    21 January 2016
    0 references
    clique-width
    0 references
    bipartite graph
    0 references
    graph class
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers