Bounding the clique-width of \(H\)-free split graphs (Q5965534): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2016.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963640883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes with and without powers of bounded clique-width / 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: Bounding the Clique-Width of H-free Chordal 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: 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: The strong perfect graph theorem / 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: 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: Q4193514 / 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: 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: Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs / 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: Towards an Isomorphism Dichotomy for Hereditary Graph Classes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:21, 12 July 2024

scientific article; zbMATH DE number 6646859
Language Label Description Also known as
English
Bounding the clique-width of \(H\)-free split graphs
scientific article; zbMATH DE number 6646859

    Statements

    Bounding the clique-width of \(H\)-free split graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    clique-width
    0 references
    split graph
    0 references
    perfect graph
    0 references
    forbidden induced subgraph
    0 references
    hereditary graph class
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references