Bounding the Clique-Width of H-free Chordal Graphs
From MaRDI portal
Publication:2946383
DOI10.1007/978-3-662-48054-0_12zbMath1468.05055arXiv1502.06948OpenAlexW1852241526MaRDI QIDQ2946383
Shenwei Huang, Andreas Brandstädt, Daniël Paulusma, Konrad K. Dabrowski
Publication date: 16 September 2015
Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.06948
Related Items (8)
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs ⋮ Bounding clique-width via perfect graphs ⋮ Classifying the clique-width of \(H\)-free bipartite graphs ⋮ A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs ⋮ Bounding the clique-width of \(H\)-free split graphs ⋮ Bounding the clique-width of \(H\)-free split graphs ⋮ Unnamed Item ⋮ On efficient domination for some classes of \(H\)-free chordal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Colouring vertices of triangle-free graphs without forests
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Recent developments on graphs of bounded clique-width
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- 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
- Split permutation graphs
- On the vertex packing problem
- Clique-width for 4-vertex forbidden subgraphs
- Line graphs of bounded clique-width
- Bounding Clique-Width via Perfect Graphs
- Classifying the Clique-Width of H-Free Bipartite Graphs
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs
- Clique-Width is NP-Complete
- On the homogeneous representation of interval graphs
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- On the Relationship Between Clique-Width and Treewidth
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Bounding the clique-width of \(H\)-free split graphs
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Bounding the Clique-Width of H-free Chordal Graphs
