Bounding the clique-width of \(H\)-free split graphs
From MaRDI portal
Publication:5965534
DOI10.1016/j.dam.2016.04.003zbMath1348.05147OpenAlexW2963640883MaRDI QIDQ5965534
Shenwei Huang, Daniël Paulusma, Andreas Brandstädt, Konrad K. Dabrowski
Publication date: 2 November 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.04.003
Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)
Related Items
Colouring diamond-free graphs, Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy, On the number of maximal independent sets in minimum colorings of split graphs, Between clique-width and linear clique-width of bipartite graphs, Clique‐width: Harnessing the power of atoms, A class of graphs with large rankwidth, Bounding clique-width via perfect graphs, Clique-Width for Graph Classes Closed under Complementation, Unnamed Item, Optimal centrality computations within bounded clique-width graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colouring of graphs with Ramsey-type forbidden subgraphs
- Polynomial-time recognition of clique-width \(\leq 3\) graphs
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- Colouring vertices of triangle-free graphs without forests
- The strong perfect graph theorem
- Graph classes with and without powers of bounded clique-width
- Classifying the clique-width of \(H\)-free bipartite graphs
- Recent developments on graphs of bounded clique-width
- On variations of \(P_{4}\)-sparse graphs
- On the structure of (\(P_{5}\),\,gem)-free graphs
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- Upper bounds to the clique width of graphs
- Clique-width for 4-vertex forbidden subgraphs
- Bounding Clique-Width via Perfect Graphs
- Bounding the Clique-Width of H-free Chordal Graphs
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs
- Towards an Isomorphism Dichotomy for Hereditary Graph Classes
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Bounding the clique-width of \(H\)-free split graphs
