Bounding the Clique‐Width of H‐Free Chordal Graphs
From MaRDI portal
Publication:5360875
Recommendations
- Bounding the clique-width of H-free chordal graphs
- Bounding the clique-width of \(H\)-free split graphs
- Bounding the clique-width of \(H\)-free split graphs
- Classifying the clique-width of \(H\)-free bipartite graphs
- Classifying the clique-width of \(H\)-free bipartite graphs
- Chordal bipartite graphs of bounded tree- and clique-width
- Graphs of bounded cliquewidth are polynomially -bounded
- Upper bounds to the clique width of graphs
- Bounding clique-width via perfect graphs
- Bounding clique-width via perfect graphs
Cited in
(16)- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
- Optimal centrality computations within bounded clique-width graphs
- On quasi-planar graphs: clique-width and logical description
- Colouring diamond-free graphs
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy
- Bounding the clique-width of H-free chordal graphs
- scientific article; zbMATH DE number 7204318 (Why is no real title available?)
- Clique-width for graph classes closed under complementation
- Square-Free Graphs with No Six-Vertex Induced Path
- Bounding the clique-width of \(H\)-free split graphs
- On efficient domination for some classes of \(H\)-free chordal graphs
- Bounding the clique-width of \(H\)-free split graphs
- Clique‐width: Harnessing the power of atoms
- A class of graphs with large rankwidth
- On near optimal colorable graphs
This page was built for publication: Bounding the Clique‐Width of H‐Free Chordal Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5360875)
