Classifying the clique-width of \(H\)-free bipartite graphs
From MaRDI portal
Publication:906431
DOI10.1016/j.dam.2015.06.030zbMath1329.05228arXiv1402.7060OpenAlexW1581957840MaRDI QIDQ906431
Daniël Paulusma, Konrad K. Dabrowski
Publication date: 21 January 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.7060
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Colouring diamond-free graphs, On quasi-planar graphs: clique-width and logical description, Clique‐width: Harnessing the power of atoms, Bounding clique-width via perfect graphs, Clique-Width for Graph Classes Closed under Complementation, Induced minor free graphs: isomorphism and clique-width, Clique-width and well-quasi-ordering of triangle-free graph classes, Bounding the clique-width of \(H\)-free split graphs, Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs, Unnamed Item, On efficient domination for some classes of \(H\)-free bipartite graphs, Optimal centrality computations within bounded clique-width graphs, Maximum matching in almost linear time on graphs of bounded clique-width, Tree Pivot-Minors and Linear Rank-Width
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colouring of graphs with Ramsey-type forbidden subgraphs
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- 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.
- Edge dominating set and colorings on graphs with fixed clique-width
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Clique-width for 4-vertex forbidden subgraphs
- Bounding Clique-Width via Perfect Graphs
- Classifying the Clique-Width of H-Free Bipartite Graphs
- Bounding the Clique-Width of H-free Chordal Graphs
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- Approximating rank-width and clique-width quickly
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Bounding the clique-width of \(H\)-free split graphs
