Computing the clique-width of cactus graphs
From MaRDI portal
Recommendations
- Approximating clique-width and branch-width
- Deciding Clique-Width for Graphs of Bounded Tree-Width
- The relative clique-width of a graph
- Upper bounds to the clique width of graphs
- Computing Graph Polynomials on Graphs of Bounded Clique-Width
- Clique-width for graph classes closed under complementation
- scientific article; zbMATH DE number 7204407
- scientific article; zbMATH DE number 1830724
- Bounding clique-width via perfect graphs
- Bounding clique-width via perfect graphs
Cites work
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- scientific article; zbMATH DE number 6691415 (Why is no real title available?)
- scientific article; zbMATH DE number 2044924 (Why is no real title available?)
- scientific article; zbMATH DE number 1472167 (Why is no real title available?)
- scientific article; zbMATH DE number 1420904 (Why is no real title available?)
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Approximating clique-width and branch-width
- Centdian Computation for Sensor Networks
- Graph classes with and without powers of bounded clique-width
- Handle-rewriting hypergraph grammars
- Intractability of clique-width parameterizations
- Line graphs of bounded clique-width
- Polynomial-time recognition of clique-width 3 graphs
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Upper bounds to the clique width of graphs
This page was built for publication: Computing the clique-width of cactus graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744436)